暂无分享,去创建一个
[1] Piotr Berman,et al. Bit optimal distributed consensus , 1992 .
[2] Christian Hanser,et al. Revisiting Cryptographic Accumulators, Additional Properties and Relations to other Primitives , 2015, IACR Cryptol. ePrint Arch..
[3] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[4] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[5] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.
[6] Kartik Nayak,et al. Communication complexity of byzantine agreement, revisited , 2018, Distributed Computing.
[7] Rafail Ostrovsky,et al. Information-Theoretic Broadcast with Dishonest Majority for Long Messages , 2018, IACR Cryptol. ePrint Arch..
[8] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[9] Nitin H. Vaidya,et al. Error-free multi-valued consensus with byzantine failures , 2011, PODC '11.
[10] Birgit Pfitzmann,et al. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.
[11] Arpita Patra,et al. Broadcast Extensions with Optimal Communication and Round Complexity , 2016, PODC.
[12] Ralph C. Merkle,et al. A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.
[13] Lan Nguyen,et al. Accumulators from Bilinear Pairings and Applications , 2005, CT-RSA.
[14] Matthias Fitzi,et al. Optimally efficient multi-valued byzantine agreement , 2006, PODC '06.
[15] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[16] Ittai Abraham,et al. Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication , 2018, ArXiv.
[17] Weimin Zheng,et al. When paxos meets erasure code: reduce network and storage cost in state machine replication , 2014, HPDC '14.
[18] Ran Canetti,et al. Asynchronous secure computation , 1993, STOC.
[19] Achour Mostéfaoui,et al. Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time , 2015, J. ACM.
[20] Zizhong Wang,et al. CRaft: An Erasure-coding-supported Version of Raft for Reducing Storage Cost and Network Cost , 2020, FAST.
[21] Arpita Patra,et al. Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity , 2011, OPODIS.
[22] Guiling Wang,et al. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited , 2020, IACR Cryptol. ePrint Arch..
[23] Ittai Abraham,et al. Asymptotically Optimal Validated Asynchronous Byzantine Agreement , 2019, PODC.
[24] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[25] Arpita Patra,et al. Optimal extension protocols for byzantine broadcast and agreement , 2020, Distributed Computing.
[26] Haibin Zhang,et al. BEAT: Asynchronous BFT Made Practical , 2018, CCS.
[27] Ian Goldberg,et al. Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.
[28] Birgit Pfitzmann,et al. Information-Theoretic Pseudosignatures and Byzantine Agreement for t ≥ n/3 , 2007 .
[29] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[30] Razvan Barbulescu,et al. Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case , 2016, CRYPTO.
[31] Norbert Blum,et al. A New Approach to Maximum Matching in General Graphs , 1990, ICALP.
[32] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[33] F. Moore,et al. Polynomial Codes Over Certain Finite Fields , 2017 .
[34] Stefano Tessaro,et al. Asynchronous verifiable information dispersal , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).
[35] Gabriel Bracha,et al. Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..
[36] Victor Shoup,et al. Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.