论文信息 - Characterization of Optimal Key Set Protocols

Characterization of Optimal Key Set Protocols

Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by the so-called key set protocol. In this paper we give a necessary and sufficient condition for a key set protocol to be "optimal," that is, to succeed always in sharing a one-bit secret key.

Takao Nishizeki | Takaaki Mizuki | Hiroki Shizuya

[1] Takao Nishizeki,et al. Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key , 1999, EUROCRYPT.

[2] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[3] S. L. Hakimi,et al. On Planar Graphical Degree Sequences , 1977 .

[4] Takao Asano. An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees , 1995, J. Comput. Syst. Sci..

[5] Frank Harary,et al. Graph Theory , 2016 .

[6] Michael J. Fischer,et al. Secret Bit Transmission Using a Random Deal of Cards , 1990, Distributed Computing And Cryptography.

[7] Michael J. Fischer,et al. An Application of Game-Theoretic Techniques to Cryptography , 1990, Advances In Computational Complexity Theory.

[8] 水木敬明. Sharing Unconditionally Secure Secret Keys , 2000 .

[9] Michael J. Fischer,et al. Multiparty Secret Key Exchange Using a Random Deal of Cards , 1991, CRYPTO.

[10] Michael J. Fischer,et al. An efficient protocol for unconditionally secure secret key exchange , 1993, SODA '93.