Difference between revisions of "CS 8803TFC - Theoretical Foundations of Cryptography, Spring 2011"

From Theory
Jump to: navigation, search
(Handouts and Lecture Notes)
Line 44: Line 44:
* [[:Media:hw3.pdf|Homework 3]] (posted Feb 10): due Feb 24 ([[:Media:hw3.tex|template]], [[:Media:header.tex|header file]]).
* [[:Media:hw3.pdf|Homework 3]] (posted Feb 10): due Feb 24 ([[:Media:hw3.tex|template]], [[:Media:header.tex|header file]]).
* [[:Media:hw4.pdf|Homework 4]] (posted Feb 24): due Mar 10 ([[:Media:hw4.tex|template]], [[:Media:header.tex|header file]]).
* [[:Media:hw4.pdf|Homework 4]] (posted Feb 24): due Mar 10 ([[:Media:hw4.tex|template]], [[:Media:header.tex|header file]]).
* [[:Media:hw5.pdf|Homework 5]] (posted Apr 5): due Apr 14 ([[:Media:hw5.tex|template]], [[:Media:header.tex|header file]]).
== Handouts and Lecture Notes ==
== Handouts and Lecture Notes ==

Revision as of 20:52, 5 April 2011

CryptoBook.jpg Goldreich1.jpg Goldreich2.jpg

Course Information

Instructor: Chris Peikert

Time: Tue/Thu 3-4:30pm (First meeting: Jan 11th Jan 18th, due to weather)

Location: College of Computing Building, Room 102

Summary: Cryptography, or "secret writing," is nearly as old as written communication itself. Yet only over the past few decades has it grown from a "black art" into a true science with rigorous mathematical foundations and methodologies. These have taken cryptography far beyond its roots in simple secret codes, to a discipline with far-reaching influence on computing as a whole.

This class is a graduate-level, theory-oriented introduction to the foundations of modern cryptography. The emphasis is on essential concepts, precise models and definitions, and proof techniques. Topics include: one-way functions and related complexity assumptions, pseudorandomness, public-key and identity-based crypto, zero knowledge and commitment, and connections to diverse areas of computer science. As time permits, we may also touch upon specialized topic areas such as secure multiparty computation, private information retrieval, or lattice-based cryptography.

For more information and course policies, see the course information and syllabus handout.


All assignments are due (via the course T-Square site) before the start of class on the stated due date.

To use the supplied LaTeX templates (recommended), you will need the latest version of this header file (you may need to rename it to lower-case after downloading, due to a bug in the wiki software). You may also need this file, if the template does not compile properly on its own.

Handouts and Lecture Notes

Intro and Perfect Secrecy

Computational Hardness

Indistinguishability and Pseudorandomness

  • Blum-Micali PRG
    • Supplementary reading: Section 3.4 of Pass-shelat


Zero Knowledge

  • ZK Proofs
    • Supplementary reading: Sections 4.5-4.6 of Pass-shelat
  • ZK for NP
    • Supplementary reading: Section 4.7 of Pass-shelat

Special Topics

Useful Links


Previous iterations of this course: