Advertisement

Randomized agreement protocols

  • Michael Ben-Or
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 448)

Keywords

Correct 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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
  2. [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
  3. [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
  4. [CD]
    C. Chor and C. Dwork, Randomization in Byzantine Agreement, to appear.Google Scholar
  5. [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
  6. [F88]
    P. Feldman, Optimal Algorithms for Byzantine Agreement, MIT Ph.D. Thessis, 1988.Google Scholar
  7. [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
  8. [FLP83]
    M. Fischer, N. Lynch and M. Paterson, Impossibility of Distributed Consensus with One Faulty Process, JACM 32, pp. 374–382, 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [LF82]
    M. Fischer and N. Lynch, A Lower Bound for the Time to Assure Interactive Consistency, Information Processing Letters 14, pp. 183–186, 1982.zbMATHMathSciNetCrossRefGoogle Scholar
  10. [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
  11. [PSL80]
    M. Pease, R. Shostak and L. Lamport, Reaching Agreement in the Presence of Faults, JACM 27, pp. 228–234, 1980.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [PW72]
    W. W. Peterson and E. J. Weldon, Error Correcting Codes, Second Ed., MIT Press, 1972.Google Scholar
  13. [Ra83]
    M. Rabin, Randomized Byzantine Generals, Proc. 24th Annual Symposium on Foundations of Computer Science, pp. 403–409, 1983.Google Scholar
  14. [Sh79]
    A. Shamir, How to Share a Secret, CACM 22, pp. 612–613, 1979.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Michael Ben-Or
    • 1
  1. 1.Institute of Mathematics and Computer ScienceThe Hebrew UniversityJerusalemIsrael

Personalised recommendations