Cryptography
Cryptographic primitives, protocols, and their proofs of security.
Symmetric and asymmetric primitives, protocol design, and the mathematical foundations behind cryptographic security proofs.
Notes
- Additional Public-Key Tools
- Attacks on RSA and the Generic Group Model
- Authenticated Encryption
- Authenticated Key Exchange — Foundations
- Block Cipher Attacks, PRF Constructions, and the Ideal Cipher Model
- CPA-Secure Encryption — Modes of Operation
- Cramer-Shoup and Practical CCA-Secure Encryption
- Elliptic Curve Cryptography
- Garbled Circuits and the Universal Composability Framework
- Hash-Based Signature Schemes
- Hash Function Constructions, Merkle Trees, and Key Derivation
- Identification Protocols, Password Security, and One-Time Passwords
- Lattice Cryptography — SIS, Trapdoor Sampling, and Signatures
- MAC Constructions from PRFs
- MPC via Arithmetic Circuits and Beaver's Protocol
- Non-Interactive Zero-Knowledge and SNARKs
- Oblivious Transfer from Diffie-Hellman
- Pairing-Based Cryptography
- Password-Authenticated Key Exchange (PAKE)
- Schnorr Identification and Signatures
- Sigma Protocols and the Fiat-Shamir Transform
- Signcryption and Advanced Signature Topics
- Stream Cipher Attacks and Case Studies
- Threshold Cryptography — Signatures, Decryption, and DKG
- Universal Hashing and the Carter-Wegman MAC
- Block Cipher Constructions and Pseudorandom Objects
- Classical Cryptography and Perfect Secrecy
- Digital Signatures and Public-Key Infrastructure
- Message Authentication Codes and Hash Functions
- Number Theory for Cryptography
- Private-Key Encryption and Pseudorandomness
- Public-Key Cryptography — Motivation and Key Exchange
- Public-Key Encryption Schemes