Cryptography | Readings

Textbooks and Suggested Readings:

Useful textbooks and general references include:

[DK] H. Delfs and H. Knebl: Introduction to Cryptography. This is the assigned textbook for the course.
[BR] M. Bellare and P. Rogaway: Lecture Notes for an undergraduate/graduate course at UCSD.
[G] O. Goldreich: Foundations of Cryptography, vol. 1. An excellent, but more advanced, overview of cryptography. Volume 2 (covering encryption, digital signatures, and multi-party computation) is currently available on-line.
[GB] S. Goldwasser and M. Bellare: Lecture Notes on Cryptography. Definitions and theoretical foundations of cryptgraphy on a more advanced level.
[MvOV] A.J. Menezes, P.C. van Ooorschot, and S.A. Vanstone: Handbook of Applied Cryptography. Comprehensive reference to all areas of cryptography.

It may also be helpful to check out my lecture notes from CMSC 456.

Some excellent references for computational number theory and applied algebra include:

[Ang] D. Angluin: Lecture Notes on the Complexity of Some Problems in Number Theory. Available for download (ps | pdf).
[Ch] L.N. Childs: A Concrete Introduction to Higher Algebra. An accessible reference to algebra and number theory, with many cryptographic applications.

The following list contains papers referenced in class, or covering material related to the lectures. Two excellent resources for searching for on-line versions of papers include: the DBLP bibliography and CiteSeer

[AABN02] M. Abdalla, J. An, M. Bellare, C. Namprempre. From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. Eurocrypt '02.
[BM88] M. Bellare and S. Micali. How to Sign Given Any Trapdoor Permutation. J. ACM 39(1): 214-233 (1992).
[BR93] M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM Conference on Computer and Communications Security '93.
[CS99] R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. ACM CCCS '99.
[DH76] W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Info. Theory 22(6): 644-654 (1976).
[FS86] A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Crypto '86.
[GGK03] R. Gennaro, Y. Gertner, and J. Katz. Bounds on the Efficiency of Encryption and Digital Signatures. STOC '03, to appear.
[G86] O. Goldreich. Two Remarks Concerning the GMR Signature Scheme. Crypto '86.
[GGM84] O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. JACM 33(4): 792-807 (1986).
[GGM84b] O. Goldreich, S. Goldwasser, and S. Micali. On the Cryptographic Applications of Random Functions. Crypto '84.
[GL89] O. Goldreich and L. Levin. A Hard-Core Predictate for all One-Way Functions. STOC '89. (Original paper available here.)
[GM84] S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS 28(2): 270-299 (1984).
[GMR84] S. Goldwasser, S. Micali, and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. Siam J. Computing 17(2): 281-308 (1988).
[IL89] R. Impagliazzo and M. Luby. One-Way Functions are Essential for Complexity-Based Cryptography. FOCS '89.
[LR85] M. Luby and C. Rackoff. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions. Siam J. Computing 17(2): 373-386 (1988).
[NY89] M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. STOC '89.
[O92] T. Okamoto. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. Crypto '92.
[Rabin79] M.O. Rabin. Digitalized Signatures and Public Key Functions as Intractable as Factorization. MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979.
[RSA78] R.L. Rivest, A. Shamir, and L.M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Comm. ACM 21(2): 120-126 (1978).
[R90] J. Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. STOC '90.
[S89] C.P. Schnorr. Efficient Identification and Signatures for Smart Cards. Crypto '89.