Welcome to the resource topic for 2012/246
Title:
A Secret Sharing Scheme Based on Group Presentations and the Word Problem
Authors: Maggie Habeeb, Delaram Kahrobaei, Vladimir Shpilrain
Abstract:A (t,n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t-1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the secret. The other one is a (t,n)-threshold scheme that is a combination of Shamir’s scheme and the group-theoretic scheme proposed in this paper.
ePrint: https://eprint.iacr.org/2012/246
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .