Abstract
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by the so-called key set protocols. In this paper, we give a necessary and sufficient condition for a key set protocol to be "optimal", that is, to succeed always in sharing a one-bit secret key.
Original language | English |
---|---|
Pages (from-to) | 213-236 |
Number of pages | 24 |
Journal | Discrete Applied Mathematics |
Volume | 131 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2003 Sep 6 |
Event | 2nd International Colloquium - Metz, France Duration: 2000 May 22 → 2000 May 24 |
Keywords
- Card game
- Key exchange graph
- Key set protocol
- Secret key exchange
- Tree
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics