On the Isolation of a Common Secret

Don Beaver, Stuart Haber and Peter Winkler ()
Additional contact information
Stuart Haber: HP Labs
Peter Winkler: Dartmouth College

A chapter in The Mathematics of Paul Erdős II, 2013, pp 21-38 from Springer

Abstract: 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.

Keywords: Communication Protocol; Shared Secret; True Edge; Fano Plane; Separation Protocol (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7254-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461472544

DOI: 10.1007/978-1-4614-7254-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().