Name
Abstract | ||
|---|---|---|
Secure computation enables mutually distrusting parties to jointly evaluate a function on their private inputs without revealing anything but the function's output. Generic secure computation protocols in the semi-honest model have been studied extensively and several best practices have evolved.\ In this work, we design and implement a mixed-protocol framework, called emph{ABY}, that efficiently combines secure computation schemes based on underline{A}rithmetic sharing, underline{B}oolean sharing, and underline{Y}ao's garbled circuits and that makes available best practice solutions in secure two-party computation. Our framework allows to pre-compute almost all cryptographic operations and provides novel, highly efficient conversions between secure computation schemes based on pre-computed oblivious transfer extensions. ABY supports several standard operations and we perform benchmarks on a local network and in a public intercontinental cloud. From our benchmarks we deduce new insights on the efficient design of secure computation protocols, most prominently that oblivious transfer-based multiplications are much more efficient than multiplications based on homomorphic encryption. We use ABY to construct mixed-protocols for three example applications -- private set intersection, biometric matching, and modular exponentiation -- and show that they are more efficient than using a single protocol. |
Year | DocType | Citations |
|---|---|---|
2015 | Conference | 64 |
PageRank | References | Authors |
1.33 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Demmler | 1 | 128 | 7.16 |
| Thomas Schneider | 2 | 1540 | 69.17 |
| Michael Zohner | 3 | 409 | 13.44 |