STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Comparing information without leaking it
Communications of the ACM
A Randomness-Rounds Tradeoff in Private Computation
SIAM Journal on Discrete Mathematics
Multiparty Secret Key Exchange Using a Random Deal of Cards
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Six-Card Secure AND and Four-Card Secure XOR
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Secure multiparty computations using a dial lock
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Secure multiparty computations using the 15 puzzle
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
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 | 5.23 |
We show how a (big) PEZ dispenser can be used by two or more players to compute a function of their inputs while hiding the values of the inputs from each other. In contrast to traditional approaches for solving this problem, ours does not require any use of randomness.