Paper 2021/253
Improved single-round secure multiplication using regenerating codes
Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, and Chaoping Xing
Abstract
In 2016, Guruswami and Wootters showed Shamir's secret-sharing scheme defined over an extension field has a regenerating property. Namely, we can compress each share to an element of the base field by applying a linear form, such that the secret is determined by a linear combination of the compressed shares. Immediately it seemed like an application to improve the complexity of unconditionally secure multiparty computation must be imminent; however, thus far, no result has been published.
We present the first application of regenerating codes to MPC, and show that its utility lies in reducing the number of rounds. Concretely, we present a protocol that obliviously evaluates a depth-
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in ASIACRYPT 2021
- Keywords
- Multiparty ComputationRegenerating CodesSecure Multiplication
- Contact author(s)
-
daniel escudero @ protonmail com
m a abspoel @ cwi nl - History
- 2021-09-20: revised
- 2021-03-03: received
- See all versions
- Short URL
- https://ia.cr/2021/253
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/253, author = {Mark Abspoel and Ronald Cramer and Daniel Escudero and Ivan Damgård and Chaoping Xing}, title = {Improved single-round secure multiplication using regenerating codes}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/253}, year = {2021}, url = {https://eprint.iacr.org/2021/253} }