Dfinity Consensus, Explored
暂无分享,去创建一个
Kartik Nayak | Ittai Abraham | Dahlia Malkhi | Ling Ren | Kartik Nayak | D. Malkhi | Ling Ren | Ittai Abraham
[1] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[2] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[3] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[4] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[5] Dominic Williams,et al. DFINITY Technology Overview Series, Consensus System , 2018, ArXiv.
[6] Kartik Nayak,et al. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience , 2019, IACR Cryptol. ePrint Arch..
[7] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[8] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[10] Kartik Nayak,et al. Efficient Synchronous Byzantine Consensus , 2017, 1704.02397.
[11] Jonathan Katz,et al. On Expected Constant-Round Protocols for Byzantine Agreement , 2006, CRYPTO.
[12] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.