Simple constant-time consensus protocols in realistic failure models (extended abstract)

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1985, Pages 152-162

  Chor, Benny ^a   Merritt, Michael ^a,b   Shmoys, David B ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CONSENSUS PROTOCOLS; CONSTANT TIME; EXPECTED TIME; EXTENDED ABSTRACTS; FAILURE MODEL; LOWER BOUNDS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947960569     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/323596.323610     Document Type: Conference Paper

References (19)

1. [ABCGM] B. Awerbuch, M. Blum, B. Chor, S. Goldwasser, and S. Micali, "How to Implement Bracha's 0(log n) Byzantine Agreement Algorithm", unpublished manuscript, MIT.
2. [ACGS] W. Alcxi, B. Chor, O. Goldreich, and C.P. Schnorr, "RSA/Rabin Bits Are + poiy{\OSN) Secure"> Proc- 25lh Annual Symposium on Foundations of Computer Science (1984), pp. 449-457.
3. [Be] M. Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols", Proc. 2nd Annual ACM Symposium on Principles of Distributed, Computing (1983), pp. 27-30.
4. [Br] G. Bracha, "An (lg n) Expected Rounds Randomized Byzantine Generals Algorithm", Proc. 17th Annual ACM Symposium on Theory of Computing (1985), pp. 316-326.
5. [BT] G. Bracha and S. Toueg, "Resilient Consensus Protocols", Proc. 2nd Annual ACM Symposium on Principles of Distributed Computing (1983).
6. [CC] B. Chor and B. Coan, "A Simple and Efficient Randomized Byzantine Agreement Algorithm", Proc. 4th Symposium on Reliability m Distributed Software and Database Systems (1984), pp. 98-106. To appear in IEEE Transactions on Software Engineering.
7. [DS] D. Dolev and H. R. Strong, "Polynomial Algorithms for Multiple Processor Agreement", Proc. 14th Annual ACM Symposium on Theory of Computing (1982), pp. 401-407.
8. [FLP] M.J. Fischer, N.A. Lynch, and M.S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process", Proc. 2nd ACM Symposium on Database Systems (1983), pp. 1.
9. [GM] S. Goldwasser and S. Micali, "Probabilistic Encryption", Jour, of Computer and System Sciences, 28(2) (1984), pp. 270-299.
10. [GMR] S. Goldwasser, S. Micali, and C. Rackoff, "The Knowledge Complexity of Interactive Proof", Proc. 17th Annual ACM Symposium on Theory of Computing (1985), pp. 291-304.
11. [KY] A.R. Karlin and A.C. Yao, "Probabilistic Lower Bounds for Byzantine Agreement and Clock Synchronization", unpublished manuscript, Stanford University.
12. [LSP] L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem", ACM Transactions on Programming Languages and Systems 4(3) (1982), pp. 382-401.
13. [PSL] M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults" JACM 27(2) (1980) pp. 228-234.
14. [Pi] S. Pinter, Distributed Computation Systems, Ph.D. thesis, Boston University, (1983).
15. [Ra] M.O. Rabin, "Randomized Byzantine Generals", Proc. 24th Annual Symposium on Foundations of Computer Science (1983), pp. 403-409.
16. [Ro] E. C. Rosen, "Vulnerability of Network Control Protocols: An Example" ACM SIGSOFT Software Engineering Notes, 6(1) (1981), pp. 6-8.
17. [TC] R. Turpin and B. Coan, "Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement, Information Processing Letters 18(2) (1984), pp. 73-76.
18. [Yl] A.C. Yao, "Theory and Applications of Trapdoor Functions", Proc. of the 23rd IEEE Symposium on Foundations of Computer Science, (1982), pp. 80-91.
19. [Y2] A.C. Yao, private communication.