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
Switching Theory for Logic Synthesis
Switching Theory for Logic Synthesis
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Private computation using a PEZ dispenser
Theoretical Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
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
Secure computations in a minimal model using multiple-valued ESOP expressions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
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
| Hi-index | 0.00 |
This paper first explores the power of the dial locks (also called the combination locks), which are physical handy devices, in designing cryptographic protocols. Specifically, we design protocols for secure multiparty computations using the dial locks, and give some conditions for a Boolean function to be or not to be securely computable by a dial lock, i.e., to be or not to be "dial-computable." In particular, we exhibit simple necessary and sufficient conditions for a symmetric function to be dial-computable.