More Efficient Match-Making and Satisfiability The Five Card Trick
B Den Boer - Advances in Cryptology—EUROCRYPT'89: Workshop …, 1990 - Springer
B Den Boer
Advances in Cryptology—EUROCRYPT'89: Workshop on the Theory and Application …, 1990•SpringerA 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 (ie
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 …
efficient than previous two-party computations, and can even perform single-party (ie
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 …
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.
Springer