Paper 2018/843
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, and Eduardo Soria-Vazquez
Abstract
In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number of parties. To work around this issue, we consider a large-scale scenario where a small minority out of many parties is honest and design scalable, more efficient MPC protocols for this setting. Our results are achieved by introducing new techniques for information-theoretic MACs with short keys and extending the work of Hazay et al. (CRYPTO 2018), which developed new passively secure MPC protocols in the same context. We further demonstrate the usefulness of this theory in practice by analyzing the concrete communication overhead of our protocols, which improve upon the most efficient previous works.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in ASIACRYPT 2018
- Keywords
- MPClarge scaleconcrete efficiencysyndrome decoding
- Contact author(s)
-
carmit hazay @ biu ac il
emmanuela orsini @ kuleuven be
peter scholl @ cs au dk
eduardo soria-vazquez @ bristol ac uk - History
- 2018-09-14: received
- Short URL
- https://ia.cr/2018/843
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/843,
author = {Carmit Hazay and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez},
title = {Concretely Efficient Large-Scale {MPC} with Active Security (or, {TinyKeys} for {TinyOT})},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/843},
year = {2018},
url = {https://eprint.iacr.org/2018/843}
}
