Paper 2021/431
Unbounded Multi-Party Computation from Learning with Errors
Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, and Giulio Malavolta
Abstract
We consider the problem of round-optimal unbounded MPC: in the first round, parties publish a message that depends only on their input. In the second round, any subset of parties can jointly and securely compute any function
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2021
- Keywords
- Secure Multi-Party ComputationLWE
- Contact author(s)
-
prabhanjan va @ gmail com
abhishek @ cs jhu edu
zjin12 @ jhu edu
giulio malavolta @ hotmail it - History
- 2021-04-06: received
- Short URL
- https://ia.cr/2021/431
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/431, author = {Prabhanjan Ananth and Abhishek Jain and Zhengzhong Jin and Giulio Malavolta}, title = {Unbounded Multi-Party Computation from Learning with Errors}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/431}, year = {2021}, url = {https://eprint.iacr.org/2021/431} }