Abstract
This chapter deals with cryptographic methods for sharing information. For example, a gang of pirates can share a treasure map in such a way that all pirates must meet in order to find the treasure, or a group of three bank clerks can share a code for a safe in such a way that it is necessary and sufficient for opening the safe if any two of the three clerks combine their codes.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Blömer, J. (2011). How to Share a Secret. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)