2011
DOI: 10.1109/tdsc.2010.70
|View full text |Cite
|
Sign up to set email alerts
|

Prime: Byzantine Replication under Attack

Abstract: Abstract-Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, even in the presence of Byzantine faults. The runtime performance of these protocols is most commonly assessed in the absence of processor faults and is usually good in that case. However, in some protocols faulty processors can significantly degrade performance, limiting the practical utility of these protocols in adversarial environments. This paper demonstrates the extent of performanc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
104
0
1

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 145 publications
(106 citation statements)
references
References 33 publications
1
104
0
1
Order By: Relevance
“…Unfortunately, as we show in this section, a Byzantine client or a Byzantine replica can attack this protocol and drastically reduce its performance. This fragility of BFT protocols is well known and motivated the development of three so-called robust protocols: Spinning [Veronese et al 2009], Prime [Amir et al 2011], and Aardvark [Clement et al 2009]. In this section, we first study the performance achieved by Aliph when clients or replicas attack the protocol (Section 6.1).…”
Section: Making Aliph Robust: R-aliphmentioning
confidence: 99%
See 2 more Smart Citations
“…Unfortunately, as we show in this section, a Byzantine client or a Byzantine replica can attack this protocol and drastically reduce its performance. This fragility of BFT protocols is well known and motivated the development of three so-called robust protocols: Spinning [Veronese et al 2009], Prime [Amir et al 2011], and Aardvark [Clement et al 2009]. In this section, we first study the performance achieved by Aliph when clients or replicas attack the protocol (Section 6.1).…”
Section: Making Aliph Robust: R-aliphmentioning
confidence: 99%
“…The fact that efficient BFT protocols are often fragile (i.e., perform poorly under attack) motivated the development of so-called robust BFT protocols: Spinning [Veronese et al 2009], Prime [Amir et al 2011], and Aardvark [Clement et al 2009]. These protocols aim at achieving good performance when the network is synchronous, despite the presence of Byzantine faulty clients and replicas.…”
Section: A Brief Overview Of "Robust" Bft Protocolsmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, a straightforward implementation of a BFT firewall would require replicas to process every arriving message and then agree on their delivery. BFT solutions based on a leader can also become prey of an adversary, as they have a natural bottleneck replica that can be selected for the attack (instead of having to disperse the attack power over all replicas [13]). …”
Section: Design Choicesmentioning
confidence: 99%
“…Survivability means that the SCADA system, continue to work correctly with minimal degradation performance, even if malicious anomalies have jeopardized a part of the system. To achieve survivability, the proposed system uses the anomaly tolerance method presented in [8] and [9]. In [10] Maglaras and his colleagues have offered an anomaly detection module which is able to detect malicious traffic of the network in SCADA system.…”
Section: Introductionmentioning
confidence: 99%