Abstract
The transformation protocol can make two players share a secret key using a random deal of cards. A sufficient condition on the number of cards for the transformation protocol to succeed was known. However, it has been an open problem to obtain a necessary and sufficient condition. This paper improves the transformation protocol and gives a necessary and sufficient condition for the improved transformation protocol to succeed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fischer, M.J., Paterson, M.S., Rackoff, C.: Secret bit transmission using a random deal of cards. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, pp. 173–181. AMS, Providence (1991)
Fischer, M.J., Wright, R.N. (eds.): An application of game-theoretic techniques to cryptography. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 99–118. AMS, Providence (1993)
Fischer, M.J., Wright, R.N.: An efficient protocol for unconditionally secure secret key exchange. In: Proc. the 4th Annual Symposium on Discrete Algorithms, pp. 475–483 (1993)
Fischer, M.J., Wright, R.N.: Bounds on secret key exchange using a random deal of cards. J. Cryptology 9, 71–99 (1996)
Fischer, M.J., Wright, R.N.: Multiparty secret key exchange using a random deal of cards. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 141–155. Springer, Heidelberg (1992)
Mizuki, T., Nishizeki, T.: Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups. IEICE Trans. Inf. & Syst. E85-D(2), 333–345 (2002)
Mizuki, T., Shizuya, H., Nishizeki, T.: A complete characterization of a family of key exchange protocols. International Journal of Information Security 1(2), 131–142 (2002)
Mizuki, T., Shizuya, H., Nishizeki, T.: Characterization of optimal key set protocols. Discrete Applied Mathematics 131, 213–236 (2003)
Mizuki, T., Shizuya, H., Nishizeki, T.: Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 389–401. Springer, Heidelberg (1999)
Mizuki, T., Shizuya, H., Nishizeki, T.: Eulerian secret key exchange. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 349–360. Springer, Heidelberg (1998)
Mizuki, T., Sui, Z., Shizuya, H., Nishizeki, T.: On the average length of secret key exchange Eulerian circuits. IEICE Trans. Fundamentals E83-A(4), 662–670 (2000)
Yoshikawa, R., Guo, S., Motegi, K., Igarashi, Y.: Construction of secret key exchange spanning trees by random deals of cards on hierarchical structures. IEICE Trans. Fundamentals E84-A(5), 1110–1119 (2001)
Winkler, P.: The advent of cryptology in the game of bridge. CRYPTOLOGIA 7, 327–332 (1983)
Wright, R.N.: Achieving Perfect Secrecy Using Correlated Random Variables. PhD Thesis, Yale University (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koizumi, K., Mizuki, T., Nishizeki, T. (2004). Necessary and Sufficient Numbers of Cards for the Transformation Protocol. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive