Miguel Castro, Barbara Liskov  Home/Search
Context Related
| mit.edu/~castro/tm589.ps.gz mit.edu/publicatio...MITLCSTM595.pdf 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: mit.edu/~castro/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We have developed a practical state-machine replication algorithm that tolerates Byzantine faults: it works correctly in asynchronous systems like the Internet and it incorporates several optimizations that improve the response time of previous algorithms by more than an order of magnitude. This paper describes the most important of these optimizations. It explains how to modify the base algorithm to eliminate the major performance bottleneck in previous systems --- public-key cryptography. The ... (Update)
Context of citations to this paper: More
.... the required number of servers is particularly important where Byzantine protocols protect against security breaches of servers [7, 8, 20]. Note that using Byzantine protocols to tolerate security breaches is sound only if server failures are independent, i.e. if breaking into...
.... efficient Castro Liskov protocol [9] for its Byzantine state replication, which, due to its complexity and extensive description elsewhere [9, 10, 11], we do not describe further herein. The interested reader can find a wealth of information on Byzantine fault tolerance [8, 12,...
Cited by: More
Using a Byzantine-Fault-Tolerant Algorithm to Provide a Secure DNS - Yang (1999) (Correct)
Collective Endorsement and the Dissemination.. - Lakshmanan.. (2004) (Correct)
Using a Byzantine-Fault-Tolerant Algorithm to - Provide Secure Dns (Correct)
Similar documents (at the sentence level):
28.9%: Practical Byzantine Fault Tolerance - Castro, Liskov (1999) (Correct)
Active bibliography (related documents): More All
0.2: A Secure Directory Service based on Exclusive Encryption - Douceur, Adya, Benaloh.. (2002) (Correct)
0.2: Proactive Recovery in a Byzantine-Fault-Tolerant System - Castro, Liskov (2000) (Correct)
0.1: Combining Abstraction with Byzantine Fault-Tolerance - Rodrigues (2001) (Correct)
Similar documents based on text: More All
1.1: A Correctness Proof for a Practical Byzantine-Fault-Tolerant.. - Castro, Liskov (1999) (Correct)
0.5: Using Abstraction To Improve Fault Tolerance - Castro, Rodrigues, Liskov (2001) (Correct)
0.3: Minimising the Risk of Electronic Document Forgery - Trcek (Correct)
Related documents from co-citation: More All
17: Practical Byzantine fault tolerance - Castro, Liskov - 1999
9: Impossibility of distributed consensus with one faulty process (context) - Fischer, Lynch et al. - 1985
9: The Rampart toolkit for building high-integrity services - Reiter - 1995
BibTeX entry: (Update)
M. Castro and B. Liskov. Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography. Technical Memo MIT/LCS/TM-589, MIT Laboratory for Computer Science, 1999. http://citeseer.ist.psu.edu/castro99authenticated.html More
@techreport{ castro99authenticated,
author = "M. Castro and B. Liskov",
title = "Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography",
number = "MIT/LCS/TM-595",
pages = "12",
year = "1999",
url = "citeseer.ist.psu.edu/castro99authenticated.html" }
Citations (may not include all citations):1529 A Method for Obtaining Digital Signatures and Public-Key Cry.. - Rivest, Shamir et al. - 1978
917 and the Ordering of Events in a Distributed System (context) - Lamport, Clocks - 1978
739 Impossibility of Distributed Consensus With One Faulty Proce.. (context) - Fischer, Lynch et al. - 1985
718 Distributed Algorithms (context) - Lynch - 1996
401 The MD5 Message-Digest Algorithm (context) - Rivest - 1992
350 Implementing Fault-Tolerant Services Using The State Machine.. - Schneider - 1990
291 Weighted Voting for Replicated Data - Gifford - 1979
235 Practical Byzantine Fault Tolerance - Castro, Liskov - 1999
176 Timestamps in Key Distribution Protocols (context) - Denning, Sacco - 1981
144 Atomic Broadcast: From Simple Message Diffusion to Byzantine.. - Cristian, Aghili et al. - 1985
141 Byzantine Quorum Systems - Malkhi, Reiter - 1997
97 Asynchronous Consensus and Broadcast Protocols (context) - Bracha, Toueg - 1995
86 The SecureRing Protocols for Securing Group Communication - Kihlstrom, Moser et al. - 1998
85 The Rampart Toolkit for Building HighIntegrity Services - Reiter - 1995
62 DEC Systems Research Center (context) - Lamport, Parliament - 1989
55 IEEE Transactions on Software Engineering (context) - Reiter, Group et al. - 1996
55 Message Authentication with One-Way Hash Functions - Tsudik - 1992
55 Secure and Scalable Replication in Phalanx - Malkhi, Reiter - 1998
51 Axioms for Concurrent Objects (context) - Herlihy, Wing - 1987
40 A High-Throughput Secure Reliable Multicast Protocol - Malkhi, Reiter - 1996
40 MDx-MAC and Building Fast MACs from Hash Functions - Preneel, Oorschot - 1995
34 A New Paradigm for Collision-free Hashing: Incrementality at.. (context) - Bellare, Micciancio - 1997
32 Unreliable Intrusion Detection in Distributed Computations - Malkhi, Reiter - 1997
31 Viewstamped Replication: A New Primary Copy Method to Suppor.. (context) - Oki, Liskov - 1988
25 Performance Comparison of Public-Key Cryptosystems (context) - Wiener - 1998
16 The Status of MD5 After a Recent Attack (context) - Dobbertin - 1996
12 A Correctness Proof for a Practical Byzantine-Fault-Tolerant.. - Castro, Liskov - 1999
9 A Specialization Toolkit to Increase the Diversity of Operat.. - Pu, Black et al. - 1996
8 Optimal Asynchronous Byzantine Agreement (context) - Canneti, Rabin - 1992
4 Secure Agreement Protocols (context) - Reiter - 1994
4 Fully Polynomial Byzantine Agreement for n (context) - Garay, Moses - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.pmg.lcs.mit.edu/~castro/pubs.html): More
Efficient and Flexible Object Sharing - Castro, Sequeira, Costa, Guedes (1995) (Correct)
Safe and Efficient Sharing of Persistent Objects in Thor - Liskov, Adya, Castro.. (1996) (Correct)
Type-Safe Heterogeneous Sharing can be Fast - Liskov Adya (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