Revisiting the Efficiency of Malicious Two-Party Computation

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.

• Type: Conference
• Year: 2007
• Where: EUROCRYPT
• Authors: David P. Woodruff
• Keywords: Cryptology, EUROCRYPT 2007, Malicious Behavior, Secure Two-party Computation, Zero-knowledge Compilation