|
CSCI 476, Fall 2021
|
|
This course features a rigorous introduction to modern Cryptography -- a field that conducts mathematical & algorithmic studies of concepts, methods, and tools for protecting information in computer and communication systems. The course will focus on:
Prerequisites: CSCI 270 or permission of the instructor. If you have doubts about meeting these prerequisites, please contact the instructor. |
|
Professor Shang-Hua Teng |
Joshua Palmer |
|
Textbook |
Introduction to Modern Cryptography -- Second Edition
The class will also cover additional material drawn from research papers as well as other books in Theoretical Computer Science. Particularly:
|
Lectures |
|
In-Person Classroom Mask Policy |
|
Grades |
40%: Assignments 30%: Presentations/Participation 30%: Term paper
|
Exams |
  |
Homeworks |
  |
Integrity |
Plagiarism and other anti-intellectual behavior will be dealt with severely. This includes the possibility of failing the course or being expelled from the University. |
Lec# |
Date
|
Topic and/or Event | Required Reading | "Fun" Research Reading |
1
|
08/23
|
Class organization:
|
Chapters 1-3 Search on the Web. For example: "google P NP" "google RSA" "google Zero Knowledge Proof" "google MAC" "google Digital signature" "google Homomorphic Encryption" "google Differential privacy" "google Network Security" |
Chapter 1.3 |
2
|
08/25
|
Shamir's Secret Sharing Scheme: An Example of Perfect Security
Linear Algebra and Number Theory Basic |
Handout, Shamir's CACM paper and Chapter 13.3 and Chapter 8 | Chapter 1.1 |
3
|
08/30
|
Secret Sharing II: A general Scheme
Access Control Monotone Formula Two Basic Primitives general scheme Continue discussion of (perfect) information security |
Handout: Benaloh-Leichter, Generalized Secret Sharing and Monotone Functions | Quantum Secret Sharing Efficient Multi-Party Quantum Secret Sharing Schemes |
4
|
09/01
|
Classic Framework of Secure Communication --
The Setting of Private-Key Encryption
Key generation Encryption/Decryption
Cryptanalysis
|
Chapter 1.2, 1.4 |   |
5
|
09/06
|
Labor Day (No Class) |   | |
6
|
09/18
|
Perfectly-Secret Private-Key Encryption
Information and Probability |
Chapter 2 |   |
7
|
09/13
|
Computational Approach to Security and Cryptography
Complexity Theory Basics Randomness vs Pseudorandomness |
Chapter 3.1, 3.2, 3.3 | |
8
|
9/15
|
Modern Framework of Secure Communication
Public-key encryption Chosen Plaintext Attacks Number Theory Basics |
Chapters, 10.1. 10.2, and Chapter 7, Chapter 8 | |
9
|
9/20
|
RSA
Number Theoretic Basics: Chinese Remainder Theorem |
Chapter 10.4, Chapter 7, Chapter 11.1, and Chapter 11.5, Chapter 8 | |
10
|
9/22
|
RSA
Number Theoretic Basics |
Chapter 10.4 and Chapter 8, Chapter 11.5 | |
11
|
09/27
|
Rabin Encryption Scheme Probabilistic Encryption |
Chapter 13.5 and Chapter 13.4 | |
12
|
09/29
|
Diffie-Hellman Key Exchange | Chapter 10 | |
13
|
10/04
|
Discrete Logarithms and El Gamal Encryption Scheme | Chapter 11.4.1 | |
14
|
10/06
|
Pseudorandom Generation: Blum-Micali Construction
Number Theory Basics |
Chapters 7.4-7.8 and Chapter 8 | Chapter 5 |
15
|
10/11
|
Pseudorandom number generation |   | |
16
|
10/13
|
Pseudorandom number generation | ||
17
|
10/18
|
Indistinguishability and unpredicatability
Blum-Blum-Shub Pseudorandom generator |
Chapters 7.4-7.8 and Chapter 8 | Chapter 5 |
18
|
10/20
|
One Way and trapdoor functions, hardcore bits | Chapter 7.1-7.3 | |
19
|
10/25
|
Intereactive and Zero Knowledge Proofs |
Hangouts | Hangouts |
20
|
10/27
|
Zero Knowledge Proofs | Hangouts | |
21
|
11/01
|
Applications of Zero Knowledge Proofs: Multiparty Computation | Hangouts | |
22
|
11/03
|
Presentation: |   | |
23
|
11/08
|
Presentation
|
  | |
24
|
11/10
|
Presentation: |   | |
25
|
11/15
|
Presentation:
|
||
26
|
11/17
|
Presentation: |   | |
27
|
11/22
|
Presentation: |   | |
28
|
11/24
|
Thanksgiving (No Class) |   | |
29
|
11/29
|
Presentation: | ||
30
|
12/01
|
Presentation |   |