Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Synthesis lectures on distributed computing theory

Yao’s Protocol for Secure 2-party Computation

Ashish Choudhury, Arpita Patra

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-12164-7_12

Related papers

A Proof of Security of Yao’s Protocol for Two-Party Computation

Yehuda Lindell, Benny Pinkas B

Journal of Cryptology•Dec 8, 2008•663 citations

Techniques for Efficient Secure Computation Based on Yao’s Protocol

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2013•1 citation

GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits

Thomas H. Schneider, Michael Zohner

Lecture notes in computer science•Jan 1, 2013•112 citations

An efficient fair UC‐secure protocol for two‐party computation

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.

Security and Communication Networks•Jul 26, 2013•4 citations

A Proof of Yao's Protocol for Secure Two-Party Computation

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

Electronic colloquium on computational complexity•Jan 1, 2004•147 citations

Secure multi-party computation: A tutorial

Manoj Prabhakaran

International Conference on Cryptology in India•Jan 1, 2015•0 citations
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.