Secret sharing using non-commutative groups and the shortlex order
From MaRDI portal
Publication:2944010
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.
Recommendations
Cited in
(10)- On group-characterizability of homomorphic secret sharing schemes
- A verifiable secret sharing scheme using non-abelian groups
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- The use of mathematical linguistic methods in creating secret sharing threshold algorithms
- Shadow generation protocol in linguistic threshold schemes
- A secret sharing scheme based on group presentations and the word problem
- scientific article; zbMATH DE number 5982274 (Why is no real title available?)
- Density of metric small cancellation in finitely presented groups
- Geometry and Combinatorics via Right-Angled Artin Groups
- scientific article; zbMATH DE number 1942426 (Why is no real title available?)
This page was built for publication: Secret sharing using non-commutative groups and the shortlex order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944010)