Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
复制标题
DOI:
10.1007/978-3-642-42045-0_23
复制
发表时间:
2013-12
期刊:
影响因子:
--
通讯作者:
L. Brandao
中科院分区:
文献类型:
--
作者:
L. Brandao
Asecure two-party computation(S2PC) protocol allows two parties to compute over their combined private inputs, as if intermediated by a trusted third party. In the malicious model, this can be achieved with acut-and-choose of garbled circuits(C&C-GCs), where some GCs areverifiedfor correctness and the remaining areevaluatedto determine the circuit output. This paper presents a new C&C-GCs-based S2PC protocol, with significant advantages in efficiency and applicability. First, in contrast with prior protocols that require a majority ofevaluatedGCs to be correct, the new protocol only requires that at least oneevaluatedGC is correct. In practice this reduces the total number of GCs to approximately one third, for the same statistical security goal. This is accomplished by augmenting the C&C with a newforge-and-losetechnique based on bit commitments with trapdoor. Second, the output of the new protocol includes reusable XOR-homomorphic bit commitments of all circuit input and output bits, thereby enabling efficient linkage of several S2PCs in a reactive manner. The protocol has additional interesting characteristics (which may allow new comparison tradeoffs), such as needing a low number of exponentiations, using a 2-out-of-1 type of oblivious transfer, and using the C&C structure to statistically verify the consistency of input wire keys.