Paper 2020/1337
Multiplicative Depth Independent & Efficient MPC in the Presence of Mixed Adversary
Achintya Desai, Shubham Raj, and Kannan Srinathan
Abstract
An extensive research of MPC protocols in different adversarial settings over the past few years has led to various improvements. Goyal et al.\cite{goyal2019communication} in their paper addressed the issue of an efficient MPC protocol in active adversarial setting by removing the dependency on multiplication depth
Note: Revised with proof
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Multi-Party ComputationMixed Adversary
- Contact author(s)
-
achintya desai @ gmail com
raj shubham @ protonmail com - History
- 2021-02-10: revised
- 2020-10-26: received
- See all versions
- Short URL
- https://ia.cr/2020/1337
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1337, author = {Achintya Desai and Shubham Raj and Kannan Srinathan}, title = {Multiplicative Depth Independent & Efficient {MPC} in the Presence of Mixed Adversary}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1337}, year = {2020}, url = {https://eprint.iacr.org/2020/1337} }