Fast asynchronous Byzantine agreement with optimal resilience
暂无分享,去创建一个
[1] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[2] Michael J. Fischer,et al. The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.
[3] Brian A. Coan,et al. A Simple and Efficient Randomized Byzantine Agreement Algorithm , 1985, IEEE Transactions on Software Engineering.
[4] Silvio Micali,et al. Byzantine agreement in constant expected time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[5] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[6] Nancy A. Lynch,et al. An introduction to input/output automata , 1989 .
[7] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[8] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[9] Tal Rabin,et al. Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.
[10] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[11] J FischerMichael,et al. Efficiency of Synchronous Versus Asynchronous Distributed Systems , 1983 .
[12] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[13] Cynthia Dwork,et al. Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..
[14] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[15] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[16] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[17] Nancy A. Lynch,et al. Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..
[18] Yoram Moses,et al. Fully polynomial Byzantine agreement in t + 1 rounds , 1993, STOC.
[19] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[20] Ran Canetti,et al. Asynchronous secure computation , 1993, STOC.
[21] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[22] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[23] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[24] Adi Shamir,et al. How to share a secret , 1979, CACM.