Revisiting the Efficiency of Malicious Two-Party Computation

David P.  Woodruff

Paper 2006/397

Revisiting the Efficiency of Malicious Two-Party Computation

David P. Woodruff

Abstract

In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification asymptotically improves at least one measure of efficiency of all known schemes. We also point out an error, and improve the analysis of one of their schemes.

Note: Updated to reflect referee comments.

Metadata

Available format(s): PDF PS
Category: Cryptographic protocols
Publication info: Published elsewhere. Eurocrypt, 2007
Keywords: secure multiparty computation malicious model
Contact author(s): dpwood @ mit edu
History: 2007-03-07: revised; 2006-11-12: received; See all versions
Short URL: https://ia.cr/2006/397
License: CC BY

BibTeX

@misc{cryptoeprint:2006/397,
      author = {David P.  Woodruff},
      title = {Revisiting the Efficiency of Malicious Two-Party Computation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/397},
      year = {2006},
      url = {https://eprint.iacr.org/2006/397}
}