A method for sharing secret keys that is information-theoretically secure is an important problem in the area of cryptography. By randomly distributing cards to players, it is possible to provide random information with which information-theoretically secure secret keys can be shared by players. This paper formulates sharing secret keys along a Eulerian circuit for information transmission for which the receipt can be confirmed and provides a protocol for its realization. The conditions for the success of the protocol for sharing secret keys along a Eulerian circuit are identified. Further, under the natural assumption that the same numbers of cards are distributed to each player, it is shown that the number of cards distributed is a minimum.
|Number of pages||10|
|Journal||Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)|
|Publication status||Published - 2000 Dec 1|
ASJC Scopus subject areas
- Electrical and Electronic Engineering