Zero-knowledge proof

End-to-end encryption

Man-in-the-middle attacks

Public key infrastructure (PKI)

Merkle trees

Certificate Transparency

Anonymous messaging

Encrypted search

Bitcoin

Ethereum

Smart contracts

Algorand

Rollups

Zero-knowledge smart contracts

Web3

Multi-Party Computation (MPC)

Cryptocurrency wallets

Backdoor-resilient authentication

Federated learning

CS 294-163: Secure Systems from Decentralized Trust UC Berkeley Fall 2022 This graduate seminar focuses on the development of secure systems built from decentralized trust, including end-to-end encryption systems and secure collaborative learning. It requires a solid introduction to cryptography and systems. Topics include blockchain, smart contracts, and zero-knowledge proofs, among others. This course is a graduate seminar on developing (secure) systems from decentralized trust.

In the past years, there has been much excitement in both academia and industry around the notion of decentralized security, which refers to, loosely speaking, security mechanisms that do not rely on the trustworthiness of any central entity. In only a few years, this area has generated many beautiful cryptographic constructs as well as a tremendous amount of real-world adoption, through blockchain, secure custody of secrets, secure collaborative learning – and now forming the technical backbone of the movement on “web3.0”.

The course will cover topics such as decentralized ledger systems, decentralized authentication and access control, end-to-end encryption systems, secure collaborative learning through secure multi-party computation, and others. For concrete learning, throughout the class we will develop a decentralized trust stack enabling common decentralized trust applications (3 units).  This is an advanced course, requiring a solid introduction to cryptography (CS161 or equivalent) and to systems (CS162 or equivalent). There is no required textbook for this class. You can refer to the [Berkeley CS161 textbook](https://textbook.cs161.org/) to refresh on security concepts and [A Graduate Course in Applied Cryptography](http://toc.cryptobook.us/) for cryptography.

CS 294-163: Secure Systems from Decentralized Trust

Blockchain

Computer Security and Cryptography

Stream ciphers

Advanced Encryption Standard (AES)

Cipher Block Chaining (CBC)

Merkle-Damgard construction

Active attacks

Discrete logarithm assumption

Identification protocols

SecurID

Digital signature

Post-quantum digital signatures

Symmetric-key encryption

Block cipher

Chosen Plaintext Attacks (CPA)

PMAC

Hash-based Message Authentication Code (HMAC)

Trapdoor function

One-time passwords

Secure Socket Layer (SSL)

Shor's algorithm

Diffie-Hellman key exchange

Semantic security

Pseudo Random Functions (PRF)

CBC-MAC

Secure Hash Algorithm (SHA)

Finite cyclic groups

Chosen Ciphertext Attacks (CCA) security

Certificates

Salts

Authenticated key exchange

Grover's algorithm

Cipher

One time pad

Iterated Even-Mansour ciphers

Counter mode

Collision-resistant hashing

Authenticated encryption

Computational Diffie-Hellman (CDH) assumption

RSA trapdoor permutation

Certificate revocation

S/Key

Transport Layer Security (TLS)

Post-quantum cryptography

Perfect secrecy

Pseudo Random Permutations (PRP)

Message integrity

Davies-Meyer construction

Arithmetic modulo primes

ElGamal public key encryption

Hash-based signatures

Password protocols

Challenge-response authentication

Post-quantum key exchange

CS 255: Introduction to Cryptography Stanford University Winter 2023 This course offers an introduction to cryptographic techniques used in computer security, covering encryption, message integrity, digital signatures, key management, and more. It is suitable for advanced undergraduates and masters students with some proof techniques and programming experience. Cryptography is an indispensable tool for protecting information in computer systems. This course explains the inner workings of cryptographic primitives and how to use them correctly.

This course is an introduction to the basic theory and practice of cryptographic techniques used in computer security. We will cover topics such as encryption (secret-key and public-key), message integrity, digital signatures, user authentication, key management, cryptographic hashing, Network security protocols (SSL, IPsec), public-key infrastructure, digital rights management, and a bit of zero-knowledge protocols.

Optional readings can be found in the textbooks denoted by KL and AC in the syllabus below. The optional AC book, by Boneh and Shoup, is more advanced (and free) and is intended for students wishing to go deeper. The [online version of the course](https://crypto.stanford.edu/~dabo/courses/OnlineCrypto/) is another resource for the material covered in class.

- **Boneh-Shoup (AC):** (free) *[A Graduate Course in Applied Cryptography](https://cryptobook.us) (V 0.5)* by D. Boneh and V. Shoup
- **KL:** *[Introduction to Modern Cryptography](http://www.cs.umd.edu/~jkatz/imc.html)* (2nd edition) by J. Katz and Y. Lindell.  The course is self contained, however a basic understanding of probability theory and modular arithmetic will be helpful. The course is intended for advanced undergraduates and masters students. Students are expected to have experience with basic proof techniques and some programming experience. Students can supplement the lectures with an [online version of the course](https://www.coursera.org/learn/crypto) (MOOC) that covers some of the material.

The following books can be used to supplement the lectures:

- Optional: *[A Graduate Course in Applied Cryptography](https://cryptobook.us)* by D. Boneh and V. Shoup. (free)
- Optional: *[Introduction to Modern Cryptography](http://www.cs.umd.edu/~jkatz/imc.html)* by J. Katz and Y. Lindell.

Note that the textbooks do not cover all the material discussed in class.

CS 255: Introduction to Cryptography

Merkle Trees

Oblivious transfer (OT)

IoT Security

Garbled Circuits

Sandboxing

Cryptocurrency

Infrastructure Security

Oblivious Computation

Secure Analytics

Secure Computation

Attacks on ML

Secure Communications

Hardware Security

Applied MPC

Mobile Security

CS 261 Security in Computer Systems UC Berkeley Fall 2022 A graduate-level course surveying modern topics in computer systems security, including secure messaging, blockchain, hardware security, and secure federated computation. It requires completion of CS 162 and CS 161 or equivalent for enrollment. Graduate survey of modern topics in computer systems security, including secure messaging, blockchain and cryptocurrencies, hardware security, secure federated computation, language-based security, anonymous communication, privacy and others. (3 units)  CS 162 and CS 161 or equivalent. 

CS 261 Security in Computer Systems

Cryptography

One-time pad

Computational assumptions

Public-key cryptography

DSA signature schemes

RSA (cryptosystem)

Pseudorandom generator (PRG)

Password-based authentication

Sigma protocol

Succinct Non-Interactive Arguments (SNARGs)

GMW: MPC for any function

Fully homomorphic encryption

Private information retrieval

Hardware security module (HSM)

Differential privacy

Shannon's Theorem

Collision-resistant hash functions

Pseudorandom function/permutation (PRF/PRP)

Secure shell protocol (SSH)

Two-factor authentication

Diffie-Hellman tuple

Non-interactive zero-knowledge (NIZK) proof

Secure multi-party computation (MPC)

Malicious security: GMW compiler

Somewhat homomorphic encryption over integers

Bootstrapping SWHE to FHE

Cryptography in blockchain

Privacy in machine learning

Computational security

Message authentication code (MAC)

Birthday attack

HKDF

Secure authentication

Proof of knowledge

Fiat-Shamir heuristic

Garbled circuit

Cut-and-choose for garbled circuits

GSW: SWHE from LWE

Secure deployment of MPC applications

Random oracle model

Hash-and-Sign paradigm

Modes of operation

Single Sign-On (SSO) authentication

Schnorr's identification protocol

Anonymous online voting

Private set intersection

BFV: SWHE from RLWE

Secure hardware: secure enclaves (Intel SGX)

 CSCI 1515 Applied Cryptography Brown University Spring 2023 Applied Cryptography at Brown University offers a practical take on securing systems. By learning foundational cryptographic algorithms and advanced topics like zero-knowledge proofs and post-quantum cryptography, students gain both theoretical insights and hands-on experience in implementing cryptosystems using C++ and crypto libraries. Label: State-of-art concepts. ### Welcome to Applied Cryptography (CSCI 1515) at Brown!

This course teaches cryptography from a practical perspective and provides hands-on experience in building secure systems.

We first introduce foundational cryptographic algorithms including secret-key and public-key encryption schemes, message authentication codes, digital signatures, and hash functions, from which you will build secure communication and authentication systems.

More advanced topics that are covered include zero-knowledge proofs, secure multi-party computation, fully homomorphic encryption, post-quantum cryptography, and differential privacy. You will learn how these cryptographic techniques can be used to develop more advanced applications such as secure online anonymous voting, secure computation, and private information retrieval.

Besides the high-level design of these cryptosystems, you will also get hands-on experience implementing them using tools from the existing crypto libraries written in C++.    ## Textbooks

- [MOV] [Handbook of Applied Cryptography](https://cacr.uwaterloo.ca/hac/) by Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone
- [BS] [A Graduate Course in Applied Cryptography](http://toc.cryptobook.us/book.pdf) by Dan Boneh and Victor Shoup
- [KL] [Introduction to Cryptography](https://eclass.uniwa.gr/modules/document/file.php/CSCYB105/Reading%20Material/%5BJonathan_Katz%2C_Yehuda_Lindell%5D_Introduction_to_Mo%282nd%29.pdf) by Jonathan Katz and Yehuda Lindell
- [R] [The Joy of Cryptography](https://joyofcryptography.com/pdf/book.pdf) by Mike Rosulek

 CSCI 1515 Applied Cryptography

Zero-knowledge proof

4 courses cover this concept

CS 294-163: Secure Systems from Decentralized Trust

CS 255: Introduction to Cryptography

CS 261 Security in Computer Systems

CSCI 1515 Applied Cryptography