On the Average Length of Secret Key Exchange Eulerian Circuits(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• 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 secret keys that are information-theoretically secure against an eavesdropper. A key set protocol, which uses a random deal of cards, can perform 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 sent back to the sender. Checking the returned message with the original one, the sender can know whether the message circulation has not been influenced by a possible single transmission error or false alteration. It has been known that any Eulerian circuit formed by the protocol has length at most 3/2k, where k is the number of players. Note that the length corresponds to the time required to send the message to all players and acknowledge the secure receipt. In this paper, we show that the average length of Eulerian circuits is approximately k+1nk.

• 社団法人電子情報通信学会の論文
• 2000-04-25

著者

• MIZUKI Takaaki

  Information Synergy Center, Tohoku University

• Nishizeki Takao

  The Author Is With The Graduate School Of Information Science Tohoku University

• Nishizeki Takao

  The Author Is With Graduate School Of Information Sciences Tohoku University

• Mizuki T

  Information Synergy Center Tohoku University

• Shizuya Hiroki

  The Authors Are With The Department Of Computer And Mathematical Sciences The Graduate School Of Inf

• Shizuya Hiroki

  The Author Is With Education Center For Information Processing Tohoku University

• MIZUKI Takaaki

  The authors are with Nishizeki Lab., Graduate School of Information Sciences, Tohoku University

• SUI Zhi-Bo

  The authors are with Nishizeki Lab., Graduate School of Information Sciences, Tohoku University

• Sui Zhi-bo

  The Authors Are With Nishizeki Lab. Graduate School Of Information Sciences Tohoku University

関連論文

• Quantum Card Dealing
• Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
• Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
• New Security Index for Digital Fingerprinting and Its Bounds
• On the Average Length of Secret Key Exchange Eulerian Circuits(Special Section on Discrete Mathematics and Its Applications)
• Planar Reconfiguration of Monotone Trees(Special Section on Discrete Mathematics and Its Applications)
• Generalized Vertex-Colorings of Partial k-Tress(Special Section on Discrete Mathematics and Its Applications)
• A Way of Making Trapdoor One-Way Functions Trapdoor No-Way : Special Section on Cryptography and Information Security
• On the Complexity of Constructing an Elliptic Curve of a Given Order : Special Section on Cryptography and Information Security
• On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks : Special Section on Cryptography and Information Security

スポンサーリンク