Two-round Multiparty Secure Computation from Minimal Assumptions
Abstract
We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest adversaries (in the plain model) then so is our two-round MPC protocol. Similarly, if the assumed two-round OT protocol is secure against malicious adversaries (in the common random/reference string model) then so is our two-round MPC protocol. Previously, two-round MPC protocols were only known under relatively stronger computational assumptions.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Oct 27, 2022
- Source ID
- 10.1145/3566048
Entities
People
- Akshayaram Srinivasan
- Sanjam Garg
Organizations
- Air Force Office of Scientific Research
- Division of Computer and Network Systems
- Tata Institute of Fundamental Research
- University of California, Berkeley