Abstract
A method for sharing secret keys that is informationtheoretically 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. © 1999 Scripta Technica, Electron Comm Jpn Pt 3, 83(4): 3342, 2000
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
