Tolerating Byzantine Faulty Clients in a Quorum System

Liskov, Barbara; Rodrigues, Rodrigo

doi:10.1109/icdcs.2006.83

Cited by 34 publications

(47 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The protocol presented in this paper is an extension of the BFT-BC [10], allowing proactive recovery of servers of the system. We choose this protocol due to its optimal resilience (it requires n = 3f + 1 to tolerate up to f faulty servers), strong semantics (implements an atomic register [8]) and tolerance to malicious clients.…”

Section: Byzantine Quorum Systemsmentioning

confidence: 99%

“…Our protocol is based on BFT-BC [10] and therefore is able to tolerate malicious clients. The main feature introduced in our protocol is the possibility of proactive recovery of servers (Section 3.3), and thus it is called PBFT-BC (proactive Byzantine fault-tolerance for Byzantine clients).…”

Section: Proactive Byzantine Quorum Systemsmentioning

confidence: 99%

“…A Byzantine quorum system should tolerate the presence of malicious clients, since they can perform the following actions to corrupt the system [10]: (i) write different values associated with the same timestamp; (ii) execute the protocol partially, updating the value stored by only some (few) servers; (iii) choose a very large timestamp and exhaust the timestamp space; and (iv) issue a large number of write requests and hand them off to a colluder who will run them after the bad client has been removed from the system. Thus, protocols developed for this purpose should make impossible for malicious clients to perform these actions (or mask them).…”

Section: Proactive Byzantine Quorum Systemsmentioning

confidence: 99%

“…However, the biggest challenge in quorum systems is how to design efficient protocols that tolerate malicious clients. The problem is that clients can execute some malicious actions to hurt system properties, e.g., sending an update only to some servers and not to a complete quorum [10]. This possibility of misbehaviour should not be discarded since quorum systems were developed to be used mainly in open systems such as the Internet, where there is a high probability of at least some clients being malicious.…”

Section: Introductionmentioning

confidence: 99%

“…There are some attacks that still can be executed, e.g., a malicious client prepare several writes to be executed by another malicious client (colluder) after its exclusion of the system. More recently, these weakness were mitigated by the BFT-BC protocol [10], which requires only 3f + 1 servers and allow clients to execute a write only after its previous write completes. The BFT-BC protocol relies on digital signatures (one of the biggest latency sources on Byzantine fault-tolerant protocols [4,6]) to constraint the actions of malicious clients.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Proactive Byzantine Quorum Systems

Alchieri

Bessani

Pereira

et al. 2009

On the Move to Meaningful Internet Systems: OTM 2009

View full text Add to dashboard Cite

Abstract. Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzantine Quorum Systems protocol that provides atomic semantics despite the existence of Byzantine clients and servers. Moreover, this protocol is integrated with a protocol for proactive recovery of servers. In that way, the system tolerates any number of failures during its lifetime, since no more than f out of n servers fail during a small interval of time between recoveries. All solutions proposed in this paper can be used on asynchronous systems, which requires no time assumptions. The proposed quorum system read and write protocols have been implemented and their efficiency is demonstrated through some experiments carried out in the Emulab platform.

show abstract

Section: Byzantine Quorum Systemsmentioning

confidence: 99%

Section: Proactive Byzantine Quorum Systemsmentioning

confidence: 99%

Section: Proactive Byzantine Quorum Systemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Proactive Byzantine Quorum Systems

Alchieri

Bessani

Pereira

et al. 2009

On the Move to Meaningful Internet Systems: OTM 2009

View full text Add to dashboard Cite

show abstract

Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession

Esiner

Küpçü

Özkasap

2015

Intelligent Cloud Computing

View full text Add to dashboard Cite

Abstract. Security measures, such as proving the integrity of the data, became more important with the increase in popularity of cloud data storage services. Dynamic Provable Data Possession (DPDP) was proposed in the literature to enable the cloud server to prove to the client that her data is kept intact, even in a dynamic setting where the client may update her files. Realizing that variable-sized updates are very inefficient in DPDP (in the worst case leading to uploading the whole file again), Flexible DPDP (FlexDPDP) was proposed.In this paper, we analyze FlexDPDP scheme and propose optimized algorithms.We show that the initial pre-processing phase at the client and server sides during the file upload (generally the most time-consuming operation) can be efficiently performed by parallelization techniques that result in a speed up of 6 with 8 cores. We propose a way of handling multiple updates at once both at the server and the client side, achieving an efficiency gain of 60% at the server side and 90% in terms of the client's update verification time. We deployed the optimized FlexDPDP scheme on the large-scale network testbed PlanetLab and demonstrate the efficiency of our proposed optimizations on multi-client scenarios according to real workloads based on version control system traces.

show abstract

Probabilistic Opaque Quorum Systems

Merideth

Reiter

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b + 1 servers (where b is the maximum number of faults tolerated), owing to their use of opaque Byzantine quorum systems; this is 2b more servers than required by some non-optimistic protocols. In this paper, we present a family of probabilistic opaque Byzantine quorum systems that require substantially fewer servers. Our analysis is novel in that it assumes Byzantine clients, anticipating that a faulty client may seek quorums that maximize the probability of error. Using this as motivation, we present an optional, novel protocol that allows probabilistic quorum systems to tolerate Byzantine clients. The protocol requires only one additional round of interaction between the client and the servers, and this round may be amortized over multiple operations. We consider actual error probabilities introduced by the probabilistic approach for concrete configurations of opaque quorum systems, and prove that the probability of error vanishes with as few as n > 3.15b servers as n and b grow.

show abstract

Tolerating Byzantine Faulty Clients in a Quorum System

Abstract: Abstract

Cited by 34 publications

References 12 publications

Proactive Byzantine Quorum Systems

Proactive Byzantine Quorum Systems

Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession

Probabilistic Opaque Quorum Systems

Contact Info

Product

Resources

About