You are looking at a specific version 20180216:164053 of this paper.
See the latest version.
Paper 2018/180
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
Sanjam Garg and Peihan Miao and Akshayaram Srinivasan
Abstract
We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) $\mathsf{poly}(n,\lambda)$ invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and $\mathsf{poly}(\lambda, |C|)$ cheaper one-way function calls, where $\lambda$ is the security parameter, $n$ is the number of parties, and $C$ is the circuit being computed. All previously known two-round multiparty secure computation protocols required $\mathsf{poly}(\lambda,|C|)$ expensive public-key operations.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- akshayaram @ berkeley edu
- History
- 2018-06-11: last of 2 revisions
- 2018-02-14: received
- See all versions
- Short URL
- https://ia.cr/2018/180
- License
-
CC BY