2000 character limit reached
Secret Sharing using Non-Commutative Groups and the Shortlex Order (1311.7117v2)
Published 27 Nov 2013 in math.GR and cs.CR
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.