Abstract
Suppose you have n people, with whom you wish to share a secret. However, you do not wish to entrust any of them individually with the secret. Rather, you only want to allow them to learn what the secret is when a significant coalition of the people, at least k, say, work together to learn it. Furthermore, you don’t want to allow smaller coalitions to learn bits of the secret; you want any coalition of at most \(k-1\) people not to be able to learn anything at all. How do you do it?
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
This problem is called the Dining Cryptographer Problem . It was proposed by David Chaum in [Cha88].
- 2.
See [Ped91] for one solution.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Rubinstein-Salzedo, S. (2018). Secret Sharing, Visual Cryptography, and Voting. In: Cryptography. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-94818-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-94818-8_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94817-1
Online ISBN: 978-3-319-94818-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)