skip to main content
article
Open Access

The Byzantine Generals Problem

Authors Info & Claims
Published:01 July 1982Publication History
First page image

References

  1. 1 DIFFIE, W., AND HELLMAN, M.E. New directions in cryptography. IEEE Trans. Inf. Theory IT-22 (Nov. 1976), 644-654.Google ScholarGoogle Scholar
  2. 2 DOLEV, D. The Byzantine generals strike again. J. Algorithms 3, I (Jan. 1982).Google ScholarGoogle Scholar
  3. 3 PEASE, M., SHOSTAK, R., AND LAMPORT, L. Reaching agreement in the presence of faults. J. ACM 27, 2 (Apr. 1980), 228-234. Google ScholarGoogle Scholar
  4. 4 RIVEST, R.L., SHAMIR, A., AND ADLEMAN, L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (Feb. 1978), 120-126. Google ScholarGoogle Scholar

Index Terms

  1. The Byzantine Generals Problem

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Programming Languages and Systems
            ACM Transactions on Programming Languages and Systems  Volume 4, Issue 3
            July 1982
            199 pages
            ISSN:0164-0925
            EISSN:1558-4593
            DOI:10.1145/357172
            Issue’s Table of Contents

            Copyright © 1982 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 July 1982
            Published in toplas Volume 4, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader