From Byzantine Consensus to Blockchain Consensus

1.

[1]  John Lane,et al.  Byzantine replication under attack , 2008, 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN).

[2]  Roy Friedman,et al.  Distributed Agreement and Its Relation with Error-Correcting Codes , 2002, DISC.

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

[4]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[5]  Elaine Shi,et al.  Nonoutsourceable Scratch-Off Puzzles to Discourage Bitcoin Mining Coalitions , 2015, CCS.

[6]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

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

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

[9]  Miguel Correia,et al.  On Byzantine generals with alternative plans , 2008, J. Parallel Distributed Comput..

[10]  Alysson Neves Bessani,et al.  Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants , 2018, IEEE Transactions on Dependable and Secure Computing.

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

[12]  Nicola Santoro,et al.  Time is Not a Healer , 1989, STACS.

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

[14]  Michael K. Reiter,et al.  Objects shared by Byzantine processes , 2000, Distributed Computing.

[15]  Christian Decker,et al.  Bitcoin meets strong consistency , 2014, ICDCN.

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

[17]  Christian Decker,et al.  Information propagation in the Bitcoin network , 2013, IEEE P2P 2013 Proceedings.

[18]  Sam Toueg,et al.  A Modular Approach to Fault-Tolerant Broadcasts and Related Problems , 1994 .

[19]  Bowen Alpern,et al.  Recognizing safety and liveness , 2005, Distributed Computing.

[20]  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).

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

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

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

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

[25]  Miguel Correia,et al.  Wormhole-Aware Byzantine Protocols , 2004 .

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

[27]  Iddo Bentov,et al.  Proof of Activity: Extending Bitcoin's Proof of Work via Proof of Stake [Extended Abstract]y , 2014, PERV.

[28]  Prateek Saxena,et al.  Making Smart Contracts Smarter , 2016, IACR Cryptol. ePrint Arch..

[29]  Michael K. Reiter,et al.  On k-set consensus problems in asynchronous systems , 1999, PODC '99.

[30]  Michel Raynal,et al.  A simple and fast asynchronous consensus protocol based on a weak failure detector , 1999, Distributed Computing.

[31]  Ittai Anati,et al.  Innovative Technology for CPU Based Attestation and Sealing , 2013 .

[32]  Jialin Li,et al.  Designing Distributed Systems Using Approximate Synchrony in Data Center Networks , 2015, NSDI.

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

[34]  Laurent Vanbever,et al.  Hijacking Bitcoin: Routing Attacks on Cryptocurrencies , 2016, 2017 IEEE Symposium on Security and Privacy (SP).

[35]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[36]  Michel Raynal,et al.  Consensus in Byzantine asynchronous systems , 2003, J. Discrete Algorithms.

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

[38]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

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

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

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

[42]  Daniel Davis Wood,et al.  ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER , 2014 .

[43]  Garrick Hileman,et al.  Global Blockchain Benchmarking Study , 2010 .

[44]  Noga Alon,et al.  Tight bounds for shared memory systems accessed by Byzantine processes , 2002, Distributed Computing.

[45]  Michael K. Reiter,et al.  Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.

[46]  Mahadev Konar,et al.  ZooKeeper: Wait-free Coordination for Internet-scale Systems , 2010, USENIX ATC.

[47]  Vitalik Buterin.  A NEXT GENERATION SMART CONTRACT & DECENTRALIZED APPLICATION PLATFORM , 2015 .

[48]  Elaine Shi,et al.  Permacoin: Repurposing Bitcoin Work for Data Preservation , 2014, 2014 IEEE Symposium on Security and Privacy.

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

[50]  Miguel Correia,et al.  The Design of a COTSReal-Time Distributed Security Kernel , 2002, EDCC.

[51]  George Danezis,et al.  Chainspace: A Sharded Smart Contracts Platform , 2017, NDSS.

[52]  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..

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

[54]  Moshe Babaioff,et al.  On bitcoin and red balloons , 2011, EC '12.

[55]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

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

[57]  Morgen E. Peck,et al.  Blockchains: How they work and why they'll change the world , 2017, IEEE Spectrum.

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

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

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

[61]  Jeremy Clark,et al.  SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies , 2015, 2015 IEEE Symposium on Security and Privacy.

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

[63]  Rachid Guerraoui,et al.  Muteness Failure Detectors: Specification and Implementation , 1999, EDCC.

[64]  Miguel Correia,et al.  Randomized Intrusion-Tolerant Asynchronous Services , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[65]  Satoshi Nakamoto.  Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

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

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

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

[69]  Carl E. Landwehr,et al.  Basic concepts and taxonomy of dependable and secure computing , 2004, IEEE Transactions on Dependable and Secure Computing.

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

[71]  Miguel Correia,et al.  Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces , 2009, IEEE Transactions on Parallel and Distributed Systems.

[72]  Paul D. Ezhilchelvan,et al.  Randomized multivalued consensus , 2001, Fourth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing. ISORC 2001.

[73]  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.

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

[75]  Sunny King,et al.  PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake , 2012 .

[76]  Miguel Correia,et al.  Intrusion Tolerance in Wireless Environments: An Experimental Evaluation , 2007, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007).

[77]  Marcos K. Aguilera,et al.  A pleasant stroll through the land of infinitely many creatures , 2004, SIGA.

[78]  Emin Gün Sirer,et al.  Majority is not enough , 2013, Financial Cryptography.

[79]  Michael Burrows,et al.  The Chubby Lock Service for Loosely-Coupled Distributed Systems , 2006, OSDI.

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

[81]  Paul D. Ezhilchelvan,et al.  From crash tolerance to authenticated byzantine tolerance: a structured approach, the cost and benefits , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[82]  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.

[83]  Alysson Neves Bessani,et al.  Byzantine Consensus with Unknown Participants , 2008, OPODIS.

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

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

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

[87]  Péter Urbán,et al.  Solving Agreement Problems with Weak Ordering Oracles , 2002, EDCC.

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

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

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

[91]  Paulo Veríssimo,et al.  Uncertainty and Predictability: Can They Be Reconciled? , 2003, Future Directions in Distributed Computing.

[92]  Christian Cachin,et al.  Secure INtrusion-Tolerant Replication on the Internet , 2002, Proceedings International Conference on Dependable Systems and Networks.

[93]  Bev Littlewood.  The impact of diversity upon common mode failures , 1996 .

[94]  Christopher Allen,et al.  The TLS Protocol Version 1.0 , 1999, RFC.

[95]  Christian Cachin,et al.  Architecture of the Hyperledger Blockchain Fabric , 2016 .

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

[97]  Louise E. Moser,et al.  The SecureRing group communication system , 2001, TSEC.

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

[99]  Paulo Veríssimo.  Uncertainty and predictability: can they be reconciled? , 2003 .

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

[101]  Michael K. Reiter.  A Secure Group Membership Protocol , 1996, IEEE Trans. Software Eng..

[102]  Hubert Ritzdorf,et al.  On the Security and Performance of Proof of Work Blockchains , 2016, IACR Cryptol. ePrint Arch..

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

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

[105]  A. Bessani.  Chapter 4 A Guided Tour on the Theory and Practice of State Machine Replication , 2014 .

[106]  Michel Raynal,et al.  (Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains , 2017, ArXiv.

[107]  Miguel Correia,et al.  Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols , 2006, 2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06).

[108]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

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

[110]  Marcos K. Aguilera,et al.  Fast Asynchronous Consensus with Optimal Resilience , 2010, DISC.

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

[112]  André Schiper.  Early consensus in an asynchronous system with a weak failure detector , 1997, Distributed Computing.

[113]  Paul C. Attie,et al.  Wait-free Byzantine consensus , 2002, Inf. Process. Lett..

[114]  Mikel Larrea,et al.  Blockchain Consensus , 2019, Encyclopedia of Big Data Technologies.

[115]  Piotr Zieliński,et al.  Paxos at war , 2004 .

[116]  Rami Khalil,et al.  Revive: Rebalancing Off-Blockchain Payment Networks , 2017, IACR Cryptol. ePrint Arch..

[117]  Miguel Correia,et al.  Turquois: Byzantine consensus in wireless ad hoc networks , 2010, 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN).

[118]  Miguel Correia,et al.  Asynchronous Byzantine consensus with 2f+1 processes , 2010, SAC '10.

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

[120]  Neeraj Suri,et al.  The Fail-Heterogeneous Architectural Model , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

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

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

[123]  Ran Canetti,et al.  Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.

[124]  Achour Mostéfaoui,et al.  From static distributed systems to dynamic systems , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[125]  Marko Vukolic,et al.  The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication , 2015, iNetSeC.

[126]  Miguel Correia,et al.  RITAS: Services for Randomized Intrusion Tolerance , 2011, IEEE Transactions on Dependable and Secure Computing.

[127]  Aggelos Kiayias,et al.  The Bitcoin Backbone Protocol: Analysis and Applications , 2015, EUROCRYPT.

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

[129]  Emin Gün Sirer,et al.  Bitcoin-NG: A Scalable Blockchain Protocol , 2015, NSDI.

[130]  Roy Friedman,et al.  Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[131]  Sam Toueg,et al.  Randomized Byzantine Agreements , 1984, PODC '84.

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

[133]  Aviv Zohar,et al.  Secure High-Rate Transaction Processing in Bitcoin , 2015, Financial Cryptography.

[134]  Rachid Guerraoui,et al.  Encapsulating Failure Detection: From Crash to Byzantine Failures , 2002, Ada-Europe.

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

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

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

[138]  Louise E. Moser,et al.  Byzantine Fault Detectors for Solving Consensus , 2003, Comput. J..

[139]  Miguel Correia,et al.  Randomization can be a healer: consensus with dynamic omission failures , 2010, Distributed Computing.