Abstract
The “five-card trick” invented by Boer allows Alice and Bob to securely compute the AND function of their secret inputs using five cards—three black cards and two red cards—with identical backs. This paper shows that such a secure computation can be done with only four cards. Specifically, we give a protocol to achieve a secure computation of AND using only four cards—two black and two red. Our protocol is optimal in the sense that the number of required cards is minimum.
Chapter PDF
Similar content being viewed by others
References
Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theoretical Computer Science 306, 69–84 (2003)
den Boer, B.: More Efficient Match-Making and Satisfiability: The Five Card Trick. In: Quisquater, J.J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 208–217. Springer, Heidelberg (1990)
Crépeau, C., Kilian, J.: Discreet Solitary Games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319–330. Springer, Heidelberg (1994)
Mizuki, T., Sone, H.: Six-Card Secure AND and Four-Card Secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 358–369. Springer, Heidelberg (2009)
Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. Australasian Journal of Combinatorics 36, 279–293 (2006)
Moran, T., Naor, M.: Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 88–108. Springer, Heidelberg (2006)
Niemi, V., Renvall, A.: Secure multiparty computations without computers. Theoretical Computer Science 191, 173–183 (1998)
Stamer, H.: Efficient electronic gambling: an extended implementation of the toolbox for mental card games. In: Proc. Western European Workshop on Research in Cryptology (WEWoRC 2005). LNI, vol. P-74, pp. 1–12 (2005)
Stamm, S., Jakobsson, M.: Privacy-preserving polling using playing cards. IACR Eprint archive (2005)
Stiglic, A.: Computations with a deck of cards. Theoretical Computer Science 259, 671–678 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 International Association for Cryptologic Research
About this paper
Cite this paper
Mizuki, T., Kumamoto, M., Sone, H. (2012). The Five-Card Trick Can Be Done with Four Cards. In: Wang, X., Sako, K. (eds) Advances in Cryptology – ASIACRYPT 2012. ASIACRYPT 2012. Lecture Notes in Computer Science, vol 7658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-34961-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34960-7
Online ISBN: 978-3-642-34961-4
eBook Packages: Computer ScienceComputer Science (R0)