Randomized agreement protocols
Part of the Lecture Notes in Computer Science book series (LNCS, volume 448)
KeywordsCorrect Process Threshold Scheme Adversary Model Communication Round Faulty Process
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [Be83]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.Google Scholar
- [BGW88]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.Google Scholar
- [Br84]G. Bracha, An Asynchronous (n−1)/3-Resilient Consensus Protocol, Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 154–162, 1984.Google Scholar
- [CD]C. Chor and C. Dwork, Randomization in Byzantine Agreement, to appear.Google Scholar
- [DS82]D. Dolev and R. Strong, Polynomial Algorithms for Multiple Processor Agreement, Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 401–407, 1982.Google Scholar
- [F88]P. Feldman, Optimal Algorithms for Byzantine Agreement, MIT Ph.D. Thessis, 1988.Google Scholar
- [FM88]P. Feldman and S. Micali, Optimal Algorithms for Byzantine Agreement, Proc. 20th Annual ACM Symposium on Theory of Computing, pp. 148–161, 1988.Google Scholar
- [GMR85]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.Google Scholar
- [PW72]W. W. Peterson and E. J. Weldon, Error Correcting Codes, Second Ed., MIT Press, 1972.Google Scholar
- [Ra83]M. Rabin, Randomized Byzantine Generals, Proc. 24th Annual Symposium on Foundations of Computer Science, pp. 403–409, 1983.Google Scholar
© Springer-Verlag Berlin Heidelberg 1990