Paper 2016/187
Efficient Secure Multiparty Computation with Identifiable Abort
Carsten Baum, Emmanuela Orsini, and Peter Scholl
Abstract
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
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- Secure Multiparty ComputationIdentifiable Abort
- Contact author(s)
-
peter scholl @ bristol ac uk
cbaum @ cs au dk
Emmanuela Orsini @ bristol ac uk - History
- 2016-05-24: revised
- 2016-02-23: received
- See all versions
- Short URL
- https://ia.cr/2016/187
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/187, 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}, url = {https://eprint.iacr.org/2016/187} }