Byzantine replication under attack
- 1 January 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)
- p. 197-206
- https://doi.org/10.1109/dsn.2008.4630088
Abstract
Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, in the presence of Byzantine faults. In practice, however, faulty processors can, in some protocols, significantly degrade performance by causing the system to make progress at an extremely slow rate. While ldquocorrectrdquo in the traditional sense, systems vulnerable to such performance degradation are of limited practical use in adversarial environments. This paper argues that techniques for mitigating such performance attacks are needed to bridge this ldquopracticality gaprdquo for intrusion-tolerant replication systems. We propose a new performance-oriented correctness criterion, and we show how failure to meet this criterion can lead to performance degradation. We present a new Byzantine replication protocol that achieves the criterion and evaluate its performance in fault-free configurations and when under attack.Keywords
This publication has 24 references indexed in Scilit:
- ZyzzyvaPublished by Association for Computing Machinery (ACM) ,2007
- Fast Byzantine ConsensusIEEE Transactions on Dependable and Secure Computing, 2006
- Practical Byzantine Group CommunicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Randomized Intrusion-Tolerant Asynchronous ServicesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Secure and scalable replication in PhalanxPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Byzantine quorum systemsDistributed Computing, 1998
- Understanding fault-tolerant distributed systemsCommunications of the ACM, 1991
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978