Skip to main content

How to Share a Secret

  • Chapter
Book cover Algorithms Unplugged

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics