ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication
暂无分享,去创建一个
[1] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[2] John K. Ousterhout,et al. In Search of an Understandable Consensus Algorithm , 2014, USENIX Annual Technical Conference.
[3] Ittai Abraham,et al. Bootstrapping Consensus Without Trusted Setup: Fully Asynchronous Distributed Key Generation , 2019, IACR Cryptol. ePrint Arch..
[4] Achour Mostéfaoui,et al. Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time , 2015, SIROCCO.
[5] Jared Saia,et al. Byzantine agreement in polynomial expected time: [extended abstract] , 2013, STOC '13.
[6] HariGovind V. Ramasamy,et al. Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast , 2005, OPODIS.
[7] Leslie Lamport,et al. Paxos Made Simple , 2001 .
[8] Marko Vukolic,et al. XFT: Practical Fault Tolerance beyond Crashes , 2015, OSDI.
[9] Barbara Liskov,et al. Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems , 1999, PODC '88.
[10] Hein Meling,et al. BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration , 2014, OPODIS.
[11] Bruce M. Kapron,et al. Fast asynchronous byzantine agreement and leader election with full information , 2008, SODA '08.
[12] Daniel Lehmann,et al. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.
[13] Victor Shoup,et al. Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.
[14] John Lane,et al. Prime: Byzantine Replication under Attack , 2011, IEEE Transactions on Dependable and Secure Computing.
[15] Idit Keidar,et al. FairLedger: A Fair Blockchain Protocol for Financial Institutions , 2019, OPODIS.
[16] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[17] Yoram Moses,et al. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..
[18] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[19] Brian F. Cooper. Spanner: Google's globally-distributed database , 2013, SYSTOR '13.
[20] Michael K. Reiter,et al. Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.
[21] Leslie Lamport,et al. Vertical paxos and primary-backup replication , 2009, PODC '09.
[22] Arun Venkataramani,et al. Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.
[23] Marko Vukolic,et al. The Next 700 BFT Protocols , 2015, ACM Trans. Comput. Syst..
[24] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[25] Achour Mostéfaoui,et al. Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t , 2016, Acta Informatica.
[26] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[27] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[28] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[29] Ittai Abraham,et al. Asymptotically Optimal Validated Asynchronous Byzantine Agreement , 2019, PODC.
[30] Ittai Abraham,et al. HotStuff: BFT Consensus with Linearity and Responsiveness , 2019, PODC.
[31] Satoshi Nakamoto. Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .
[32] David Mazières,et al. Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems , 2007, NSDI.
[33] John Lane,et al. Customizable Fault Tolerance forWide-Area Replication , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).
[34] 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.
[35] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[36] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[37] Ramakrishna Kotla,et al. Zyzzyva: speculative byzantine fault tolerance , 2007, TOCS.
[38] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[39] Jonathan Kirsch,et al. Scaling Byzantine Fault-Tolerant Replication toWide Area Networks , 2006, International Conference on Dependable Systems and Networks (DSN'06).
[40] Haibin Zhang,et al. BEAT: Asynchronous BFT Made Practical , 2018, CCS.
[41] 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).
[42] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[43] Michael Dahlin,et al. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults , 2009, NSDI.
[44] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.
[45] Nicola Santoro,et al. Time is Not a Healer , 1989, STACS.
[46] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.