Yao’s Protocol for Secure 2-party Computation

Yehuda Lindell, Benny Pinkas B

Yehuda Lindell

Thomas H. Schneider, Michael Zohner

Ou Ruan, Jing Chen, Zhou Jing +2 more

ABSTRACT With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy‐preserving applications. Secure multi‐party computation (SMPC) gives a general solution to these applications and has become a hot topic. Yao's garbled circuit approach is a leading method in designing protocols for secure two‐party computation (2PC), which is a very important base in SMPC. However, there are only few protocols obtaining the fairness of secure 2PC, and only one of them was constructed within the standard simulation framework but with very low efficiency. In this paper, we propose an efficient fair secure Yao's garbled circuit protocol within the universally composable (UC) framework. By comparing with all other fair secure Yao's protocols, our new protocol enjoys three advantages. First, our protocol is more efficient than any other fair secure Yao's protocols within the standard simulation framework. Second, our protocol is the first fair UC‐secure Yao's garbled circuit protocol, so it is more secure than other fair Yao's protocols. Third, there does not require any third party involved in our protocol; thus, it is very suitable for many applications. Copyright © 2013 John Wiley & Sons, Ltd.

Yehuda Lindell, Benny Pinkas B

In the mid 1980’s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao’s protocol, along with a rigorous proof of security. Despite the importance of Yao’s protocol to the field of secure computation, to the best of our knowledge, this is the first time that a proof of security has been published. 1

Shundong Li, Dai Yiqi, You Qi-you

Secure multi-party computation is a focus of international cryptography in recent years. Protocols for Yao's millionaires' problem have become an important building block of many secure multi-party computation protocols. Their efficiency are crucial to the efficiency of many secure multi-party computation protocols. Unfortunately, known protocols for Yao's millionaries' problem have high computational complexity or communication complexity. In this study, based on the 1-out of-m oblivious transfer and set-inclusion problem, we propose a new protocol to solve this problem. This new protocol is very efficient in terms of both computational and communication complexities. Its privacy-preserving property is also proved by simulation patadigm which is generally accepted in the study of secure multi-party computation. We also compare the information leakage of our new protocol and the known protocols.