Paper 2022/623
Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority
Anders Dalskov, Daniel Escudero, and Ariel Nof
Abstract
We introduce a new MPC protocol to securely compute any functionality over an arbitrary black-box finite ring (which may not be commutative), tolerating
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. The ACM Conference on Computer and Communications Security 2022 (CCS'22)
- Keywords
- Multiparty ComputationHonest MajorityRobust Computation
- Contact author(s)
-
daniel escudero @ protonmail com
ariel nof @ biu ac il
anderspkd @ fastmail com - History
- 2022-05-23: received
- Short URL
- https://ia.cr/2022/623
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/623, author = {Anders Dalskov and Daniel Escudero and Ariel Nof}, title = {Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/623}, year = {2022}, url = {https://eprint.iacr.org/2022/623} }