Efficient Fair UC-Secure Two-Party Computation on Committed Inputs
Ou Ruan, Cai Fu, Zhou Jing +2 more
With the development of modern Internet and ad hoc networks, there is an increasing need for autonomous entities cooperating together to perform knowledge-and information-based decision making. Data in its original form, however, typically contains sensitive information about individuals and unmanaged data exchange may violate individual privacy. Secure multi-party computation is proposed to solve this problem and has become a hot topic. Yao's garbled circuit approach is a major method in designing protocols for secure two-party computation. However, only few papers dealt with the fundamental property of fairness for Yao's garbled circuit protocol, in which one introduced a third party and others were based on cut-and-choose techniques that are inherently expensive. In this paper, we propose an efficient fair UC-secure Yao's garbled circuit protocol in the malicious model based on Jarecki et al.'s construction and Ou Ruan et al.'s gradual release commitment. The protocol avoids involving any third party or using cut-and-choose techniques, and it is more bandwidth-efficient than other Yao-based protocols. Furthermore, its security could be proved within the UC framework.
IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Jul 1, 2013•1 citation