Paper 2016/187

Efficient Secure Multiparty Computation with Identifiable Abort

Carsten Baum, Emmanuela Orsini, and Peter Scholl


We study secure multiparty computation (MPC) in the dishonest majority setting providing security with identifiable abort, where if the protocol aborts, the honest parties can agree upon the identity of a corrupt party. All known constructions that achieve this notion require expensive zero-knowledge techniques to obtain active security, so are not practical. In this work, we present the first efficient MPC protocol with identifiable abort. Our protocol has an information-theoretic online phase with message complexity $O(n^2)$ for each secure multiplication (where $n$ is the number of parties), similar to the BDOZ protocol (Bendlin et al., Eurocrypt 2011), and a factor in the security parameter lower than the identifiable abort protocol of Ishai et al. (Crypto 2014). A key component of our protocol is a linearly homomorphic information-theoretic signature scheme, for which we provide the first definitions and construction based on a previous non-homomorphic scheme. We then show how to implement the preprocessing for our protocol using somewhat homomorphic encryption, similarly to the SPDZ protocol (Damgård et al., Crypto 2012) and other recent works with applicable efficiency improvements.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Secure Multiparty ComputationIdentifiable Abort
Contact author(s)
peter scholl @ bristol ac uk
cbaum @ cs au dk
Emmanuela Orsini @ bristol ac uk
2016-05-24: revised
2016-02-23: received
See all versions
Short URL
Creative Commons Attribution


      author = {Carsten Baum and Emmanuela Orsini and Peter Scholl},
      title = {Efficient Secure Multiparty Computation with Identifiable Abort},
      howpublished = {Cryptology ePrint Archive, Paper 2016/187},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.