CS 355: Topics in Cryptography
The course is a seminar on topics in cryptography. Course topics this
year include pseudorandomness, security notions for both encryption
and signatures, random oracle analysis, and a bit of distributed computations.
The course is intended for graduate students interested in
Topics - highly tentative
- Introduction. Crash course in probability, pair wise independence, large deviation bounds.
Part I: Pseudorandomness
Part II: Basic distributed computation.
- Introduction to secure function evaluation. Applications.
- Oblivious transfer. Yao's two party protocol.
- The BGW multi-party protocol.
Part III: Security notions
- Security notions for signatures.
GMR signatures. Secure signatures based on strong RSA.
- Random oracle model. Secure signatures in the random oracle model.
- Signatures based on UOWHF.
- Security notions for encryption. Semantic security. chosen ciphertext
- Secure encryption in the random oracle model.
- Cramer-Shoup encryption.
Part IV: Factoring and discrete-log
- Factoring algorithms: elliptic curve method and the number field sieve.
- Discrete log algorithms: Pollard rho and index calculus.
Return to course homepage.
Last update: Sep. 21, 2002 by