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


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.

Available format(s)
Publication info
Published by the IACR in ASIACRYPT 2018
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
2018-09-14: received
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.