Secret Sharing using Non-Commutative Groups and the Shortlex Order
classification
🧮 math.GR
cs.CR
keywords
ordersecretsharingshortlexadjustmentsallowsclassicaldrawing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.