Paper 2016/194
How to Share a Secret, Infinitely
Ilan Komargodski, Moni Naor, and Eylon Yogev
Abstract
Secret sharing schemes allow a dealer to distribute a secret piece of information among several parties such that only qualified subsets of parties can reconstruct the secret. The collection of qualified subsets is called an access structure. The best known example is the
Note: IEEE Transactions on Information Theory; doi 10.1109/TIT.2017.2779121
Metadata
- Available format(s)
-
PDF
- Publication info
- A minor revision of an IACR publication in TCC 2016
- Keywords
- dynamic access structuresecret sharingthreshold access structure
- Contact author(s)
-
komargodski @ cornell edu
eylon yogev @ weizmann ac il - History
- 2018-05-08: last of 3 revisions
- 2016-02-24: received
- See all versions
- Short URL
- https://ia.cr/2016/194
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/194, author = {Ilan Komargodski and Moni Naor and Eylon Yogev}, title = {How to Share a Secret, Infinitely}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/194}, year = {2016}, url = {https://eprint.iacr.org/2016/194} }