Efficient Secure Multiparty Computation with Identifiable Abort

Emmanuela A Orsini, Peter Scholl, Carsten Baum

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

Abstract

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.
Original languageEnglish
Title of host publicationTheory of Cryptography
Subtitle of host publication14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I
PublisherSpringer
Pages461-490
Number of pages30
ISBN (Electronic)9783662536414
ISBN (Print)9783662536407
DOIs
Publication statusPublished - 22 Oct 2016

Publication series

NameLectures Notes in Computer Science
PublisherSpringer
Volume9985
ISSN (Print)0302-9743

Keywords

  • cryptographic protocols

Fingerprint Dive into the research topics of 'Efficient Secure Multiparty Computation with Identifiable Abort'. Together they form a unique fingerprint.

Cite this