Summary
Two parties are said to “share a secret” if there is a question to which only they know the answer. Since possession of a shared secret allows them to communicate a bit between them over an open channel without revealing the value of the bit, shared secrets are fundamental in cryptology.
We consider below the problem of when two parties with shared knowledge can use that knowledge to establish, over an open channel, a shared secret. There are no issues of complexity or probability; the parties are not assumed to be limited in computing power, and secrecy is judged only relative to certainty, not probability. In this context the issues become purely combinatorial and in fact lead to some curious results in graph theory.
Applications are indicated in the game of bridge, and for a problem involving two sheriffs, eight suspects and a lynch mob.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zs. Baranyai, On the factorization of the complete uniform hypergraph, Infinite and finite sets (Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I (1975) 91–108.
M. Fischer, M. Paterson, and C. Rackoff, Secret bit transmission using a random deal of cards, Distributed Computing and Cryptography, American Mathematical Society (1991) 173–181.
M. Fischer and R. Wright, Multiparty secret key exchange using a random deal of cards, Proceedings of CRYPTO ’91, Springer-Verlag Lecture Notes in Computer Science, Vol 576 (1992) 141–155.
P. Winkler, Cryptologic techniques in bidding and defense (Parts I, II, III, IV), Bridge Magazine (April-July 1981) 148–149, 186–187, 226–227, 12–13.
P. Winkler, The advent of cryptology in the game of bridge, Cryptologia, vol. 7 (1983) 327–332.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Beaver, D., Haber, S., Winkler, P. (1997). On the Isolation of a Common Secret. In: Graham, R.L., Nešetřil, J. (eds) The Mathematics of Paul Erdös II. Algorithms and Combinatorics, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60406-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-60406-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64393-4
Online ISBN: 978-3-642-60406-5
eBook Packages: Springer Book Archive