Flexible Byzantine Fault Tolerance
暂无分享,去创建一个
[1] Silvio Micali,et al. Optimal and Player-Replaceable Consensus with an Honest Majority , 2017 .
[2] Vitalik Buterin,et al. Casper the Friendly Finality Gadget , 2017, ArXiv.
[3] Ittai Abraham,et al. HotStuff: BFT Consensus in the Lens of Blockchain , 2018, 1803.05069.
[4] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[5] Danny Dolev,et al. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation , 2006, PODC '06.
[6] Jonathan Katz,et al. On expected constant-round protocols for Byzantine agreement , 2006, J. Comput. Syst. Sci..
[7] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[8] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[9] Elaine Shi,et al. Thunderella: Blockchains with Optimistic Instant Confirmation , 2018, IACR Cryptol. ePrint Arch..
[10] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.
[11] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[12] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[13] Jonathan Katz,et al. Byzantine Agreement with a Rational Adversary , 2012, ICALP.
[14] Michael K. Reiter,et al. Byzantine quorum systems , 1997, STOC '97.
[15] Anna Lysyanskaya,et al. Rationality and Adversarial Behavior in Multi-party Computation , 2006, CRYPTO.
[16] Kartik Nayak,et al. Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness , 2019, IACR Cryptol. ePrint Arch..
[17] Moni Naor,et al. Cryptography and Game Theory: Designing Protocols for Exchanging Information , 2008, TCC.
[18] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[19] Nancy A. Lynch,et al. Distributed Algorithms , 1994, Lecture Notes in Computer Science.
[20] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[21] Dominic Williams,et al. DFINITY Technology Overview Series, Consensus System , 2018, ArXiv.
[22] Leslie Lamport,et al. Fast Paxos , 2006, Distributed Computing.
[23] Kartik Nayak,et al. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience , 2019, IACR Cryptol. ePrint Arch..
[24] Jonathan Katz,et al. Rational Secret Sharing, Revisited , 2006, SCN.
[25] Marko Vukolic,et al. XFT: Practical Fault Tolerance beyond Crashes , 2015, OSDI.
[26] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[27] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[28] Sangmin Lee,et al. Upright cluster services , 2009, SOSP '09.
[29] Kartik Nayak,et al. Dfinity Consensus, Explored , 2018, IACR Cryptol. ePrint Arch..
[30] Benny Pinkas,et al. SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains , 2018, ArXiv.
[31] Jonathan Katz,et al. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees , 2019, IACR Cryptol. ePrint Arch..
[32] Ittai Abraham,et al. HotStuff: BFT Consensus with Linearity and Responsiveness , 2019, PODC.
[33] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[34] Silvio Micali,et al. ALGORAND: The Efficient and Democratic Ledger , 2016, ArXiv.
[35] Benny Pinkas,et al. SBFT: A Scalable and Decentralized Trust Infrastructure , 2018, 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).
[36] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[37] Ethan Buchman,et al. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains , 2016 .
[38] Dahlia Malkhi,et al. Flexible Paxos: Quorum Intersection Revisited , 2016, OPODIS.
[39] David Mazières. The Stellar Consensus Protocol : A Federated Model for Internet-level Consensus , 2015 .
[40] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..
[41] Michael Dahlin,et al. BAR fault tolerance for cooperative services , 2005, SOSP '05.
[42] Arun Venkataramani,et al. Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.