Results 1 - 10 of 51

Proactive Recovery in a Byzantine-Fault-Tolerant System

by Miguel Castro, Barbara Liskov , 2000
"... This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is the first to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather than publ ..."
Abstract - Cited by 138 (6 self) - Add to MetaCart
This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is the first to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather than

Abstract Proactive Recovery in a Byzantine-Fault-Tolerant System

by unknown authors
"... This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is the first to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather than publ ..."
Abstract - Add to MetaCart
This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is the first to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather than

Practical Byzantine fault tolerance and proactive recovery

by Miguel Castro, Barbara Liskov - ACM Transactions on Computer Systems , 2002
"... Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, B ..."
Abstract - Cited by 410 (7 self) - Add to MetaCart
, it incorporates mechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. The recovery mechanism allows the algorithm to tolerate any number of faults over the lifetime of the system provided fewer than 1/3 of the replicas become faulty within a small window of vulnerability

A Robust Byzantine Fault-Tolerant Replication Technique for Peer-to-Peer Content Distribution

by Am Natarajan
"... Abstract: Problem statement: In peer-to-peer networks, Byzantine fault tolerance refers to the capability of a system to tolerate Byzantine faults. It can be achieved by replicating the server and by ensuring all server replicas reach an agreement on the input despite Byzantine faulty replicas and c ..."
Abstract - Add to MetaCart
Abstract: Problem statement: In peer-to-peer networks, Byzantine fault tolerance refers to the capability of a system to tolerate Byzantine faults. It can be achieved by replicating the server and by ensuring all server replicas reach an agreement on the input despite Byzantine faulty replicas

ABSTRACT Beyond One-third Faulty Replicas in Byzantine Fault Tolerant Systems

by unknown authors
"... Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantees whatsoever. Malicious replicas can make clients accept arbitrary results, and the system behavior is totally unspecifie ..."
Abstract - Add to MetaCart
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantees whatsoever. Malicious replicas can make clients accept arbitrary results, and the system behavior is totally

ABSTRACT Beyond One-third Faulty Replicas in Byzantine Fault Tolerant Systems

by unknown authors
"... Byzantine fault tolerant systems behave correctly when no more than f out of 3f +1replicas fail. When there are more than f failures, traditional BFT protocols make no guarantees whatsoever. Malicious replicas can make clients accept arbitrary results, and the system behavior is totally unspecified. ..."
Abstract - Add to MetaCart
Byzantine fault tolerant systems behave correctly when no more than f out of 3f +1replicas fail. When there are more than f failures, traditional BFT protocols make no guarantees whatsoever. Malicious replicas can make clients accept arbitrary results, and the system behavior is totally unspecified

Tolerating Byzantine faulty clients in a quorum system

by Barbara Liskov - In Proceedings of the 26 th International Conference on Distributed Computing Systems , 2006
"... Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzantine faulty clients. This paper presents novel protocols that provide atomic semantics despite Byzantine clients. Our pro ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzantine faulty clients. This paper presents novel protocols that provide atomic semantics despite Byzantine clients. Our

Proactive Recovery in a Byzantine-Fault-Tolerant System

by unknown authors
"... Abstract This paper describes an asynchronous state-machine replicationsystem that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is thefirst to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather th ..."
Abstract - Add to MetaCart
Abstract This paper describes an asynchronous state-machine replicationsystem that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is thefirst to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather

An Agreement Protocol to exploit and handle Byzantine Faulty Nodes in Authenticated Hierarchical Configuration

by Poonam Saini, Awadhesh Kumar Singh
"... Consensus algorithms that, essentially, endeavor agreement or commit on a particular transaction, are preeminent building blocks of distributed systems. Outside the FLP impossibility results in an asynchronous environment to failure detectors and many more tactics for synchrony supplements, consensu ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
, consensus has always been a major part of concern. It poses more severe threats, in case, the distributed network possesses some arbitrary behaving (malicious) nodes. The proposed article adds up a non-faulty agreement decision to the requesting client nodes from the coordinator replicas. The work

A correctness proof for a byzantine-fault-tolerant read/write atomic memory with dynamic replica membership

by Rodrigo Rodrigues, Barbara Liskov , 2003
"... Byzantine quorum systems enhance the availability and reliability of fault-tolerant replicated services when servers may fail arbitrarily. Currently such systems do not allow reconfigurations; instead they assume a static set of replicas. However, reconfigurations are crucial in a long-lived system, ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
, for instance, to deal with machines that break or are compromised and need to be evicted from the system. In this paper we present protocols for dynamically changing the set of replicas in a quorum system that provides atomicity despite Byzantine-faulty servers. We prove the correctness of our protocols
Results 1 - 10 of 51