Paper 2018/572
Round-Optimal Secure Multiparty Computation with Honest Majority
Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, and Abhishek Jain
Abstract
We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal
Note: Added citation to concurrent work
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in CRYPTO 2018
- Keywords
- Secure Computation
- Contact author(s)
-
prabhanjan @ csail mit edu
achoud @ cs jhu edu
agoel10 @ jhu edu
abhishek @ cs jhu edu - History
- 2018-09-10: last of 5 revisions
- 2018-06-05: received
- See all versions
- Short URL
- https://ia.cr/2018/572
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/572, author = {Prabhanjan Ananth and Arka Rai Choudhuri and Aarushi Goel and Abhishek Jain}, title = {Round-Optimal Secure Multiparty Computation with Honest Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/572}, year = {2018}, url = {https://eprint.iacr.org/2018/572} }