Suggested Reading
Goldreich, O. Foundations of Cryptography: Basic Tools_._ New York, NY: Cambridge University Press, 2001. ISBN: 0521791723.
Bellare, M., and S. Goldwasser. Lecture Notes on Cryptography. August 2001.
Papers
Diffie, W., and M. E. Hellman. “New Directions in Cryptography.” IEEE Transactions in Information Theory 22, no. 6 (1976): 644-654.
Rivest, R. L., A. Shamir, and L. M. Adleman. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” Communications of the ACM 21, no. 2 (1978): 120-126. New York, NY: ACM Press. ISSN: 0001-0782.
Goldwasser, S., and S. Micali. “Probabilistic Encryption.” Journal of Computer and Systems Sciences 28, no. 2 (1984): 270-299. New York, NY: Academic Press.
Goldreich, O., S. Goldwasser, and S. Micali. “How to Construct Random Functions.” Journal of the ACM 33, no. 4 (1986): 792-807. New York, NY: ACM Press. ISSN: 0004-5411.
Goldwasser, S., S. Micali, and R. L. Rivest. “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks.” SIAM Journal on Computing 17, no. 2 (1998): 281-308. Philadelphia, PA: Society for Industrial and Applied Mathematics.
Naor, M. “Bit Commitment Using Pseudorandomness.” In Lecture Notes on Computer Science_._ Vol. 435. Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology. London, UK: Springer-Verlag, 1989, pp. 128-136. ISBN: 3540973176.
Merkle, R. C. “A Certified Digital Signature.” In Lecture Notes on Computer Science_._ Vol. 435. Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology. London, UK: Springer-Verlag, 1989, pp. 218-238. ISBN: 3540973176.
Micali, Silvio, Charles Rackoff, and Bob Sloan. “The Notion of Security for Probabilistic Cryptosystems.” SIAM Journal on Computing 17, no. 2 (1988): 412-426. Philadelphia, PA: Society for Industrial and Applied Mathematics.
Goldwasser, S., S. Micali, and C. Rackoff. “The Knowledge Complexity of Interactive Proof-Systems.” SIAM Journal on Computing 18, no. 1 (1989): 186-208. Philadelphia, PA: Society for Industrial and Applied Mathematics.
Goldreich, O., S. Micali, and A. Wigderson. “Proofs that Yield nothing but their Validity.” Journal of the ACM 38, no. 3 (1991): 690-728. New York, NY: ACM Press. ISSN: 0004-5411.
Micali, S., M. Rabin, and S. Vadhan. “Verifiable Random Functions.” In Proceedings of 40th Annual Symposium on Foundations of Computer Science. Washington, DC: IEEE Computer Society, 1999, pp. 120-130. ISBN: 0769504094.
Cramer, R., and V. Shoup. “A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack.” In Lecture Notes on Computer Science_._ Vol. 839. Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology. Berlin, Germany: Springer-Verlag, 1998, pp. 13-25. ISBN: 3540648925.
