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
scheme. We provide asymptotic and concrete analysis of communication and computation costs of the designed protocols. We also develop a weaker definition of security (
) for malicious two-party computation that allows for disclosure of some information to a malicious party. We design more efficient variations of
protocol that are secure in the proposed model.