Sciweavers

46 search results - page 2 / 10
» Practical byzantine fault tolerance and proactive recovery
Sort
View
ICPADS
2008
IEEE
13 years 11 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
13 years 3 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
TPDS
2010
113views more  TPDS 2010»
12 years 12 months ago
Highly Available Intrusion-Tolerant Services with Proactive-Reactive Recovery
In the past, some research has been done on how to use proactive recovery to build intrusion-tolerant replicated systems that are resilient to any number of faults, as long as reco...
Paulo Sousa, Alysson Neves Bessani, Miguel Correia...
ISCAPDCS
2004
13 years 6 months ago
Practical Byzantine Fault Tolerance Using Fewer than 3f+1 Active Replicas
Byzantine fault tolerant state machine replication (BFT-SMR) is a foundation for implementations of highly reliable services. Existing algorithms for BFT-SMR require at least 3f +...
Ming Li, Yuval Tamir
EUROSYS
2011
ACM
12 years 8 months ago
ZZ and the art of practical BFT execution
The high replication cost of Byzantine fault-tolerance (BFT) methods has been a major barrier to their widespread adoption in commercial distributed applications. We present ZZ, a...
Timothy Wood, Rahul Singh, Arun Venkataramani, Pra...