Revisiting the Efficiency of Malicious Two-Party Computation [chapter]

David P. Woodruff
2007 Lecture Notes in Computer Science  
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
more » ... rror, and improve the analysis of one of their schemes.
doi:10.1007/978-3-540-72540-4_5 fatcat:idgsivi2izfolnwx4u5t6o32pa