Miguel Correia, Nuno Ferreira Neves, Paulo Verissimo  @ NUS Home/Search
Context Related
| di.fc.ul.pt/techreports/046.pdf Cached: PS.gz PS PDF Image Update Help From: di.fc.ul.pt/biblioteca/techre... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: a considerable amount of interest in both communities under the designation of intrusion tolerance. However, practical intrusion-tolerant replicated systems based on the state machine approach can handle at most f Byzantine components out of a total of n = 3f + 1, which is the maximum resilience in asynchronous systems. (Update)
Cited by: More
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) (Correct)
Active bibliography (related documents): More All
0.9: Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (Correct)
0.7: From Consensus to Atomic Broadcast: Time-Free.. - Correia, Neves.. (2004) (Correct)
0.4: A Wormhole-based Intrusion-Tolerant Group - Communication System Wit-Gcs (2003) (Correct)
Similar documents based on text: More All
0.7: Wormhole-Aware Byzantine Protocols - Neves, Correia, Verissimo (Correct)
0.7: Byzantine-Resistant Consensus based on a Novel.. - Correia, Neves.. (Correct)
0.6: How Dependable Are Distributed f Fault/ . . . - Sousa, Neves, Verissimo (2005) (Correct)
Related documents from co-citation: More All
2: The design of a COTS real-time distributed security kernel (context) - Correia, Verssimo et al. - 2002
BibTeX entry: (Update)
M. Correia, N. F. Neves, and P. Ver ssimo. How to tolerate half less one Byzantine nodes in practical distributed systems. DI/FCUL TR 04--6, Department of Informatics, University of Lisbon, July 2004. http://citeseer.comp.nus.edu.sg/697385.html More
@misc{ correia04how,
author = "M. Correia and N. Neves and P. ssimo",
title = "How to tolerate half less one Byzantine nodes in practical distributed
systems",
text = "M. Correia, N. F. Neves, and P. Ver ssimo. How to tolerate half less one
Byzantine nodes in practical distributed systems. DI/FCUL TR 04--6, Department
of Informatics, University of Lisbon, July 2004.",
year = "2004",
url = "citeseer.comp.nus.edu.sg/697385.html" }
Citations (may not include all citations):1065 Handbook of Applied Cryptography (context) - Menezes, Van Oorschot et al. - 1997
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
625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
414 Unreliable failure detectors for reliable distributed system.. - Chandra, Toueg - 1996
235 Practical Byzantine fault tolerance - Castro, Liskov - 1999
193 Threshold cryptosystems (context) - Desmedt, Frankel - 1989
153 the minimal synchronism needed for distributed consensus (context) - Dolev, Dwork et al. - 1987
97 Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1985
85 The Rampart toolkit for building high-integrity services - Reiter - 1995
83 A modular approach to fault-tolerant broadcasts and related .. - Hadzilacos, Toueg - 1994
69 Proactive recovery in a Byzantine-fault-tolerant system - Castro, Liskov - 2000
55 Secure and scalable replication in Phalanx - Malkhi, Reiter - 1998
44 Distributing trust with the Rampart toolkit (context) - Reiter - 1996
40 Using time instead of timeout for fault-tolerant distributed.. (context) - Lamport - 1984
32 Unreliable intrusion detection in distributed computations - Malkhi, Reiter - 1997
29 The design of a COTS real-time distributed security kernel (context) - Correia, ssimo et al. - 2002
29 The design of a COTS real-time distributed security kernel (context) - Correia, ssimo et al. - 2001
26 Practical Byzantine fault tolerance and proactive recovery (context) - Castro, Liskov - 2002
23 Secure intrusion-tolerant replication on the internet - Cachin, Poritz - 2002
21 Quantifying the cost of providing intrusion tolerance in gro.. - Ramasamy, Pandey et al. - 2002
19 Persistent objects in the Fleet system - Malkhi, Reiter et al. - 2001
19 The Timely Computing Base model and architecture (context) - ssimo, Casimiro - 2002
16 ACM Transactions on Information and System Security (context) - Kihlstrom, Moser et al. - 2001
16 Intrusion-tolerant architectures: Concepts and design (context) - ssimo, Neves et al. - 2003
14 ACM Transactions on Programming Languages and Systems (context) - Schneider, distributed - 1982
13 Solving agreement problems with weak ordering oracles - Pedone, Schiper et al. - 2002
11 Intrusion-tolerant Enclaves - Dutertre, Crettaz et al. - 2002
11 Efficient Byzantine-resilient reliable multicast on a hybrid.. - Correia, Lung et al. - 2002
9 DIAPM-RTAI position paper (context) - Cloutier, Mantegazza et al. - 2000
8 Uncertainty and predictability: Can they be reconciled (context) - ssimo - 2003
7 Random oracles in Contanstinople: Practical asynchronous Byz.. (context) - Cachin, Kursawe et al. - 2000
6 Byzantine fault detectors for solving consensus - Kihlstrom, Moser et al. - 2003
5 The SecureGroup communication system (context) - Moser, Melliar-Smith et al. - 2000
3 Implementing faul-tolerant services using the state machine .. (context) - Schneider - 1990
2 From crash tolerance to authenticated Byzantine tolerance: A.. (context) - Mpoeleng, Ezhilchelvan et al. - 2003
1 Project MAFTIA deliverable D (context) - Powell, Stroud et al. - 2002
Documents on the same site (http://www.di.fc.ul.pt/biblioteca/tech-reports/): More
Analog Computers and the Iteration Functional - Campagnolo, Moore, Costa (Correct)
Scalable Atomic Multicast - Rodrigues, Guerraoui, Schiper (1998) (Correct)
Core-TyCO - The Language Definition Version 0.1 - Vasconcelos, Bastos (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.