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.
|Title of host publication||Theory of Cryptography|
|Subtitle of host publication||14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I|
|Number of pages||30|
|Publication status||Published - 22 Oct 2016|
|Name||Lectures Notes in Computer Science|