暂无分享,去创建一个
Kartik Nayak | Srinivas Devadas | Ittai Abraham | Ling Ren | Kartik Nayak | S. Devadas | Ling Ren | Ittai Abraham
[1] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[2] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[3] Barbara Liskov,et al. Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems , 1999, PODC '88.
[4] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[5] Miguel Castro,et al. Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OPSR.
[6] Dan S. Wallach,et al. Enforcing Fair Sharing of Peer-to-Peer Resources , 2003, IPTPS.
[7] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[8] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.
[9] Gabriel Bracha,et al. Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..
[10] Arun Venkataramani,et al. Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.
[11] Kartik Nayak,et al. Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus , 2016, ArXiv.
[12] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[13] Yoram Moses,et al. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..
[14] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[15] Alfred Menezes,et al. The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.
[16] Yehuda Lindell,et al. Sequential composition of protocols without simultaneous termination , 2002, PODC '02.
[17] Jonathan Katz,et al. On expected constant-round protocols for Byzantine agreement , 2006, J. Comput. Syst. Sci..
[18] Scott Shenker,et al. Attested append-only memory: making adversaries stick to their word , 2007, SOSP.
[19] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[20] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[21] Matthew K. Franklin,et al. The Ω key management service , 1996, CCS '96.
[22] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[23] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[24] Ramakrishna Kotla,et al. High throughput Byzantine fault tolerance , 2004, International Conference on Dependable Systems and Networks, 2004.
[25] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[26] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[27] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[28] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[29] Michael K. Reiter,et al. Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.
[30] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[31] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.
[32] Silvio Micali,et al. ALGORAND: The Efficient and Democratic Ledger , 2016, ArXiv.
[33] Miguel Correia,et al. How to tolerate half less one Byzantine nodes in practical distributed systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..
[34] Miguel Castro,et al. Using abstraction to improve fault tolerance , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.
[35] Miguel Castro,et al. BASE: using abstraction to improve fault tolerance , 2001, SOSP.
[36] Robbert van Renesse,et al. COCA: a secure distributed online certification authority , 2002, Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems].
[37] Liuba Shrira,et al. HQ replication: a hybrid quorum protocol for byzantine fault tolerance , 2006, OSDI '06.
[38] Marko Vukolic,et al. XFT: Practical Fault Tolerance beyond Crashes , 2015, OSDI.
[39] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[40] Bryan Ford,et al. Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing , 2016, USENIX Security Symposium.
[41] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[42] Silvio Micali,et al. How to play any mental game, or a completeness theorem for protocols with honest majority , 2019, Providing Sound Foundations for Cryptography.