Secret Sharing using Non-Commutative Groups and the Shortlex Order

2013/11/27 by Bren Cavallo, Cavallo, Bren, Delaram Kahrobaei +1
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #cs.CR #math.GR

paper · pdf · doi:10.48550/arxiv.1311.7117

AMS CONM 2015

arxiv created 2014/12/15 · arxiv updated 2014/12/16

Abstract

In this paper we review the Habeeb-Kahrobaei-Shpilrain secret sharing scheme and introduce a variation based on the shortlex order on a free group. Drawing inspiration from adjustments to classical schemes, we also present a method that allows for the protocol to remain secure after multiple secrets are shared.

Related

• Publicly Verifiable Secret Sharing Using Non-Abelian Groups
• A Secret Sharing Scheme Based on Group Presentations and the Word Problem
• Almost-perfect secret sharing
• A secret sharing scheme using groups
• Multiparty secret sharing based on hidden multipliers