Fast quantum byzantine agreement

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 481-485

  Ben Or, Michael ^a,b   Hassidim, Avinatan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Department of Computer Science ^*  (Israel)

Author keywords

Byzantine Agreement; Quantum Computation

Indexed keywords

ASYNCHRONOUS SYSTEMS; BYZANTINE AGREEMENT; QUANTUM COMPUTATION;

ASYNCHRONOUS MACHINERY; COMPUTATION THEORY; INFORMATION ANALYSIS;

QUANTUM THEORY;

EID: 34848827464     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060662     Document Type: Conference Paper

References (16)

1. D. Aharonov and M. Ben-Or, "Fault tolerant quantum computation with constant error rate," quantph/9906129. Preliminary version in STOC '97. Submitted to SIAM J. Comp., June 1999.
2. J. Aspnes, "Lower bounds for distributed coin-flipping and randomized consensus", Journal of the ACM 45(3):415-450, May 1998.
3. Ziv Bar-Joseph and Michael Ben-Or, "A Tight Lower Bound for Randomized Synchronous Computing," proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, pp. 193-199, 1998.
4. M. Ben-Or. "Another advantage of free choice: Completely asynchronous agreement protocols." In In Proceedings of the end Annual ACM Symposium on the Principles of Distributed Computing, pp. 27-30, 1983.
5. M. Ben-Or and E. Pavlov, unpublished manuscript.
6. Gabriel Bracha, "An asynchronous [(n - 1)/3]-resilient consensus protocol," In Proceedings of the third annual A CM symposium on Principles of distributed computing , JACM, pp. 154-162, 1984.
7. Ran Canetti and Tal Rabin, "Fast asynchronous Byzantine agreement with optimal resilience." STOC 1993: 42-51.
8. Benny Chor and Brian A. Coan, "A Simple and Efficient Randomized Byzantine Agreement Algorithm." IEEE Trans. Software Eng. 11(6): 531-539, 1985.
9. Benny Chor, Michael Meritt and David B. Shmoys, "Simple Constant Time Consensus Protocols In Realistic Failure Models" Journal of the ACM, vol. 36, no. 3, pp. 591-614, Jan. 1989.
10. Claude Crépeau, Daniel Gottesman and Adam Smith, "Secure Multi-party Quantum Computation," In 34th ACM Symposium on the Theory of Computing, STOC, pp. 643-652, 2002.
11. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer, "Flipping Persuasively in Constant Time," SIAM J. Comput. 19(3): 472-499 (1990)
12. P. Feldman and S. Micali, "An Optimal Protocol for Synchronous Byzantine Agreement," SIAM Journal of Computing, vol. 26, pp. 873-933, 1997.
13. J. A. Garay and Y. Moses, "Fully Polynomial Byzantine agreement in t + 1 rounds.," In Proceedings of th 25th Annual ACM Symposyum on Theory of Computing, ACM, pp. 31-41, 1993.
14. Nancy A. Lynch, Distributed Algorithms, Morgan Kaufman, 1996.
15. M. Pease , R. Shostak , L. Lamport, "Reaching Agreement in the Presence of Faults", Journal of the ACM (JACM), v.27 n.2, p.228-234, April 1980
16. M. O. Rabin, "Randomized Byzantine Generals," In Proceedings of the 24th Annual IEEE Symposyum on the Foundations of Computer Science, IEEE, pp. 403-409, 1983.