Name
Abstract | ||
|---|---|---|
We propose a new protocol for two-party computation, secure against malicious adversaries, that is significantly faster than prior work in the single-execution setting (i.e., non-amortized and with no preprocessing). In particular, for computational security parameter kappa and statistical security parameter rho, our protocol uses only rho garbled circuits and O(rho + kappa) public-key operations, whereas previous work with the same number of garbled circuits required either O(rho . n + kappa) public-key operations (where n is the input/output length) or a second execution of a secure-computation sub-protocol. Our protocol can be based on the decisional Diffie-Hellman assumption in the standard model. We implement our protocol to evaluate its performance. With rho = 40, our implementation securely computes an AES evaluation in 65 ms over a local-area network using a single thread without any pre-computation, 22x faster than the best prior work in the non-amortized setting. The relative performance of our protocol is even better for functions with larger input/output lengths. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-56617-7_14 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT III |
Field | DocType | Volume |
Discrete mathematics,Standard Model,Computer science,Computational security,Theoretical computer science,Security parameter,Secure two-party computation,Oblivious transfer,Computation | Conference | 10212 |
ISSN | Citations | PageRank |
0302-9743 | 15 | 0.51 |
References | Authors | |
23 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao Shaun Wang | 1 | 388 | 18.03 |
| Alex J. Malozemoff | 2 | 158 | 8.98 |
| Jonathan Katz | 3 | 7579 | 347.97 |