The five-card trick can be done with four cards

Authors:
Takaaki Mizuki;Michihito Kumamoto;Hideaki Sone
Affiliations:
Cyberscience Center, Tohoku University, Aoba-ku, Sendai, Japan;Cyberscience Center, Tohoku University, Aoba-ku, Sendai, Japan;Cyberscience Center, Tohoku University, Aoba-ku, Sendai, Japan
Venue:
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Year:
2012

Citing 7
Cited 0

More efficient match-making and satisfiability: the five card trick

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Discreet solitary games

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure multiparty computations without computers

Theoretical Computer Science
Computations with a deck of cards

Theoretical Computer Science
Private computation using a PEZ dispenser

Theoretical Computer Science
Six-Card Secure AND and Four-Card Secure XOR

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Polling with physical envelopes: a rigorous analysis of a human-centric protocol

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

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.