EUROCRYPT 1989: Advances in Cryptology — EUROCRYPT ’89 pp 208-217 | Cite as
More Efficient Match-Making and Satisfiability The Five Card Trick
Conference paper
First Online:
Abstract
A two-party cryptographic protocol for evaluating any binary gate is presented. It is more efficient than previous two-party computations, and can even perform single-party (i.e. satisfiability) proofs more efficiently than known techniques. As in all earlier multiparty computations and satisfiability protocols, commitments are a fundamental building block. Each party in our approach encodes a single input bit as 2 bit commitments. These are then combined to form 5 bit commitments, which are permuted, and can then be opened to reveal the output of the gate.
Download
to read the full conference paper text
References
- [BCC]Brassard, G., Chaum, D. and Crepeau, C. “Minimal disclosure proofs of knowledge”. Journal of computer and system sciences, 37,2, october 1988, 156–189.MATHCrossRefMathSciNetGoogle Scholar
- [BC86]Brassard, G and Crepeau, C. “Zero-Knowledge Simulation of Boolean circuits.” Advances in Cryptology — Crypto’ 86, A.M. Odlyzko, Lecture Notes in Computer Science 263, 223–233, Springer-Verlag.Google Scholar
- [GM] Goldwasser, S., and Micali, S., “Probabilistic encryption”, JCSS, 28,2, 1984, 270–299.MATHMathSciNetGoogle Scholar
- [GMW86]Goldreich, O., Micali, S., Wigderson, A. “How to prove all NP statements in Zero-knowledge” Advances in Cryptology — Crypto’ 86, A.M. Odlyzko, Lecture Notes in Computer Science 263, 171–185, Springer-Verlag.Google Scholar
- [GMS]Goldreich, O., Mansour, Y., Sipser, M. “Interactive Proof systems: Provers that never fail and random selection”. Symp. on Found. of Comp. Sc., 28, oct 87, 449–461.Google Scholar
- [Wil80]Williams, H.C., “A modification of the RSA public-key encryption procedure.” IEEE Trans. Inform. Theory, 26(6), 726–729, November 1980.MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1990