Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / secure multiparty computation, malicious model

Publication Info: Eurocrypt, 2007

Date: received 7 Nov 2006, last revised 7 Mar 2007

Contact author: dpwood at mit edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Updated to reflect referee comments.

Version: 20070307:184453 (All versions of this report)

Short URL: ia.cr/2006/397