T HE B EDROCK OF BFT: A U NIFIED P LATFORM FOR BFT P ROTOCOL D ESIGN AND I MPLEMENTATION

Byzantine fault-tolerant protocols cover a broad spectrum of design dimensions from environmental setting on communication topology, to more technical features such as commitment strategy and even fundamental social choice related properties like order fairness. Designing and building BFT protocols remains a laborious task despite of years of intensive research. The proliferation of different BFT protocols has rendered it difficult to navigate BFT landscape, let alone determine the protocol that best meets application needs. This paper presents B EDROCK , a unified platform for BFT protocols design and implementation. B EDROCK exposes an API that presents a set of design choices capturing the trade-offs between different design space dimensions in BFT implementations. Based on user choices, B EDROCK then generates the BFT protocols within the space of plausible choices, evolves current protocols to generate new ones, and even uncovers previously unknown protocols. Our experimental results validate the capability of B EDROCK in deriving existing and new BFT protocols.

[1]  Alexey Gotsman,et al.  Making Byzantine consensus live , 2022, Distributed Computing.

[2]  H. Jacobsen,et al.  Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms , 2022, ACM Comput. Surv..

[3]  Man Ho Au,et al.  Bidl: A High-throughput, Low-latency Permissioned Blockchain Framework for Datacenter Networks , 2021, SOSP.

[4]  Luís E. T. Rodrigues,et al.  Kauri: Scalable BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation , 2021, SOSP.

[5]  M. Demirbas,et al.  BigBFT: A Multileader Byzantine Fault Tolerance Protocol for High Throughput , 2021, 2021 IEEE International Performance, Computing, and Communications Conference (IPCCC).

[6]  Zhuolun Xiang,et al.  Good-case and Bad-case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization , 2021, OPODIS.

[7]  Lorenzo Alvisi,et al.  Basil: Breaking up BFT with ACID (transactions) , 2021, SOSP.

[8]  Marko Vukolic,et al.  Adding Fairness to Order: Preventing Front-Running Attacks in BFT Protocols using TEEs , 2021, 2021 40th International Symposium on Reliable Distributed Systems (SRDS).

[9]  R. Guerraoui,et al.  Frugal Byzantine Computing , 2021, DISC.

[10]  Mohammad Javad Amiri,et al.  Qanaat: A Scalable Multi-Enterprise Permissioned Blockchain System with Confidentiality Guarantees , 2021, Proc. VLDB Endow..

[11]  Petr Kuznetsov,et al.  Revisiting Optimal Resilience of Fast Byzantine Consensus , 2021, PODC.

[12]  Ion Stoica,et al.  Scaling Replicated State Machines with Compartmentalization , 2021, Proc. VLDB Endow..

[13]  Ronen Tamari,et al.  Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation , 2021, IEEE Transactions on Network and Service Management.

[14]  Vincent Gramoli,et al.  Red Belly: A Secure, Fair and Scalable Open Blockchain , 2021, 2021 IEEE Symposium on Security and Privacy (SP).

[15]  Murat Demirbas,et al.  Bottlenecks in Blockchain Consensus Protocols , 2021, 2021 IEEE International Conference on Omni-Layer Intelligent Systems (COINS).

[16]  Kartik Nayak,et al.  Good-case Latency of Byzantine Broadcast: a Complete Categorization , 2021, PODC.

[17]  Tobias Distler,et al.  Byzantine Fault-tolerant State-machine Replication from a Systems Perspective , 2021, ACM Comput. Surv..

[18]  Muhammad Ali Imran,et al.  A Scalable Multi-Layer PBFT Consensus for Blockchain , 2020, IEEE Transactions on Parallel and Distributed Systems.

[19]  Mohammad Sadoghi,et al.  RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing , 2020, 2021 IEEE 37th International Conference on Data Engineering (ICDE).

[20]  Jing Xu,et al.  Dumbo: Faster Asynchronous BFT Protocols , 2020, IACR Cryptol. ePrint Arch..

[21]  Kartik Nayak,et al.  On the Optimality of Optimistic Responsiveness , 2020, IACR Cryptol. ePrint Arch..

[22]  Elaine Shi,et al.  Streamlet: Textbook Streamlined Blockchains , 2020, IACR Cryptol. ePrint Arch..

[23]  Klaus Kursawe,et al.  Wendy, the Good Little Fairness Widget: Achieving Order Fairness for Blockchains , 2020, AFT.

[24]  Srinath T. V. Setty,et al.  Byzantine Ordered Consensus without Byzantine Oligarchy , 2020, IACR Cryptol. ePrint Arch..

[25]  Roger Wattenhofer,et al.  FnF-BFT: Exploring Performance Limits of BFT Protocols , 2020, ArXiv.

[26]  Ari Juels,et al.  Order-Fairness for Byzantine Consensus , 2020, IACR Cryptol. ePrint Arch..

[27]  Amr El Abbadi,et al.  SEPAR: A Privacy-Preserving Blockchain-based System for Regulating Multi-Platform Crowdworking Environments , 2020, ArXiv.

[28]  Kartik Nayak,et al.  Sync HotStuff: Simple and Practical Synchronous State Machine Replication , 2020, 2020 IEEE Symposium on Security and Privacy (SP).

[29]  Dawn Song,et al.  Keystone: an open framework for architecting trusted execution environments , 2020, EuroSys.

[30]  Amr El Abbadi,et al.  Modern Large-Scale Data Management Systems after 40 Years of Consensus , 2020, 2020 IEEE 36th International Conference on Data Engineering (ICDE).

[31]  Kartik Nayak,et al.  Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency , 2020, DISC.

[32]  Beng Chin Ooi,et al.  A Transactional Perspective on Execute-order-validate Blockchains , 2020, SIGMOD Conference.

[33]  Ailidani Ailijiang,et al.  PigPaxos: Devouring the Communication Bottlenecks in Distributed Consensus , 2020, SIGMOD Conference.

[34]  I. Keidar,et al.  Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR , 2020, DISC.

[35]  Mohammad Sadoghi,et al.  ResilientDB , 2020, Proc. VLDB Endow..

[36]  V. Gramoli,et al.  Dispel: Byzantine SMR with Distributed Pipelining , 2019, ArXiv.

[37]  Ian Aragon Escobar,et al.  Boosting concurrency in Parallel State Machine Replication , 2019, Middleware.

[38]  Suyash Gupta,et al.  Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation , 2019, EDBT.

[39]  George Danezis,et al.  SoK: Consensus in the Age of Blockchains , 2017, AFT.

[40]  Mohammad Javad Amiri,et al.  SharPer: Sharding Permissioned Blockchains Over Network Clusters , 2019, SIGMOD Conference.

[41]  Hans P. Reiser,et al.  Resilient Wide-Area Byzantine Consensus Using Adaptive Weighted Replication , 2019, 2019 38th Symposium on Reliable Distributed Systems (SRDS).

[42]  A. Spiegelman,et al.  Cogsworth: Byzantine View Synchronization. , 2019, 1909.05204.

[43]  Eli Ben-Sasson,et al.  Scalable Zero Knowledge with No Trusted Setup , 2019, CRYPTO.

[44]  Ittai Abraham,et al.  HotStuff: BFT Consensus with Linearity and Responsiveness , 2019, PODC.

[45]  Divyakant Agrawal,et al.  CAPER: A Cross-Application Permissioned Blockchain , 2019, Proc. VLDB Endow..

[46]  Lukasz Golab,et al.  XOX Fabric: A hybrid approach to transaction execution , 2019, ArXiv.

[47]  Murat Demirbas,et al.  Dissecting the Performance of Strongly-Consistent Replication Protocols , 2019, SIGMOD Conference.

[48]  Jens Dittrich,et al.  Blurring the Lines between Blockchains and Database Systems: the Case of Hyperledger Fabric , 2019, SIGMOD Conference.

[49]  Divyakant Agrawal,et al.  SeeMoRe: A Fault-Tolerant Protocol for Hybrid Cloud Environments , 2019, 2020 IEEE 36th International Conference on Data Engineering (ICDE).

[50]  C. Stathakopoulou,et al.  Mir-BFT: High-Throughput BFT for Blockchains , 2019, ArXiv.

[51]  Idit Keidar,et al.  FairLedger: A Fair Blockchain Protocol for Financial Institutions , 2019, OPODIS.

[52]  Yair Amir,et al.  Deploying Intrusion-Tolerant SCADA for the Power Grid , 2019, 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[53]  Marcos K. Aguilera,et al.  The Impact of RDMA on Agreement , 2019, PODC.

[54]  Binoy Ravindran,et al.  ezBFT: Decentralizing Byzantine Fault-Tolerant State Machine Replication , 2019, 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS).

[55]  Faisal Nawab,et al.  Blockplane: A Global-Scale Byzantizing Middleware , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[56]  Kartik Nayak,et al.  Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience , 2019, IACR Cryptol. ePrint Arch..

[57]  Divyakant Agrawal,et al.  ParBlockchain: Leveraging Transaction Parallelism in Permissioned Blockchain Systems , 2019, 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS).

[58]  Stephen Lee,et al.  FastFabric: Scaling Hyperledger Fabric to 20,000 Transactions per Second , 2019, 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC).

[59]  Hans P. Reiser,et al.  Scaling Byzantine Consensus: A Broad Analysis , 2018, SERIAL@Middleware.

[60]  Michel Raynal,et al.  DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains , 2018, 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA).

[61]  Haibin Zhang,et al.  BEAT: Asynchronous BFT Made Practical , 2018, CCS.

[62]  Mariana Raykova,et al.  RapidChain: Scaling Blockchain via Full Sharding , 2018, CCS.

[63]  Ronen Tamari,et al.  A Fair Consensus Protocol for Transaction Ordering , 2018, 2018 IEEE 26th International Conference on Network Protocols (ICNP).

[64]  T. Distler,et al.  Scalable Byzantine fault-tolerant state-machine replication on heterogeneous servers , 2018, Computing.

[65]  Marcos K. Aguilera,et al.  Passing Messages while Sharing Memory , 2018, PODC.

[66]  Ethan Buchman,et al.  The latest gossip on BFT consensus , 2018, ArXiv.

[67]  Johannes Behl,et al.  Troxy: Transparent Access to Byzantine Fault-Tolerant Systems , 2018, 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[68]  Tobias Distler,et al.  Latency-Aware Leader Selection for Geo-Replicated Byzantine Fault-Tolerant Systems , 2018, 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W).

[69]  Nuno Neves,et al.  On the Challenges of Building a BFT SCADA , 2018, 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[70]  Divyakant Agrawal,et al.  DPaxos: Managing Data Closer to Users for Low-Latency and Mobile Applications , 2018, SIGMOD Conference.

[71]  Philipp Jovanovic,et al.  OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding , 2018, 2018 IEEE Symposium on Security and Privacy (SP).

[72]  Dominic Williams,et al.  DFINITY Technology Overview Series, Consensus System , 2018, ArXiv.

[73]  Elaine Shi,et al.  Thunderella: Blockchains with Optimistic Instant Confirmation , 2018, IACR Cryptol. ePrint Arch..

[74]  Benny Pinkas,et al.  SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains , 2018, ArXiv.

[75]  Marko Vukolic,et al.  Hyperledger fabric: a distributed operating system for permissioned blockchains , 2018, EuroSys.

[76]  Ramakrishna Kotla,et al.  Revisiting Fast Practical Byzantine Fault Tolerance , 2017, ArXiv.

[77]  Vitalik Buterin,et al.  Casper the Friendly Finality Gadget , 2017, ArXiv.

[78]  Silvio Micali,et al.  Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..

[79]  Ittai Abraham,et al.  The Blockchain Consensus Layer and BFT , 2017, Bull. EATCS.

[80]  Aggelos Kiayias,et al.  Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.

[81]  Marko Vukolic,et al.  Blockchain Consensus Protocols in the Wild , 2017, DISC.

[82]  Johannes Behl,et al.  Hybrids on Steroids: SGX-Based High Performance BFT , 2017, EuroSys.

[83]  Murat Demirbas,et al.  WPaxos: Wide Area Network Flexible Consensus , 2017, IEEE Transactions on Parallel and Distributed Systems.

[84]  Kartik Nayak,et al.  Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus , 2016, OPODIS.

[85]  Elaine Shi,et al.  The Honey Badger of BFT Protocols , 2016, CCS.

[86]  Prateek Saxena,et al.  A Secure Sharding Protocol For Open Blockchains , 2016, CCS.

[87]  Tobias Distler,et al.  Resource-Efficient Byzantine Fault Tolerance , 2016, IEEE Transactions on Computers.

[88]  Tobias Distler,et al.  SAREK: Optimistic Parallel Ordering in Byzantine Fault Tolerance , 2016, 2016 12th European Dependable Computing Conference (EDCC).

[89]  Dahlia Malkhi,et al.  Flexible Paxos: Quorum Intersection Revisited , 2016, OPODIS.

[90]  Alysson Bessani,et al.  SieveQ: A Layered BFT Protection System for Critical Services , 2016, IEEE Transactions on Dependable and Secure Computing.

[91]  Ethan Buchman,et al.  Tendermint: Byzantine Fault Tolerance in the Age of Blockchains , 2016 .

[92]  Sara Bouchenak,et al.  BFT-Bench: Towards a Practical Evaluation of Robustness and Effectiveness of BFT Protocols , 2016, DAIS.

[93]  Neeraj Suri,et al.  On Choosing Server- or Client-Side Solutions for BFT , 2016, ACM Comput. Surv..

[94]  Bryan Ford,et al.  Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing , 2016, USENIX Security Symposium.

[95]  Johannes Behl,et al.  Consensus-Oriented Parallelization: How to Earn Your First Million , 2015, Middleware.

[96]  Alysson Neves Bessani,et al.  Separating the WHEAT from the Chaff: An Empirical Design for Geo-Replicated State Machines , 2015, 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS).

[97]  João Leitão,et al.  Visigoth fault tolerance , 2015, EuroSys.

[98]  Marko Vukolic,et al.  XFT: Practical Fault Tolerance beyond Crashes , 2015, OSDI.

[99]  Alysson Neves Bessani,et al.  State Machine Replication for the Masses with BFT-SMART , 2014, 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks.

[100]  John K. Ousterhout,et al.  In Search of an Understandable Consensus Algorithm , 2014, USENIX ATC.

[101]  Domenico Cotroneo,et al.  A survey of software aging and rejuvenation studies , 2014, ACM J. Emerg. Technol. Comput. Syst..

[102]  David G. Andersen,et al.  There is more consensus in Egalitarian parliaments , 2013, SOSP.

[103]  Miguel Correia,et al.  DepSky: Dependable and Secure Storage in a Cloud-of-Clouds , 2013, TOS.

[104]  André Schiper,et al.  Bounded Delay in Byzantine-Tolerant State Machine Replication , 2013, 2013 IEEE 32nd International Symposium on Reliable Distributed Systems.

[105]  Robbert van Renesse,et al.  Vive La Différence: Paxos vs. Viewstamped Replication vs. Zab , 2013, IEEE Transactions on Dependable and Secure Computing.

[106]  Vivien Quéma,et al.  RBFT: Redundant Byzantine Fault Tolerance , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[107]  Hui Ding,et al.  TAO: Facebook's Distributed Data Store for the Social Graph , 2013, USENIX Annual Technical Conference.

[108]  Alysson Neves Bessani,et al.  An intrusion-tolerant firewall design for protecting SIEM systems , 2013, 2013 43rd Annual IEEE/IFIP Conference on Dependable Systems and Networks Workshop (DSN-W).

[109]  Carlos V. Rozas,et al.  Innovative instructions and software model for isolated execution , 2013, HASP '13.

[110]  Miguel Correia,et al.  BFT-TO: Intrusion Tolerance with Less Replicas , 2013, Comput. J..

[111]  Robbert van Renesse,et al.  Byzantine Chain Replication , 2012, OPODIS.

[112]  Ghassan O. Karame,et al.  PoWerStore: proofs of writing for efficient and robust storage , 2012, CCS.

[113]  André Schiper,et al.  S-Paxos: Offloading the Leader for High Throughput State Machine Replication , 2012, 2012 IEEE 31st Symposium on Reliable Distributed Systems.

[114]  Christopher Frost,et al.  Spanner: Google's Globally-Distributed Database , 2012, OSDI.

[115]  Yang Wang,et al.  All about Eve: Execute-Verify Replication for Multi-Core Servers , 2012, OSDI.

[116]  Barbara Liskov,et al.  Viewstamped Replication Revisited , 2012 .

[117]  Johannes Behl,et al.  CheapBFT: resource-efficient byzantine fault tolerance , 2012, EuroSys '12.

[118]  Leslie Lamport,et al.  Brief Announcement: Leaderless Byzantine Paxos , 2011, DISC.

[119]  John Lane,et al.  Prime: Byzantine Replication under Attack , 2011, IEEE Transactions on Dependable and Secure Computing.

[120]  Miguel Correia,et al.  Byzantine consensus in asynchronous message-passing systems: a survey , 2011, Int. J. Crit. Comput. Based Syst..

[121]  Flavio Paiva Junqueira,et al.  Zab: High-performance broadcast for primary-backup systems , 2011, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN).

[122]  Arun Venkataramani,et al.  ZZ and the art of practical BFT execution , 2011, EuroSys '11.

[123]  Miguel Correia,et al.  EBAWA: Efficient Byzantine Agreement for Wide-Area Networks , 2010, 2010 IEEE 12th International Symposium on High Assurance Systems Engineering.

[124]  Dan Dobre,et al.  Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas , 2010, 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN).

[125]  Fred B. Schneider,et al.  Proactive obfuscation , 2010, TOCS.

[126]  Dan Dobre,et al.  HP: Hybrid Paxos for WANs , 2010, 2010 European Dependable Computing Conference.

[127]  Miguel Correia,et al.  Highly Available Intrusion-Tolerant Services with Proactive-Reactive Recovery , 2010, IEEE Transactions on Parallel and Distributed Systems.

[128]  André Schiper,et al.  A Leader-Free Byzantine Consensus Algorithm , 2010, ICDCN.

[129]  Sangmin Lee,et al.  Upright cluster services , 2009, SOSP '09.

[130]  Miguel Correia,et al.  Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary , 2009, 2009 28th IEEE International Symposium on Reliable Distributed Systems.

[131]  Michael Dahlin,et al.  Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults , 2009, NSDI.

[132]  Jacob R. Lorch,et al.  TrInc: Small Trusted Hardware for Large Distributed Systems , 2009, NSDI.

[133]  Marko Vukolic,et al.  The Next 700 BFT Protocols , 2015, ACM Trans. Comput. Syst..

[134]  Miguel Correia,et al.  The Crutial Way of Critical Infrastructure Protection , 2008, IEEE Security & Privacy Magazine.

[135]  Robbert van Renesse,et al.  Bosco: One-Step Byzantine Asynchronous Consensus , 2008, DISC.

[136]  Michael Stonebraker,et al.  H-store: a high-performance, distributed main memory transaction processing system , 2008, Proc. VLDB Endow..

[137]  Atul Singh,et al.  BFT Protocols Under Fire , 2008, NSDI.

[138]  Ramakrishna Kotla,et al.  Zyzzyva , 2007, SOSP.

[139]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[140]  Scott Shenker,et al.  Attested append-only memory: making adversaries stick to their word , 2007, SOSP.

[141]  Michael K. Reiter,et al.  Low-overhead byzantine fault-tolerant storage , 2007, SOSP.

[142]  Rüdiger Kapitza,et al.  Hypervisor-Based Efficient Proactive Recovery , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[143]  Lorenzo Alvisi,et al.  The Paxos Register , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[144]  Robert Griesemer,et al.  Paxos made live: an engineering perspective , 2007, PODC '07.

[145]  David Mazières,et al.  Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems , 2007, NSDI.

[146]  Miguel Correia,et al.  Worm-IT - A wormhole-based intrusion-tolerant group communication system , 2007, J. Syst. Softw..

[147]  Andreas Haeberlen,et al.  The Case for Byzantine Fault Detection , 2006, HotDep.

[148]  Liuba Shrira,et al.  HQ replication: a hybrid quorum protocol for byzantine fault tolerance , 2006, OSDI '06.

[149]  Paulo Veríssimo,et al.  Travelling through wormholes: a new look at distributed systems models , 2006, SIGA.

[150]  HariGovind V. Ramasamy,et al.  Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast , 2005, OPODIS.

[151]  Miguel Correia,et al.  Solving vector consensus with a wormhole , 2005, IEEE Transactions on Parallel and Distributed Systems.

[152]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[153]  Michael Dahlin,et al.  BAR fault tolerance for cooperative services , 2005, SOSP '05.

[154]  Jean-Philippe Martin,et al.  Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.

[155]  Leslie Lamport,et al.  Generalized Consensus and Paxos , 2005 .

[156]  Miguel Correia,et al.  Low complexity Byzantine-resilient consensus , 2005, Distributed Computing.

[157]  Miguel Correia,et al.  How to tolerate half less one Byzantine nodes in practical distributed systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[158]  Leslie Lamport,et al.  Cheap Paxos , 2004, International Conference on Dependable Systems and Networks, 2004.

[159]  Ramakrishna Kotla,et al.  High throughput Byzantine fault tolerance , 2004, International Conference on Dependable Systems and Networks, 2004.

[160]  Michael K. Reiter,et al.  Efficient Byzantine-tolerant erasure-coded storage , 2004, International Conference on Dependable Systems and Networks, 2004.

[161]  Arun Venkataramani,et al.  Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.

[162]  Miguel Castro,et al.  Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OPSR.

[163]  Robbert van Renesse,et al.  COCA: a secure distributed online certification authority , 2002, Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems].

[164]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[165]  Achour Mostéfaoui,et al.  Consensus in One Communication Step , 2001, PaCT.

[166]  Victor Shoup,et al.  Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.

[167]  Butler W. Lampson,et al.  The ABCD's of Paxos , 2001, PODC '01.

[168]  Victor Shoup,et al.  Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.

[169]  Miguel Castro,et al.  Proactive recovery in a Byzantine-fault-tolerant system , 2000, OSDI.

[170]  Victor Shoup,et al.  Practical Threshold Signatures , 2000, EUROCRYPT.

[171]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[172]  Michael K. Reiter,et al.  Survivable consensus objects , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[173]  Michael K. Reiter,et al.  Secure and scalable replication in Phalanx , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[174]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[175]  Michael K. Reiter,et al.  Unreliable intrusion detection in distributed computations , 1997, Proceedings 10th Computer Security Foundations Workshop.

[176]  David H. Ackley,et al.  Building diverse computer systems , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[177]  Michael K. Reiter,et al.  Byzantine quorum systems , 1997, STOC '97.

[178]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[179]  Wei-Pang Yang,et al.  A Note on Consensus on Dual Failure Modes , 1996, IEEE Trans. Parallel Distributed Syst..

[180]  Yennun Huang,et al.  Software rejuvenation: analysis, module and applications , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[181]  Gene Tsudik,et al.  Message authentication with one-way hash functions , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[182]  Dhiraj K. Pradhan,et al.  Consensus With Dual Failure Modes , 1991, IEEE Trans. Parallel Distributed Syst..

[183]  Nancy A. Lynch,et al.  Bounds on the time to reach agreement in the presence of timing uncertainty , 1991, STOC '91.

[184]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[185]  Philip M. Thambidurai,et al.  Interactive consistency with multiple failure modes , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

[186]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[187]  Algirdas Avizienis,et al.  The N-Version Approach to Fault-Tolerant Software , 1985, IEEE Transactions on Software Engineering.

[188]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[189]  Amr El Abbadi,et al.  Availability in partitioned replicated databases , 1985, PODS.

[190]  Amr El Abbadi,et al.  Implementing Fault-Tolerant Distributed Objects , 1985, IEEE Transactions on Software Engineering.

[191]  Flaviu Cristian,et al.  An efficient, fault-tolerant protocol for replicated data management , 1985, Fault-Tolerant Distributed Computing.

[192]  Gabriel Bracha,et al.  An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[193]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[194]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[195]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[196]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[197]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[198]  Sreeram Kannan,et al.  Themis: Fast, Strong Order-Fairness in Byzantine Consensus , 2023, IACR Cryptol. ePrint Arch..

[199]  Klaus Kursawe,et al.  Wendy Grows Up: More Order Fairness , 2021, Financial Cryptography Workshops.

[200]  Boon Thau Loo,et al.  Saguaro: Efficient Processing of Transactions in Wide Area Networks using a Hierarchical Permissioned Blockchain , 2021, ArXiv.

[201]  Eleftherios Kokoris-Kogias,et al.  Robust and Scalable Consensus for Sharded Distributed Ledgers , 2019, IACR Cryptol. ePrint Arch..

[202]  A. Sonnino,et al.  State Machine Replication in the Libra Blockchain , 2019 .

[203]  Elaine Shi,et al.  PaLa: A Simple Partially Synchronous Blockchain , 2018, IACR Cryptol. ePrint Arch..

[204]  Elaine Shi,et al.  PiLi: An Extremely Simple Synchronous Blockchain , 2018, IACR Cryptol. ePrint Arch..

[205]  Miguel Correia,et al.  Fireplug: Flexible and robust N-version geo-replication of graph databases , 2018, 2018 International Conference on Information Networking (ICOIN).

[206]  Srinivas Devadas,et al.  Sanctum: Minimal Hardware Extensions for Strong Software Isolation , 2016, USENIX Security Symposium.

[207]  Elaine Shi,et al.  Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.

[208]  R. Brown,et al.  Corda : An Introduction , 2016 .

[209]  Dong Wei,et al.  Survivable SCADA Via Intrusion-Tolerant Replication , 2014, IEEE Transactions on Smart Grid.

[210]  Jae Kwon,et al.  Tendermint : Consensus without Mining , 2014 .

[211]  Miguel Correia,et al.  Efficient Byzantine Fault-Tolerance , 2013, IEEE Transactions on Computers.

[212]  D. Andersen,et al.  Egalitarian Paxos , 2012 .

[213]  Tobias Distler,et al.  SPARE: Replicas on Hold , 2011, NDSS.

[214]  Yawei Li,et al.  Megastore: Providing Scalable, Highly Available Storage for Interactive Services , 2011, CIDR.

[215]  John Lane,et al.  Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks , 2010, IEEE Transactions on Dependable and Secure Computing.

[216]  K. Marzullo,et al.  Towards Low Latency State Machine Replication for Uncivil Wide-area Networks , 2009 .

[217]  Leslie Lamport,et al.  Fast Paxos , 2006, Distributed Computing.

[218]  Miguel Correia,et al.  From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures , 2006, Comput. J..

[219]  Leslie Lamport,et al.  Paxos Made Simple , 2001 .

[220]  R. Gold,et al.  Boosting system performance with optimistic distributed protocols , 2001 .

[221]  Barbara Liskov,et al.  Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems , 1999, PODC '88.

[222]  Priya Narasimhan,et al.  The Eternal system: an architecture for enterprise applications , 1999, Proceedings Third International Enterprise Distributed Object Computing. Conference (Cat. No.99EX366).

[223]  Roger M. Kieckhafer,et al.  Reaching Approximate Agreement with Mixed-Mode Faults , 1994, IEEE Trans. Parallel Distributed Syst..

[224]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[225]  MultiChain Private Blockchain — White Paper , 2022 .