An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Adaptively Secure Two-Party Computation with Erasures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Secure Two-Party Computation Is Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Multi-party Computation Minimizing Online Rounds
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Security against covert adversaries: efficient protocols for realistic adversaries
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Small, stupid, and scalable: secure computing with faerieplay
Proceedings of the fifth ACM workshop on Scalable trusted computing
i-hop homomorphic encryption and rerandomizable Yao circuits
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Garbled circuits for leakage-resilience: hardware implementation and evaluation of one-time programs
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Privacy-preserving applications on smartphones
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
Private database search with sublinear query time
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Trust extension as a mechanism for secure code execution on commodity computers
Trust extension as a mechanism for secure code execution on commodity computers
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
A simple BGN-Type cryptosystem from LWE
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Constant-Round private function evaluation with linear complexity
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
An efficient protocol for oblivious DFA evaluation and applications
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
On the security of the "Free-XOR" technique
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Optimal parameters for efficient two-party computation protocols
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
Secure two-party computation in sublinear (amortized) time
Proceedings of the 2012 ACM conference on Computer and communications security
Secure two-party computations in ANSI C
Proceedings of the 2012 ACM conference on Computer and communications security
Foundations of garbled circuits
Proceedings of the 2012 ACM conference on Computer and communications security
Salus: a system for server-aided secure function evaluation
Proceedings of the 2012 ACM conference on Computer and communications security
Improved secure two-party computation via information-theoretic garbled circuits
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Expression rewriting for optimizing secure computation
Proceedings of the third ACM conference on Data and application security and privacy
Adaptively secure garbling with applications to one-time programs and secure outsourcing
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Calling out cheaters: covert security with public verifiability
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Secure computations on non-integer values with applications to privacy-preserving sequence analysis
Information Security Tech. Report
Garbling XOR gates "for free" in the standard model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Secure and verifiable outsourcing of sequence comparisons
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
An information-flow type-system for mixed protocol secure computation
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Faster secure two-party computation with less memory
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Reusable garbled circuits and succinct functional encryption
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Efficient secure computation optimization
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
GPU and CPU parallelization of honest-but-curious secure two-party computation
Proceedings of the 29th Annual Computer Security Applications Conference
Fast and maliciously secure two-party computation using the GPU
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Constant-round adaptive zero-knowledge proofs for NP
Information Sciences: an International Journal
| Hi-index | 0.00 |
In the mid 1980s, 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 theory of cryptography and in particular to the field of secure computation, to the best of our knowledge, this is the first time that an explicit proof of security has been published.