An O(log n) Expected Rounds Randomized Byzantine Generals Protocol

Journal of the ACM (JACM)

Volumn 34, Issue 4, 1987, Pages 910-920

  Bracha, Gabriel ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Byzantine Generals algorithms; consensus protocols; distributed algorithms; fault tolerance; parallel algorithms

Indexed keywords

COMPUTER NETWORKS - PROTOCOLS; COMPUTER PROGRAMMING - ALGORITHMS; CRYPTOGRAPHY;

CONSENSUS PROTOCOLS; DISTRIBUTED ALGORITHMS; PARALLEL ALGORITHMS; RANDOMIZED BYZANTINE GENERALS PROTOCOL;

COMPUTER SYSTEMS, DIGITAL;

EID: 0023436302     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/31846.42229     Document Type: Article

References (20)

1. Awerbach, B., Blum, M., Chor, B., Goldwasser, S., and Micali, S. Implementing Bracha’s O(log n) Byzantine agreement algorithm. Unpublished manuscript.
2. Ben-Or, M. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (Montreal, Quebec, Canada, Aug. 17-19). ACM, New York, 1983.
3. Ben-Or, M. Fast asynchronous Byzantine agreement. In Proceedings of the 4th ACM Symposium on Principles of Distributed Computing (Minaki, Ontario, Canada, Aug. 5-7). ACM, New York, 1985.
4. Bracha, G. An n/3 resilient consensus protocol. In Proceedings of the 3rd Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 27-29). ACM, New York, 1984, pp. 154–162.
5. Bracha, G. An O(log n) expected rounds randomized Byzantine General protocol. In Proceedings of the 17th Annual ACM Symposium on Theory ofComputing (Providence, R.I., May 6-9). ACM, New York, 1985, pp. 316–326.
6. Bracha, G., and Toueg, S. Resilient consensus protocols. In Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (Montreal, Quebec, Canada, Aug. 17-19). ACM, New York, 1983, pp. 12–23.
7. Broder, A. Z., and Dolev, D. Flipping coins in many pockets. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science (Singer Island, Fla., Oct.). IEEE, New York, 1984, pp. 157–170.
8. Chernoff, H. A measure of asymptotic efficiency for tests of hypotheses based on the sums of observations. Ann. Math. Stat. 23, (1952).
9. Chor, B., and Coan, B. A simple and efficient randomized Byzantine agreement algorithm. In Proceedings of the 4th Symposium on Reliability in Distributed Software and Database Systems (Silver Spring, Md., Oct.). 1984, pp. 98–106.
10. Dolev, D. Unanimity in an unknown and unreliable environment. In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (Nashville, Tenn., Oct.). IEEE, New York, 1981, pp. 159–168.
11. Dolev, D. Polynomial algorithm for multiple process agreement. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif., May). ACM, New York, 1982, pp. 404–407.
12. Dolev, D. The Byzantine Generals strike again. J. Algorithms 3, 1 (Apr. 1983), 14–30.
13. Fischer, M. J., and Lynch, N. A. A lower bound on the time to assure interactive consistency. Inf. Process. Lett. 14, 4 (May 1982), 183–186.
14. Hastad, J. On using RSA with low exponent in a public key network. MIT, Cambridge, Mass. To be published.
15. Lamport, L., and Fischer, M. Byzantine Generals and Transaction Commit protocols. Opus 62, SRI International, Menlo Park, Calif., Apr. 1982.
16. Lamport, L., Shostak, R., and Pease, M. The Byzantine Generals problem. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982), 382–401.
17. Rabin, M. Randomized Byzantine Generals. In Proceedings of the 24th Symposium on Foundations of Computer Science (Tucson, Ariz., Nov.). IEEE, New York, 1983, pp. 403–409.
18. Rivest, R., Shamir, A., and Adleman, L. A method for obtaining digital signatures and Public-Key cryptosystems. Commun. ACM 21, 2 (Feb. 1978), 120–126.
19. Shamir, A. How to share a secret. Commun. ACM 22, 11 (Nov. 1979), 612–613.
20. Yao, A. C. On the succession problem for Byzantine generals. Tech. Rep., Computer Science Dept., Stanford Univ., Stanford, Calif. To appear.