Ivan Damgård, Yuval Ishai  Home/Search
Context
Related
| iacr.org/2005/262.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/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not require expensive zero-knowledge proofs and its communication complexity does not depend on the computational complexity of the underlying cryptographic primitive. Our protocol withstands an active, adaptive adversary corrupting a minority of the parties. Previous constant-round protocols of this type were only known in ... (Update)
Active bibliography (related documents): More All
0.8: Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (Correct)
0.5: On Expected Constant-Round Protocols for Byzantine Agreement - Katz, Koo (2006) (Correct)
0.5: On Protocol Security in the Cryptographic Model - Nielsen (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ rd-constantround,
author = "Ivan Damgård and Yuval Ishai",
title = "Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator",
url = "citeseer.ist.psu.edu/745993.html" }
Citations (may not include all citations):645 How to share a secret (context) - Shamir - 1979
250 How to play any mental game (context) - Goldreich, Micali et al. - 1987
206 Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988
189 Universally Composable Security: A New Paradigm for Cryptogr.. - Canetti - 2001
179 Security and composition of multiparty cryptographic protoco.. - Canetti - 2000
177 Completeness theorems for non-cryptographic faulttolerant di.. (context) - Ben-Or, Goldwasser et al. - 1988
127 Verifiable Secret Sharing and Multiparty Protocols with Hone.. (context) - Rabin, Ben-Or - 1989
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
79 Privacy preserving auctions and mechanism design - Naor, Pinkas et al. - 1999
59 Security with low communication overhead (context) - Beaver, Feigenbaum et al.
53 A minimal model for secure computation - Feige, Kilian et al. - 1994
47 The round complexity of secure protocols - Beaver, Micali et al. - 1990
45 General secure multi-party computation from any linear secre.. - Cramer, Damgard et al. - 2000
39 Non-cryptographic fault-tolerant computing in a constant num.. (context) - Bar-Ilan, Beaver - 1989
32 Multiparty computation from threshold homomorphic encryption - Cramer, Damgard et al. - 2045
28 Communication preserving protocols for secure function evalu.. - Naor, Nissim - 2001
25 Parallel Coin-Tossing and Constant-Round Secure Two-Party Co.. - Lindell - 2003
23 An Optimal Algorithm for Synchronous Byzantine Agreement (context) - Feldman, Micali - 1997
21 Randomizing polynomials: A new representation with applicati.. - Ishai, Kushilevitz - 2000
20 One-round secure computation and secure autonomous mobile ag.. - Cachin, Camenisch et al. - 2000
16 The Round Complexity of Secure Protocols (context) - Rogaway - 1991
14 Secure distributed linear algebra in a constant number of ro.. - Cramer, Damgard - 2001
11 cient Multiparty Computations Secure Against an Adaptive Adv.. (context) - Cramer, Damgard et al. - 1999
11 Robustness for Free in Unconditional Multi-party Computation - Hirt, Maurer - 2001
10 The Round Complexity of Verifiable Secret Sharing and Secure.. - Gennaro, Ishai et al. - 2001
7 Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky - 2004
4 ciency of Multi-party Computation with a Dishonest Majority (context) - Katz, Ostrovsky et al. - 2003
4 Compressing cryptographic resources (context) - Gilboa, Ishai
4 A Proof of Yao's Protocol for Secure Two-Party Computation - Lindell, Pinkas - 2004
4 Notions of Reducibility between Cryptographic Primitives - Reingold, Trevisan et al. - 2004
3 round secure multiparty computation - Gennaro, Ishai et al.
3 Bounded-Concurrent Secure Two-Party Computation in a Constan.. - Pass, Rosen - 2003
3 Sequential composition of protocols without simultaneous ter.. - Lindell, Lysyanskaya et al. - 2002
2 Bounded-concurrent secure multi-party computation with a dis.. (context) - Pass - 2004
1 pseudorandom secret-sharing and applications to secure compu.. (context) - Cramer, Damgard et al. - 2005
1 On garbled circuits and constant round secure function evalu.. (context) - Tate, Xu - 2003
1 Computationally private randomizing polynomials and their ap.. (context) - Applebaum, Ishai et al. - 2005
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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