Paper 2020/1451
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs
Elette Boyle, Niv Gilboa, Yuval Ishai, and Ariel Nof
Abstract
Secure computation protocols enable mutually distrusting parties to compute a function of their private inputs while revealing nothing but the output.
Protocols with {\em full security} (also known as {\em guaranteed output delivery}) in particular protect against denial-of-service attacks, guaranteeing that honest parties receive a correct output. This feature can be realized in the presence of an honest majority, and significant research effort has gone toward attaining full security with good asymptotic and concrete efficiency.
We present an efficient protocol for {\em any constant} number of parties
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in ASIACRYPT 2020
- Keywords
- Multi-party computation
- Contact author(s)
- nofdinar @ gmail com
- History
- 2021-01-22: revised
- 2020-11-19: received
- See all versions
- Short URL
- https://ia.cr/2020/1451
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1451, author = {Elette Boyle and Niv Gilboa and Yuval Ishai and Ariel Nof}, title = {Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1451}, year = {2020}, url = {https://eprint.iacr.org/2020/1451} }