This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ben-Or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proc. 2nd Annual ACM Symposium on Principles of Distributed Computing, pp. 27–30, 1983.
M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Computation, Proc. 20th Annual ACM Symposium on Theory of Computing, pp. 1–10, 1988.
G. Bracha, An Asynchronous (n−1)/3-Resilient Consensus Protocol, Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 154–162, 1984.
C. Chor and C. Dwork, Randomization in Byzantine Agreement, to appear.
D. Dolev and R. Strong, Polynomial Algorithms for Multiple Processor Agreement, Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 401–407, 1982.
P. Feldman, Optimal Algorithms for Byzantine Agreement, MIT Ph.D. Thessis, 1988.
P. Feldman and S. Micali, Optimal Algorithms for Byzantine Agreement, Proc. 20th Annual ACM Symposium on Theory of Computing, pp. 148–161, 1988.
M. Fischer, N. Lynch and M. Paterson, Impossibility of Distributed Consensus with One Faulty Process, JACM 32, pp. 374–382, 1985.
M. Fischer and N. Lynch, A Lower Bound for the Time to Assure Interactive Consistency, Information Processing Letters 14, pp. 183–186, 1982.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, Proc. 17th Annual ACM Symposium on Theory of Computing, pp. 291–304, 1985.
M. Pease, R. Shostak and L. Lamport, Reaching Agreement in the Presence of Faults, JACM 27, pp. 228–234, 1980.
W. W. Peterson and E. J. Weldon, Error Correcting Codes, Second Ed., MIT Press, 1972.
M. Rabin, Randomized Byzantine Generals, Proc. 24th Annual Symposium on Foundations of Computer Science, pp. 403–409, 1983.
A. Shamir, How to Share a Secret, CACM 22, pp. 612–613, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Or, M. (1990). Randomized agreement protocols. In: Simons, B., Spector, A. (eds) Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, vol 448. Springer, New York, NY. https://doi.org/10.1007/BFb0042326
Download citation
DOI: https://doi.org/10.1007/BFb0042326
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97385-2
Online ISBN: 978-0-387-34812-4
eBook Packages: Springer Book Archive