Sublinear-Round Byzantine Agreement Under Corrupt Majority
暂无分享,去创建一个
[1] Martin Hirt,et al. Adaptively Secure Broadcast , 2010, EUROCRYPT.
[2] Rafail Ostrovsky,et al. Round Complexity of Authenticated Broadcast with a Dishonest Majority , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[3] Aggelos Kiayias,et al. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.
[4] Elaine Shi,et al. Consensus through Herding , 2019, IACR Cryptol. ePrint Arch..
[5] Ravi Montenegro,et al. Near Optimal Bounds for Collision in Pollard Rho for Discrete Log , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Erik Vee,et al. Scalable leader election , 2006, SODA '06.
[7] Rafail Ostrovsky,et al. New Techniques for Noninteractive Zero-Knowledge , 2012, JACM.
[8] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[9] Kartik Nayak,et al. Communication complexity of byzantine agreement, revisited , 2018, Distributed Computing.
[10] Sandro Coretti,et al. Probabilistic Termination and Composability of Cryptographic Protocols , 2016, Journal of Cryptology.
[11] Kai-Min Chung,et al. Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs , 2015, CRYPTO.
[12] Rachid Guerraoui,et al. Fast byzantine agreement , 2013, PODC '13.
[13] Kartik Nayak,et al. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience , 2019, IACR Cryptol. ePrint Arch..
[14] Vinod Vaikuntanathan,et al. Fault-Tolerant Distributed Computing in Full-Information Networks , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[15] Jonathan Katz,et al. On expected constant-round protocols for Byzantine agreement , 2006, J. Comput. Syst. Sci..
[16] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[17] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[18] Matthias Fitzi,et al. On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement , 2009, DISC.
[19] Alex Samorodnitsky,et al. On the Round Complexity of Randomized Byzantine Agreement , 2019, IACR Cryptol. ePrint Arch..
[20] Jared Saia,et al. Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary , 2010, PODC.
[21] Bruce M. Kapron,et al. Fast asynchronous byzantine agreement and leader election with full information , 2008, SODA '08.
[22] Jonathan Katz,et al. Adaptively secure broadcast, revisited , 2011, PODC '11.
[23] Jared Saia,et al. Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary , 2010, JACM.
[24] Silvio Micali,et al. ALGORAND: The Efficient and Democratic Ledger , 2016, ArXiv.