Skip to main content
Book Chapter

How to share a secret

Springer Berlin Heidelberg, (2011), 159-168
DOI: 10.1007/978-3-642-15328-0_17
4Citations
Citations of this article
750Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Blömer, J. (2011). How to share a secret. In Algorithms Unplugged (pp. 159–168). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free