Sharing secret keys along a Eulerian circuit

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Research output: Contribution to journalArticlepeer-review

Abstract

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.

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Sharing secret keys along a Eulerian circuit'. Together they form a unique fingerprint.

Cite this