暂无分享,去创建一个
Sisi Duan | Chao Liu | Haibin Zhang | Sisi Duan | Haibin Zhang | Chao Liu
[1] Michel Raynal,et al. Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast , 2016, Parallel Process. Lett..
[2] Chao Liu,et al. EPIC: Efficient Asynchronous BFT with Adaptive Security , 2020, 2020 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).
[3] Victor Shoup,et al. Optimistic Asynchronous Atomic Broadcast , 2005, ICALP.
[4] Brett D. Fleisch,et al. The Chubby lock service for loosely-coupled distributed systems , 2006, OSDI '06.
[5] Kartik Nayak,et al. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus , 2016, OPODIS.
[6] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[7] Tal Rabin,et al. Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.
[8] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[9] Achour Mostéfaoui,et al. Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages , 2014, PODC.
[10] Piotr Berman,et al. Randomized distributed agreement revisited , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.
[11] C. Pandu Rangan,et al. Simple and efficient asynchronous byzantine agreement with optimal resilience , 2009, PODC '09.
[12] Michael K. Reiter,et al. Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.
[13] Jing Xu,et al. Dumbo: Faster Asynchronous BFT Protocols , 2020, IACR Cryptol. ePrint Arch..
[14] Sam Toueg,et al. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms , 1987, Distributed Computing.
[15] HariGovind V. Ramasamy,et al. Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast , 2005, OPODIS.
[16] Ittai Abraham,et al. Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication , 2018, ArXiv.
[17] Robbert van Renesse,et al. Bosco: One-Step Byzantine Asynchronous Consensus , 2008, DISC.
[18] Rosario Gennaro,et al. Securing Threshold Cryptosystems against Chosen Ciphertext Attack , 1998, Journal of Cryptology.
[19] Gabriel Bracha,et al. Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..
[20] Petr Kuznetsov,et al. Online Payments by Merely Broadcasting Messages , 2020, 2020 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).
[21] Mahadev Konar,et al. ZooKeeper: Wait-free Coordination for Internet-scale Systems , 2010, USENIX ATC.
[22] Ian Miers,et al. Charm: a framework for rapidly prototyping cryptosystems , 2013, Journal of Cryptographic Engineering.
[23] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[24] Miguel Correia,et al. From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures , 2006, Comput. J..
[25] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[26] Lorenzo Alvisi,et al. Fast Byzantine Paxos , 2004 .
[27] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[28] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[29] Miguel Correia,et al. RITAS: Services for Randomized Intrusion Tolerance , 2011, IEEE Transactions on Dependable and Secure Computing.
[30] Mariana Raykova,et al. RapidChain: A Fast Blockchain Protocol via Full Sharding , 2018, IACR Cryptol. ePrint Arch..
[31] FriedmanRoy,et al. Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems , 2005 .
[32] 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).
[33] Stefano Tessaro,et al. Asynchronous verifiable information dispersal , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).
[34] Bryan Ford,et al. Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing , 2016, USENIX Security Symposium.
[35] Ethan MacBrough,et al. Cobalt: BFT Governance in Open Networks , 2018, ArXiv.
[36] Bryan Ford,et al. OmniLedger: A Secure, Scale-Out, Decentralized Ledger , 2017, IACR Cryptol. ePrint Arch..
[37] Victor Shoup,et al. Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.
[38] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[39] Piotr Zielinski,et al. Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.
[40] Hein Meling,et al. BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration , 2014, OPODIS.
[41] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[42] Christian Cachin,et al. Secure INtrusion-Tolerant Replication on the Internet , 2002, Proceedings International Conference on Dependable Systems and Networks.
[43] Sam Toueg,et al. Randomized Byzantine Agreements , 1984, PODC '84.
[44] Leslie Lamport,et al. Paxos Made Simple , 2001 .
[45] Prateek Saxena,et al. A Secure Sharding Protocol For Open Blockchains , 2016, CCS.
[46] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[47] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[48] Haibin Zhang,et al. BEAT: Asynchronous BFT Made Practical , 2018, CCS.