Donald Beaver, Silvio Micali, Phillip Rogaway  Home/Search
Context Related
| ucdavis.edu/~rogaway/papers/sfe.ps ucdavis.edu/~rogaw...constrounds.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: ucdavis.edu/~rogaway/paper...list (more) From: counterpane.com/biblio...authorB (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Donald Beaver Harvard University Silvio Micali y MIT Phillip Rogaway y MIT Abstract In a network of n players, each player i having private input x i , we show how the players can collaboratively evaluate a function f(x 1 ; : : : ; xn ) in a way that does not compromise the privacy of the players' inputs, and yet requires only a constant number of rounds of interaction. The underlying model of computation is a complete network of private channels, with broadcast, and a majority of the... (Update)
Cited by: More
Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are (Correct)
Improved Efficiency for Private Stable Matching - Matthew Franklin Mark (2006) (Correct)
Cryptographically Private Support Vector Machines - Laur, Lipmaa, Mielikäinen (2006) (Correct)
Active bibliography (related documents): More All
0.5: Complexity and Security of Distributed Protocols - Franklin (1993) (Correct)
0.5: An Overview of Secure Distributed Computing - Franklin, Galil, Yung (1992) (Correct)
0.5: Varieties of Secure Distributed Computing - Franklin, Yung (1996) (Correct)
Similar documents based on text: More All
0.5: Secure Multi-party Quantum Computation - Crepeau, Gottesman, Smith (2002) (Correct)
0.3: Secure Computation (Preliminary Report) - Micali, Rogaway (1991) (Correct)
0.2: Selective Private Function Evaluation with.. - Canetti, Ishai.. (2001) (Correct)
Related documents from co-citation: More All
27: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
24: Security and composition of multi-party cryptographic protocols - Canetti - 1998
23: Completeness Theorems for NonCryptographic Fault-Tolerant Distributed Computatio.. (context) - BenOr, Goldwasser et al. - 1988
BibTeX entry: (Update)
D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pages 503--513, 1990. http://citeseer.ist.psu.edu/beaver90round.html More
@inproceedings{ beaver90round,
author = "D. Beaver and S. Micali and P. Rogaway",
title = "The round complexity of secure protocols",
pages = "503--513",
year = "1990",
url = "citeseer.ist.psu.edu/beaver90round.html" }
Citations (may not include all citations):339 Theory and Applications of Trapdoor Functions (context) - Yao - 1982
334 How to Generate Cryptographically Strong Sequences of Pseudo.. (context) - Blum, Micali - 1984
287 Multiparty Unconditionally Secure Protocols (context) - Chaum, Cr'epeau et al. - 1988
250 How to Play Any Mental Game (context) - Goldreich, Micali et al. - 1987
219 Completeness Theorems for Non-Cryptographic Fault-Tolerant D.. (context) - Ben-Or, Goldwasser et al. - 1988
185 How to Generate and Exchange Secrets (context) - Yao - 1986
167 PseudoRandom Generation from One-Way Functions (context) - Impagliazzo, Levin et al. - 1989
167 Protocols for Secure Computation (context) - Yao - 1982
127 Verifiable Secret Sharing and Multiparty Protocols with Hone.. (context) - Rabin, Ben-Or - 1989
109 Verifiable Secret Sharing and Achieving Simultaneity in the .. (context) - Chor, Goldreich et al. - 1985
52 Multiparty Computations Ensuring the Privacy of Each Party's.. (context) - Chaum, Damgard et al.
49 Non-Cryptographic Fault Tolerant Computing in a Constant Num.. (context) - Bar-Ilan, Beaver - 1989
45 Optimal Algorithms for Byzantine Agreement (context) - Feldman, Micali - 1988
34 Cryptographic Computation: Secure Fault-Tolerant Protocols a.. (context) - Galil, Haber et al.
30 How to Solve any Protocol Problem---An Efficiency Improvemen.. - Goldreich, Vainish
30 Multiparty Computations with Faulty Majority (context) - Beaver, Goldwasser
19 Achieving Independence in Logarithmic Number of Rounds (context) - Chor, Rabin - 1987
16 The Round Complexity of Secure Protocols (context) - Rogaway - 1990
10 Multi-Party Cryptographic Computation: Techniques and Applic.. (context) - Haber - 1988
4 The Spymasters Double-Agent Problem: Multiparty Computations.. - Chaum
3 Pseudo-Random Generators with Uniform Assumptions (context) - Hastad
2 Security, Fault-Tolerance, and Communication Complexity for .. (context) - Beaver - 1990
1 Secure Multiparty Protocols Tolerating Half Faulty Processor.. (context) - Beaver
1 Interactive Consistency in Constant Expected Time (context) - Ben-Or, El-Yaniv - 1988
1 One Can Always Assume Private Channels (context) - Feldman - 1988
1 The Notion of Secure Computation (context) - Kilian, Micali et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwcsif.cs.ucdavis.edu/~rogaway/papers/list.html): More
Bucket Hashing and its Application to Fast Message Authentication - Rogaway (1997) (Correct)
Minimizing the Use of Random Oracles in Authenticated.. - Bellare, Rogaway (1997) (Correct)
How to Protect DES Against Exhaustive Key Search - Kilian, Rogaway (1996) (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