Eulerian secret key exchange

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)


Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share information-theoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the notion of an Eulerian secret key exchange, in which the pairs of players sharing secret keys form an Eulerian circuit passing through all players. Along the Eulerian circuit any designated player can send a message to the rest of players and the message can be finally returned to the sender. Checking whether the returned message is the same as the original one, the sender can know whether the message circulation has been completed without any false alteration. We then give three efficient protocols to realize such an Eulerian secret key exchange. Each of the three protocols is optimal in a sense. The first protocol requires the minimum number of cards under a natural assumption that the same number of cards are dealt to each player. The second requires the minimum number of cards dealt to all players when one does not make the assumption. The third forms the shortest Eulerian circuit, and hence the time required to send the message to all players and acknowledge the secure receipt is minimum in this case.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 4th Annual International Conference COCOON 1998, Proceedings
EditorsWen-Lian Hsu, Ming-Yang Kao
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540648240, 9783540648246
Publication statusPublished - 1998
Event4th Annual International Computing and Combinatorics Conference, COCOON 1998 - Taipei, Taiwan, Province of China
Duration: 1998 Aug 121998 Aug 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other4th Annual International Computing and Combinatorics Conference, COCOON 1998
Country/TerritoryTaiwan, Province of China

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Eulerian secret key exchange'. Together they form a unique fingerprint.

Cite this