Christian Cachin, Klaus Kursawe, Victor Shoup  Home/Search
Context Related
| ibm.com/~cca/./papers/abba.ps.gz iacr.org/2000/034.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: ibm.com/~cca/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols. These cryptographic protocols have practical and provably secure implementations in the "random oracle" model. In particular, a coin-tossing protocol based on the Diffie-Hellman problem... (Update)
Cited by: More
Induced Churn as Shelter from Routing-Table Poisoning - Tyson Condie Varun (2006) (Correct)
A Reconfigurable System Architecture For Consensus-Based.. - Reiser, Bartlang, Hauck (2005) (Correct)
Implementing Trustworthy Services Using Replicated State.. - Schneider, Zhou (2005) (Correct)
Similar documents (at the sentence level):
68.1%: Random Oracles in Constantinople: Practical Asynchronous.. - Cachin, Kursawe, Shoup (2000) (Correct)
Active bibliography (related documents): More All
0.3: Efficient and Player-Optimal Strong Consensus - Fitzi, Garay (2002) (Correct)
0.3: Paxos At War - Zielinski (2004) (Correct)
0.3: Threshold Password-Authenticated Key Exchange - Shrimpton (2002) (Correct)
Similar documents based on text: More All
0.7: Optimistic Asynchronous Byzantine Agreement - Kursawe (1999) (Correct)
0.5: Secure and Efficient Asynchronous Broadcast Protocols - Cachin, Kursawe, Petzold.. (2001) (Correct)
0.5: Full design of Dependable Third Party Services - Cachin (2002) (Correct)
Related documents from co-citation: More All
26: Impossibility of distributed consensus with one faulty process (context) - Fischer, Lynch et al. - 1985
19: Reaching Agreement in the Presence of Faults (context) - Pease, Shostak et al. - 1980
18: Practical Byzantine fault tolerance - Castro, Liskov - 1999
BibTeX entry: (Update)
C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople: practical asynchronous Byzantine agreement using cryptography. In Proceedings of the 19th Annual Symposium on Principles of Distributed Computing, Portland, Oregon, July 2000. ACM. http://citeseer.ist.psu.edu/cachin00random.html More
@inproceedings{ cachinrandom,
author = "Christian Cachin and Klaus Kursawe and Victor Shoup",
title = "Random Oracles in {C}onstantinople: Practical Asynchronous {B}yzantine Agreement using Cryptography",
url = "citeseer.ist.psu.edu/cachin00random.html" }
Citations (may not include all citations):739 Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
718 Distributed Algorithms (context) - Lynch - 1996
659 Random oracles are practical: A paradigm for designing e- ci.. - Bellare, Rogaway - 1993
645 How to share a secret (context) - Shamir - 1979
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
414 Unreliable failure detectors for reliable distributed system.. - Chandra, Toueg - 1996
411 How to prove yourself: Practical solutions to identication a.. - Fiat, Shamir - 1987
339 Theory and applications of trapdoor functions (context) - Yao - 1982
193 Threshold cryptosystems (context) - Desmedt, Frankel - 1990
166 Wallet databases with observers (context) - Chaum, Pedersen - 1993
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
120 A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
95 Practical threshold signatures - Shoup - 2000
84 Society and group oriented cryptography: A new concept (context) - Desmedt - 1988
82 On formal models for secure key exchange - Shoup - 1999
80 Studies in Secure Multiparty Computation and Applications - Canetti - 1996
73 Randomized Byzantine generals (context) - Rabin - 1983
65 Number-theoretic constructions of ecient pseudo-random funct.. - Naor, Reingold - 1997
57 Randomization in Byzantine agreement (context) - Chor, Dwork - 1989
55 IEEE Transactions on Software Engineering (context) - Reiter, group et al. - 1996
43 Another advantage of free choice: Completely asynchronous ag.. (context) - Ben-Or - 1983
42 Early stopping in Byzantine agreement (context) - Dolev, Reischuk et al. - 1990
28 An optimal probabilistic protocol for synchronous Byzantine .. (context) - Feldman, Micali - 1997
26 Publicly veriable secret sharing - Stadler - 1996
26 Distributed pseudo-random functions and KDCs - Naor, Pinkas et al. - 1999
25 resilient consensus protocol (context) - Bracha - 1984
23 Fast asynchronous Byzantine agreement with optimal resilienc.. (context) - Canetti, Rabin - 1993
20 Randomized Byzantine agreements (context) - Toueg - 1984
18 Public-key cryptography and re-usable shared secrets (context) - Croft, Harris - 1989
17 A simplied approach to threshold and proactive RSA (context) - Rabin - 1998
15 A simple method for generating and sharing pseudo-random fun.. (context) - Micali, Sidney - 1995
12 An ecient threshold public-key cryptosystem secure against a.. (context) - Canetti, Goldwasser - 1999
8 Horus: A exible group communication system (context) - van Renesse, Birman et al. - 1996
7 Randomized distributed agreement revisited (context) - Berman, Garay - 1993
4 unpredictable bit generation without broadcast (context) - Beaver, So - 1994
3 Optimistic asynchronous Byzantine agreement - Kursawe - 1999
3 Provably secure session key distribution|the three party cas.. (context) - Bellare, Rogaway - 1995
3 Muteness failure detectors: Specication and implementation (context) - Doudou, Garbinato et al. - 1999
1 Public-key cryptography and re-usable shared secrets (context) - Boyd - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zurich.ibm.com/~cca/publications.html): More
Locating the Primary Attention Focus of the User - Rauterberg, Cachin (1993) (Correct)
One-Round Secure Computation and Secure Autonomous.. - Cachin, Camenisch.. (2000) (Correct)
Optimistic Fair Secure Computation (Extended Abstract) - Cachin, Camenisch (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