Yehuda Lindell, Benny Pinkas  Home/Search
Context Related
| iacr.org/2004/175.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/search...ast=365&title=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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. (Update)
Similar documents based on text: More All
0.4: Privacy Preserving Data Mining - Lindell, Pinkas (2000) (Correct)
0.2: Parallel Coin-Tossing and Constant-Round Secure Two-Party.. - Lindell (2001) (Correct)
0.2: Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (Correct)
BibTeX entry: (Update)
Yehuda Lindell and Benny Pinkas. A proof of yao's protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004/175, 2004. http://eprint.iacr.org/. http://citeseer.ist.psu.edu/lindell04proof.html More
@misc{ lindell04proof,
author = "Y. Lindell and B. Pinkas",
title = "A proof of yao's protocol for secure two-party computation",
text = "Yehuda Lindell and Benny Pinkas. A proof of yao's protocol for secure two-party
computation. Cryptology ePrint Archive, Report 2004/175, 2004. http://eprint.iacr.org/.",
year = "2004",
url = "citeseer.ist.psu.edu/lindell04proof.html" }
Citations (may not include all citations):419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986
197 A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
185 How to Generate and Exchange Secrets (context) - Yao - 1986
179 Security and Composition of Multiparty Cryptographic Protoco.. - Canetti - 2000
174 How to Exchange Secrets by Oblivious Transfer (context) - Rabin - 1981
98 How to Play any Mental Game -- A Completeness Theorem for Pr.. (context) - Goldreich, Micali et al. - 1987
98 Fair Computation of General Functions in Presence of Immoral.. (context) - Goldwasser, Levin - 1990
79 Privacy Preserving Auctions and Mechanism Design - Naor, Pinkas et al. - 1999
78 Foundations of Secure Interactive Computing (context) - Beaver - 1991
47 The Round Complexity of Secure Protocols - Beaver, Micali et al. - 1990
16 The Round Complexity of Secure Protocols (context) - Rogaway - 1991
12 Unpublished manuscript (context) - Micali, Rogaway - 1992
8 Correlated Pseudorandomness and the Complexity of Private Co.. (context) - Beaver - 1996
2 Immunizing Encryption Schemes from Decryption Errors - Dwork, Naor et al. - 2004
2 Foundations of Cryptography: Volume 2 -- Basic Applications (context) - Goldreich - 2004
[Article contains additional citations not shown here]
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001) (Correct)
On the Complexity of Matsui's Attack - Junod (2001) (Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC