Byzantine agreement in polynomial expected time: [extended abstract]
暂无分享,去创建一个
[1] Jared Saia,et al. Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary , 2010, PODC.
[2] Bruce M. Kapron,et al. Fast asynchronous byzantine agreement and leader election with full information , 2008, SODA '08.
[3] Gabriel Bracha,et al. Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..
[4] Hagit Attiya,et al. Lower bounds for randomized consensus under a weak adversary , 2008, PODC '08.
[5] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[6] Hagit Attiya,et al. Tight bounds for asynchronous randomized consensus , 2007, STOC '07.
[7] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..
[8] Silvio Micali,et al. Byzantine Agreement in Constant Expected Time (and Trusting No One) , 1985, FOCS 1985.
[9] Cynthia Dwork,et al. Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..
[10] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[11] James Aspnes,et al. Lower bounds for distributed coin-flipping and randomized consensus , 1997, STOC '97.
[12] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[13] Maurice Herlihy,et al. Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.
[14] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[15] Silvio Micali,et al. Byzantine agreement in constant expected time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[16] Vinod Vaikuntanathan,et al. Byzantine agreement in the full-information model in O(log n) rounds , 2006, STOC '06.
[17] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[18] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[19] Allison Lewko. The contest between simplicity and efficiency in asynchronous byzantine agreement , 2011, DISC 2011.
[20] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[21] James Aspnes,et al. Randomized protocols for asynchronous consensus , 2002, Distributed Computing.