On the Optimality of Optimistic Responsiveness
暂无分享,去创建一个
Kartik Nayak | Ling Ren | Ittai Abraham | Nibesh Shrestha | Kartik Nayak | Ling Ren | Ittai Abraham | Nibesh Shrestha
[1] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[2] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[3] Elaine Shi,et al. PiLi: An Extremely Simple Synchronous Blockchain , 2018, IACR Cryptol. ePrint Arch..
[4] Matthias Fitzi,et al. Efficient player-optimal protocols for strong and differential consensus , 2003, PODC '03.
[5] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[6] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[7] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[8] Kartik Nayak,et al. Sync HotStuff: Simple and Practical Synchronous State Machine Replication , 2020, 2020 IEEE Symposium on Security and Privacy (SP).
[9] Jason Paul Cruz,et al. Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience , 2020, IACR Cryptol. ePrint Arch..
[10] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[11] Benny Pinkas,et al. SBFT: A Scalable and Decentralized Trust Infrastructure , 2018, 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).
[12] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[13] Elaine Shi,et al. Thunderella: Blockchains with Optimistic Instant Confirmation , 2018, IACR Cryptol. ePrint Arch..
[14] Elaine Shi,et al. PaLa: A Simple Partially Synchronous Blockchain , 2018, IACR Cryptol. ePrint Arch..
[15] Jonathan Katz,et al. On expected constant-round protocols for Byzantine agreement , 2006, J. Comput. Syst. Sci..
[16] Benny Pinkas,et al. SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains , 2018, ArXiv.
[17] Ittai Abraham,et al. HotStuff: BFT Consensus with Linearity and Responsiveness , 2019, PODC.
[18] Danny Dolev,et al. Early stopping in Byzantine agreement , 1990, JACM.
[19] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[20] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[21] Kartik Nayak,et al. Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication , 2020, ArXiv.
[22] Jae Kwon,et al. Tendermint : Consensus without Mining , 2014 .
[23] Elaine Shi,et al. Streamlined Blockchains: A Simple and Elegant Approach (A Tutorial and Survey) , 2019, ASIACRYPT.
[24] Satoshi Nakamoto. Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .
[25] Elaine Shi,et al. PiLi : A Simple , Fast , and Robust Family of Blockchain Protocols ∗ , 2019 .
[26] Dominic Williams,et al. DFINITY Technology Overview Series, Consensus System , 2018, ArXiv.
[27] Kartik Nayak,et al. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience , 2019, IACR Cryptol. ePrint Arch..
[28] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[29] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[30] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.