Synchronous Consensus with Optimal Asynchronous Fallback Guarantees
暂无分享,去创建一个
[1] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[2] John K. Ousterhout,et al. In Search of an Understandable Consensus Algorithm , 2014, USENIX Annual Technical Conference.
[3] Yehuda Lindell,et al. Secure Multi-Party Computation without Agreement , 2005, Journal of Cryptology.
[4] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[5] Danny Dolev,et al. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience , 2008, PODC '08.
[6] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[7] Kartik Nayak,et al. Flexible Byzantine Fault Tolerance , 2019, CCS.
[8] Elaine Shi,et al. Thunderella: Blockchains with Optimistic Instant Confirmation , 2018, IACR Cryptol. ePrint Arch..
[9] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[10] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[11] 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.
[12] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[13] Martin Hirt,et al. On the theoretical gap between synchronous and asynchronous MPC protocols , 2010, PODC '10.
[14] Klaus Kursawe,et al. Optimistic Byzantine agreement , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..
[15] Arpita Patra,et al. On the Power of Hybrid Networks in Multi-Party Computation , 2018, IEEE Transactions on Information Theory.
[16] Ueli Maurer,et al. Robust MPC: Asynchronous Responsiveness yet Synchronous Security , 2019, IACR Cryptol. ePrint Arch..
[17] Ivan Damgård,et al. Asynchronous Multiparty Computation: Theory and Implementation , 2008, IACR Cryptol. ePrint Arch..
[18] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[19] C. Pandu Rangan,et al. Simple and efficient asynchronous byzantine agreement with optimal resilience , 2009, PODC '09.
[20] Jonathan Katz,et al. Adaptively secure broadcast, revisited , 2011, PODC '11.
[21] Elaine Shi,et al. Synchronous, with a Chance of Partition Tolerance , 2019, IACR Cryptol. ePrint Arch..
[22] Matthias Fitzi,et al. Two-Threshold Broadcast and Detectable Multi-party Computation , 2003, EUROCRYPT.
[23] Matthias Fitzi,et al. On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement , 2009, DISC.
[24] Sam Toueg,et al. Randomized Byzantine Agreements , 1984, PODC '84.
[25] Ethan Heilman,et al. Eclipse Attacks on Bitcoin's Peer-to-Peer Network , 2015, USENIX Security Symposium.
[26] Ramakrishna Kotla,et al. Zyzzyva: speculative byzantine fault tolerance , 2007, TOCS.
[27] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[28] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.
[29] Jonathan Katz,et al. On Expected Constant-Round Protocols for Byzantine Agreement , 2006, CRYPTO.
[30] Tal Moran,et al. Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds , 2018, IACR Cryptol. ePrint Arch..
[31] Dominic Williams,et al. DFINITY Technology Overview Series, Consensus System , 2018, ArXiv.
[32] Kartik Nayak,et al. Sync HotStuff: Simple and Practical Synchronous State Machine Replication , 2020, 2020 IEEE Symposium on Security and Privacy (SP).
[33] Martin Hirt,et al. Adaptively Secure Broadcast , 2010, EUROCRYPT.
[34] Marko Vukolic,et al. XFT: Practical Fault Tolerance beyond Crashes , 2015, OSDI.
[35] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[36] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.