CryptoDB
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
| Authors: | |
|---|---|
| Download: | |
| Presentation: | Slides |
| Conference: | ASIACRYPT 2018 |
| 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. |
BibTeX
@inproceedings{asiacrypt-2018-29185,
title={Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)},
booktitle={Advances in Cryptology – ASIACRYPT 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={11274},
pages={86-117},
doi={10.1007/978-3-030-03332-3_4},
author={Carmit Hazay and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez},
year=2018
}