2006 | OriginalPaper | Chapter
Efficiency Tradeoffs for Malicious Two-Party Computation
Authors : Payman Mohassel, Matthew Franklin
Published in: Public Key Cryptography - PKC 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We study efficiency tradeoffs for secure two-party computation in presence of malicious behavior. We investigate two main approaches for defending against malicious behavior in
Yao’s garbled circuit
method: (1)
Committed-input
scheme, (2)
Equality-checker
scheme. We provide asymptotic and concrete analysis of communication and computation costs of the designed protocols. We also develop a weaker definition of security (
k-leaked model
) for malicious two-party computation that allows for disclosure of some information to a malicious party. We design more efficient variations of
Yao’s
protocol that are secure in the proposed model.