Paper 2006/397 Original: eprint.iacr.org/2006/397 ↗
Revisiting the Efficiency of Malicious Two-Party Computation
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2007-03-07: last updated
- 2006-11-12: published
- Short URL
- https://ia.cr/2006/397
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}