Efficient two party and multi party computation against covert adversaries

Vipul Goyal, Payman Mohassel, Adam Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

60 Scopus citations

Abstract

Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and choose techniques rather than relying on expensive zero knowledge proofs. In this paper, we design an efficient multi-party computation protocol in the covert adversary model which remains secure even if a majority of the parties are dishonest. We also substantially improve the two-party protocol of Aumann and Lindell. Our protocols avoid general NP-reductions and only make a black box use of efficiently implementable cryptographic primitives. Our two-party protocol is constant-round while the multi-party one requires a logarithmic (in number of parties) number of rounds of interaction between the parties. Our protocols are secure as per the standard simulation-based definitions of security. Although our main focus is on designing efficient protocols in the covert adversary model, the techniques used in our two party case directly generalize to improve the efficiency of two party computation protocols secure against standard malicious adversaries.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - EUROCRYPT 2008 - 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Pages289-306
Number of pages18
DOIs
StatePublished - 2008
Event27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2008 - Istanbul, Turkey
Duration: Apr 13 2008Apr 17 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4965 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2008
CountryTurkey
CityIstanbul
Period4/13/084/17/08

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient two party and multi party computation against covert adversaries'. Together they form a unique fingerprint.

Cite this