All You Need is DAG
暂无分享,去创建一个
Idit Keidar | Alexander Spiegelman | Eleftherios Kokoris-Kogias | Oded Naor | A. Spiegelman | I. Keidar | Eleftherios Kokoris-Kogias | O. Naor
[1] Guiling Wang,et al. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited , 2020, IACR Cryptol. ePrint Arch..
[2] Adi Shamir,et al. How to share a secret , 1979, CACM.
[3] Miguel Correia,et al. From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures , 2006, Comput. J..
[4] Ittai Abraham,et al. HotStuff: BFT Consensus with Linearity and Responsiveness , 2019, PODC.
[5] Stephen P. Boyd,et al. Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.
[6] Victor Shoup,et al. Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.
[7] Idit Keidar,et al. Brahms: byzantine resilient random membership sampling , 2008, PODC '08.
[8] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[9] Louise E. Moser,et al. The SecureRing group communication system , 2001, TSEC.
[10] Michael K. Reiter,et al. Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.
[11] Idit Keidar,et al. FairLedger: A Fair Blockchain Protocol for Financial Institutions , 2019, OPODIS.
[12] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[13] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[14] Allan Borodin,et al. On the power of randomization in on-line algorithms , 2005, Algorithmica.
[15] Gabriel Bracha,et al. Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..
[16] Bruce M. Kapron,et al. Fast asynchronous byzantine agreement and leader election with full information , 2008, SODA '08.
[17] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[18] Victor Shoup,et al. Practical Threshold Signatures , 2000, EUROCRYPT.
[19] Ari Juels,et al. Order-Fairness for Byzantine Consensus , 2020, IACR Cryptol. ePrint Arch..
[20] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[21] Tal Moran,et al. Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds , 2018, IACR Cryptol. ePrint Arch..
[22] Danny Dolev,et al. Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs , 2016, ArXiv.
[23] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[24] Ran Canetti,et al. Studies in secure multiparty computation and applications , 1995 .
[25] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..
[26] Ashish Choudhury,et al. Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited , 2018, IACR Cryptol. ePrint Arch..
[27] Ran El-Yaniv,et al. Resilient-optimal interactive consistency in constant time , 2003, Distributed Computing.
[28] Rachid Guerraoui,et al. Introduction to Reliable and Secure Distributed Programming , 2011 .
[29] Rachid Guerraoui,et al. Abstractions for devising Byzantine-resilient state machine replication , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.
[30] Dahlia Malkhi,et al. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. , 2020, CCS.
[31] Danny Dolev,et al. An adaptive totally ordered multicast protocol that tolerates partitions , 1998, PODC '98.
[32] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[33] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[34] Marko Vukolic,et al. Hyperledger fabric: a distributed operating system for permissioned blockchains , 2018, EuroSys.
[35] Damian Lesniak,et al. Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes , 2019, AFT.
[36] Ittai Abraham,et al. Asymptotically Optimal Validated Asynchronous Byzantine Agreement , 2019, PODC.
[37] Hans-Peter Seidel,et al. Image-based reconstruction of spatial appearance and geometric detail , 2003, TOGS.
[38] Stefano Tessaro,et al. Asynchronous verifiable information dispersal , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).
[39] C. Pandu Rangan,et al. Asynchronous Byzantine Agreement with optimal resilience , 2014, Distributed Computing.
[40] Danny Dolev,et al. Early delivery totally ordered multicast in asynchronous environments , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.
[41] Chen-Da Liu Zhang,et al. Asynchronous Byzantine Agreement with Subquadratic Communication , 2020, IACR Cryptol. ePrint Arch..
[42] S. Nakamoto,et al. Bitcoin: A Peer-to-Peer Electronic Cash System , 2008 .
[43] Moti Yung,et al. Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares , 2016, Theor. Comput. Sci..
[44] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.