Fast quantum byzantine agreement
暂无分享,去创建一个
[1] James Aspnes,et al. Lower bounds for distributed coin-flipping and randomized consensus , 1997, STOC '97.
[2] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[3] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[4] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[5] Ziv Bar-Joseph,et al. A tight lower bound for randomized synchronous consensus , 1998, PODC '98.
[6] David B. Shmoys,et al. Simple constant-time consensus protocols in realistic failure models , 1989, JACM.
[7] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[8] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[9] Brian A. Coan,et al. A Simple and Efficient Randomized Byzantine Agreement Algorithm , 1985, IEEE Transactions on Software Engineering.
[10] Adam D. Smith,et al. Secure multi-party quantum computation , 2002, STOC '02.
[11] Yoram Moses,et al. Fully polynomial Byzantine agreement in t + 1 rounds , 1993, STOC.
[12] David B. Shmoys,et al. Flipping Persuasively in Constant Time , 1990, SIAM J. Comput..
[13] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[14] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[15] Dorit Aharonov,et al. Fault-tolerant quantum computation with constant error , 1997, STOC '97.
[16] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.