Secret Sharing using Non-Commutative Groups and the Shortlex Order
arXiv:1311.7117v23 citations
Originality Synthesis-oriented
AI Analysis
This work addresses secure secret sharing in cryptography, but it appears incremental as it builds on an existing scheme with adjustments.
The paper introduces a variation of the Habeeb-Kahrobaei-Shpilrain secret sharing scheme using the shortlex order on a free group and presents a method to maintain security after sharing multiple secrets.
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.