More Efficient Match-Making and Satisfiability: The Five Card Trick
More Efficient Match-Making and Satisfiability: The Five Card Trick
复制标题
更高效的匹配和满意度：五张牌技巧
DOI：
10.1007/3-540-46885-4_23
复制
发表时间：
1990
影响因子：
2.6
通讯作者：
Bert den Boer
中科院分区：
文献类型：
--
作者：
Bert den Boer
提出了一种用于评估任意二进制门的两方密码协议。它比以前的两方计算效率更高，甚至可以比已知技术更有效地执行单方(即可满足性)证明。正如在所有早期的多方计算和可满足性协议中一样，承诺是一个基本的构建块。在我们的方法中，每一方都将单个输入比特编码为2比特承诺。然后将这些组合形成5比特承诺，这些承诺被置换，然后可以被打开以揭示门的输出。
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.