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
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Comparing information without leaking it
Communications of the ACM
Secure multiparty computations without computers
Theoretical Computer Science
Computations with a deck of cards
Theoretical Computer Science
Public-Key Cryptography
Caesar and DNA. Views on Cryptology
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Private computation using a PEZ dispenser
Theoretical Computer Science
Characterization of optimal key set protocols
Discrete Applied Mathematics
Basing cryptographic protocols on tamper-evident seals
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
The five-card trick can be done with four cards
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
There have existed several "card-based protocols" for secure computations of a Boolean function such as AND and XOR. The best result currently known is that AND and XOR can be securely computed using 8 cards and 10 cards, respectively. In this paper, we improve the result: we design a 6-card AND protocol and a 4-card XOR protocol. Thus, this paper succeeds in reducing the number of required cards for secure computations.