Sharing secret keys along a Eulerian circuit

A method for sharing secret keys that is information-theoretically secure i s an important problem in the area of cryptography. By randomly distributin g cards to players, it is possible to provide random information with which information-theoretically secure secret keys can be shared by players. Thi s paper formulates sharing secret keys along a Eulerian circuit for informa tion transmission for which the receipt can be confirmed and provides a pro tocol for its realization. The conditions for the success of the protocol f or sharing secret keys along a Eulerian circuit are identified. Further, un der the natural assumption that the same numbers of cards are distributed t o each player, it is shown that the number of cards distributed is a minimu m. (C) 1999 Scripta Technica.