Paper 2017/1156 Original: eprint.iacr.org/2017/1156 ↗
Two-Round Multiparty Secure Computation from Minimal Assumptions
Abstract
We provide new two-round multiparty secure computation (MPC) protocols 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. Finally, we provide several extensions.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2020-03-08: last updated
- 2017-11-29: published
- Short URL
- https://ia.cr/2017/1156
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/1156,
author = {Sanjam Garg and Akshayaram Srinivasan},
title = {Two-Round Multiparty Secure Computation from Minimal Assumptions},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/1156},
year = {2017},
url = {https://eprint.iacr.org/2017/1156}
}