Abstract
Suppose you have a secret s which you wish to share amongst a set P of n parties. You would like certain subsets of the n parties to recover the secret but not others. The classic scenario might be that s is a nuclear launch code and you have four people, the president, the vice-president, the secretary of state and a general in a missile silo.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Smart, N.P. (2016). Secret Sharing Schemes. In: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-21936-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-21936-3_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21935-6
Online ISBN: 978-3-319-21936-3
eBook Packages: Computer ScienceComputer Science (R0)