From the Academy. In the article “Security and privacy in the information economy” by Joan Feigenbaum, Steven Rudich, Matt Blaze, and Kevin McCurley, which appeared in number 7, April 1, 1997, of Proc. Natl. Acad. Sci. USA (94, 2789–2792), the authors wish to point out a printer’s error. The annotations to the bibliographic material, which were omitted on the page proof, were reinserted incorrectly prior to publication. The full text with correct annotations is shown below.
References
- 1.Luby M. Pseudorandomness and Cryptographic Applications. Princeton, NJ: Princeton Univ. Press; 1996. . (Highly mathematically rigorous treatment of much of the theory of security and privacy. Accessible only to specialists in the theory of computation. Excellent as a reference book or as a textbook for an advanced course.) [Google Scholar]
- 2.Diffie W, Hellman M. IEEE Transactions on Information Theory. IT-22. Seminal research paper that establishes the foundations of public-key cryptography. Accessible primarily to computer scientists but possibly to computer scientifically aware people in other fields.; 1976. pp. 644–654. [Google Scholar]
- 3.Merkle R. Commun Assoc Computing Machinery. 1978;21:294–299. . (Seminal research paper that establishes the foundations of public-key cryptography. Accessible primarily to computer scientists but possibly to computer scientifically aware people in other fields.) [Google Scholar]
- 4.Brassard G. Modern Cryptography: A Tutorial, Lecture Notes in Computer Science. Vol. 325. Berlin: Springer; 1988. . (Dated but well written introduction to the theory of security and privacy, accessible to computer scientifically aware nonspecialists.) [Google Scholar]
- 5.Simmons G, editor. Contemporary Cryptology: The Science of Information Integrity. New York: IEEE Press; 1992. . (Collection of survey papers on many aspects of cryptology and its applications. Long introduction, some of which is suitable for nonspecialists, some only for specialists.) [Google Scholar]
- 6.Stinson D. Cryptography: Theory and Practice. Boca Raton, FL: CRC Press; 1995. . (Introductory textbook intended for advanced undergraduate or beginning graduate courses.) [Google Scholar]
- 7.Landau S. Notices Am Math Soc. 1983;30:7–10. . (Article about the Rivest–Shamir–Adleman (RSA) public-key cryptosystem and the controversy that surrounded its invention. Accessible to scientifically educated nonspecialists.) [Google Scholar]
- 8.Landau S. Notices Am Math Soc. 1988;35:5–12. . (Introduction to the notion of “zero-knowledge proof system,” put forth by Goldwasser, Micali, and Rackoff, in which a “prover” and “verifier” exchange messages; the prover convinces the verifier that a string x is in a set S, and the verifier “learns,” in a precise technical sense, nothing but this one bit of information. The article also discusses the practically important variant called “zero-knowledge proofs of identity,” put forth by Fiat and Shamir, and the controversy that surrounded its invention. Accessible to scientifically educated nonspecialists.) [Google Scholar]
- 9.Shor P. Proceedings of the 35th Symposium on Foundations of Computer Science. Los Alamitos, CA: IEEE Computer Soc. Press; 1994. pp. 124–134. . (Breakthrough research paper, accessible only to specialists in the theory of computation.) [Google Scholar]
- 10.Bennett C, Brassard G, Ekert A. Sci Am. 1992;266:50–57. . (Survey article accessible to scientifically educated nonspecialists.) [Google Scholar]