Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Prime: Byzantine Replication under Attack

Published: 01 July 2011 Publication History

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, faulty processors can significantly degrade the performance of some protocols, limiting their practical utility in adversarial environments. This paper demonstrates the extent of performance degradation possible in some existing protocols that do satisfy liveness and that do perform well absent Byzantine faults. We propose a new performance-oriented correctness criterion that requires a consistent level of performance, even with Byzantine faults. We present a new Byzantine fault-tolerant replication protocol that meets the new correctness criterion and evaluate its performance in fault-free executions and when under attack.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing  Volume 8, Issue 4
July 2011
143 pages

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 July 2011

Author Tags

  1. Byzantine fault tolerance
  2. Performance under attack
  3. distributed systems.
  4. replicated state machines

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Rashnu: Data-Dependent Order-FairnessProceedings of the VLDB Endowment10.14778/3665844.366586117:9(2335-2348)Online publication date: 1-May-2024
  • (2024)Towards Full Stack Adaptivity in Permissioned BlockchainsProceedings of the VLDB Endowment10.14778/3641204.364121617:5(1073-1080)Online publication date: 1-Jan-2024
  • (2024)Towards Truly Adaptive Byzantine Fault-Tolerant ConsensusACM SIGOPS Operating Systems Review10.1145/3689051.368905558:1(15-22)Online publication date: 14-Aug-2024
  • (2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
  • (2023)AdaChain: A Learned Adaptive BlockchainProceedings of the VLDB Endowment10.14778/3594512.359453116:8(2033-2046)Online publication date: 22-Jun-2023
  • (2023)Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus AlgorithmsACM Computing Surveys10.1145/363655356:5(1-41)Online publication date: 9-Dec-2023
  • (2023)FnF-BFT: A BFT Protocol with Provable Performance Under AttackStructural Information and Communication Complexity10.1007/978-3-031-32733-9_9(165-198)Online publication date: 6-Jun-2023
  • (2022)Scalable byzantine fault tolerance via partial decentralizationProceedings of the VLDB Endowment10.14778/3538598.353859915:9(1739-1752)Online publication date: 27-Jul-2022
  • (2022)PACEProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security10.1145/3548606.3559348(3151-3164)Online publication date: 7-Nov-2022
  • (2022)BFT in Blockchains: From Protocols to Use CasesACM Computing Surveys10.1145/350304254:10s(1-37)Online publication date: 13-Sep-2022
  • Show More Cited By

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media