Description
In this seminar we will read papers about some recent developments in foundations of Cryptography. The topics will be chosen based on the interest of the participants, but some possible suggested topics are: security aspects of cloud computing (e.g. homomorphic encryption), delegation of computation, black-box separations, private information retrieval, etc.
The grades will be based on a semester long project that is also related to the papers that students(s in group) will present. To enjoy this seminar, you should enjoy theoretical aspects of designing secure systems.
Comments
CS 2102 (Discrete Math) and CS 3102 (theory of computation) are mandatory. Knowledge of Algorithms (CS 4102) would also be extremely helpful. If you have taken Complexity or Cryptography before, you don't have to satisfy other pre-reqs.
The grades will be based on a semester long project that is also related to the papers that students(s in group) will present. To enjoy this seminar, you should enjoy theoretical aspects of designing secure systems.
Comments
CS 2102 (Discrete Math) and CS 3102 (theory of computation) are mandatory. Knowledge of Algorithms (CS 4102) would also be extremely helpful. If you have taken Complexity or Cryptography before, you don't have to satisfy other pre-reqs.
General Information
No information, yet. Stay tuned!
| Name | Office Hours | |
|---|---|---|
Mohammad Mahmoody | When? Where? |
General Resources
General Resources
Lecture Notes
Lecture Notes
Lecture Date
Mar 25, 2015
Mar 25, 2015
Feb 23, 2015
Feb 23, 2015
Feb 16, 2015
Feb 16, 2015
Feb 11, 2015
Feb 11, 2015
Feb 9, 2015
Feb 9, 2015
Jan 28, 2015
Jan 28, 2015
Jan 26, 2015
Jan 26, 2015
Jan 21, 2015
Jan 21, 2015
Jan 14, 2015
Jan 12, 2015
Project Drafts
Project Drafts
Date