Secret sharing using non-commutative groups and the shortlex order

zbMATH Open1345.94093arXiv1311.7117MaRDI QIDQ2944010FDOQ2944010

Authors: Bren Cavallo, Delaram Kahrobaei 

Publication date: 7 September 2015

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.

Full work available at URL: https://arxiv.org/abs/1311.7117

Recommendations

• A secret sharing scheme based on group presentations and the word problem
• A verifiable secret sharing scheme using non-abelian groups
• scientific article; zbMATH DE number 1500489
• Publicly verifiable secret sharing using non-abelian groups
• scientific article; zbMATH DE number 2144114

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Authentication, digital signatures and secret sharing (94A62)

Cited In (10)

• Density of metric small cancellation in finitely presented groups
• A verifiable secret sharing scheme using non-abelian groups
• A secret sharing scheme based on group presentations and the word problem
• Geometry and Combinatorics via Right-Angled Artin Groups
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• On group-characterizability of homomorphic secret sharing schemes
• Shadow generation protocol in linguistic threshold schemes
• The use of mathematical linguistic methods in creating secret sharing threshold algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)

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)