Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
暂无分享,去创建一个
[1] Danny Dolev,et al. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience , 2008, PODC '08.
[2] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[3] C. Pandu Rangan,et al. The Round Complexity of Verifiable Secret Sharing Revisited , 2009, CRYPTO.
[4] Ran Canetti,et al. Studies in secure multiparty computation and applications , 1995 .
[5] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[6] 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).
[7] C. Pandu Rangan,et al. Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience , 2009, IACR Cryptol. ePrint Arch..
[8] C. Pandu Rangan,et al. Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience , 2009, ICITS.
[9] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[10] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[11] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[12] Matthias Fitzi,et al. Generalized communication and security models in Byzantine agreement , 2002 .
[13] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[14] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[15] Silvio Micali,et al. An Optimal Algorithm for Synchronous Byzantine Agreement , 1997 .
[16] C. Pandu Rangan,et al. Efficient Asynchronous Byzantine Agreement with Optimal Resilience , 2008, IACR Cryptol. ePrint Arch..
[17] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[18] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[19] C. Pandu Rangan,et al. Simple and efficient asynchronous byzantine agreement with optimal resilience , 2009, PODC '09.
[20] Birgit Pfitzmann,et al. Unconditional Byzantine Agreement for any Number of Faulty Processors , 1992, STACS.
[21] K. Srinathan,et al. Trading Players for Efficiency in Unconditional Multiparty Computation , 2002, SCN.
[22] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[23] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[24] Tal Rabin,et al. Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.
[25] Matthias Fitzi,et al. Optimally efficient multi-valued byzantine agreement , 2006, PODC '06.
[26] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[27] Brian A. Coan,et al. Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement , 1984, Inf. Process. Lett..
[28] C. Pandu Rangan,et al. Communication Optimal Multi-valued Asynchronous Broadcast Protocol , 2010, LATINCRYPT.
[29] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[30] Ueli Maurer,et al. Efficient Secure Multi-party Computation , 2000, ASIACRYPT.
[31] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..