Message authentication code (MAC)

Block cipher

Zero-knowledge proof

Diffie-Hellman key exchange

Anonymity

Public-key cryptography

Digital signature

Certificates

Cryptography

Security Principles

Symmetric-key Cryptography

One-time pad

Hash functions

Stream ciphers

Authentication

Authorization

Accounting

Web Security Model

Browser Security

Web Technologies

Web Protocols

Session Management

Same-Origin Policy

Cross-Site Request Forgery (CSRF)

SQL Injection

Cross-Site Scripting (XSS)

Operating System Security

Passwords

OS Isolation

Malware

OS Privileges

Cloud Security

Storage Encryption

Networks

DNS (Domain Name System)

Denial-of-service attack (DoS attack)

Transport Protocols

Transport Layer Security (TLS)

Firewalls

Scanning

Physical Security

CS1660: Computer Systems Security Brown University Spring 2022 CS1660 delivers a balanced mix of theory and practice in computer systems security. Starting with the foundational aspects of cryptography, the course navigates through security aspects of web applications, operating systems, and networks. Students will hone their "security mindset," learning to identify vulnerabilities and understand defenses across different domains. CS1660 (formerly called CS166) is a course on **computer systems security** through a balanced mixture of theory and practice.

We’ll start out with building the foundations of security through an exploration of **cryptography**. From there, we’ll move to more complex, multi-faceted systems such as **web applications**, **operating systems**, and **networks**. Along the way, we’ll explore complementary topics such as authentication, physical security, social engineering, privacy, anonymity, usability, and the security of emergent systems such as blockchains and machine learning.

By learning about security through these multiple domains, you’ll concretely learn how various classes of attacks appear in a vast variety of scenarios and how they work in practice. You’ll also learn how to evaluate systems adversarially, from writing precise security analyses about subtle issues in protocols to discovering and exploiting vulnerabilities in concrete technical systems for yourself.

Through all of these activities, you’ll ultimately work to develop a specific kind of intuition—a ***“security mindset”***—that will give you the knowledge, vocabulary, and confidence to critically analyze and effectively defend the software and systems you approach as a computer scientist even after the course. - Provide an introduction to computer security
    - Overview security threats and defenses
- Help you develop a security-aware mindset:
    - Take the big picture and understand the details
- Learning by practicing
    - Consider ethical implications and tradeoffs of using, building, and testing secure systems You should have an intro-sequence’s worth of programming experience ([0160](https://cs.brown.edu/courses/info/csci0160/), [0180](https://cs.brown.edu/courses/info/csci0180/), or [0190](https://cs.brown.edu/courses/info/csci0190/)) and have a good understanding of systems programming ([0300](https://cs.brown.edu/courses/info/csci0300/), [0330](https://cs.brown.edu/courses/info/csci0330/), [1310](https://cs.brown.edu/courses/info/csci1310/), or [1330](https://cs.brown.edu/courses/info/csci1330/)). This concretely means that:

- You should be comfortable writing programs and scripts in the language of your choice (such as Python, Ruby, Bash, Go, C++, etc.), be comfortable in a Unix command-line environment (running binaries, filesystem navigation, etc.) and using SSH with the Brown CS filesystem, have a basic understanding of systems programming concepts such as memory management and networking.
- You also should have heard of the terms “race condition”, “packet”, “TCP”, “UDP”, “buffer overflows”, and “DNS”. (If you forget what these are, don’t worry—we’ll describe them again when they come up in the latter half of the course.)
- You should also be at least somewhat comfortable (and very willing) to learn new programming languages and reading code in languages and programs that you’ve never used before. (You’ll get lots of practice with this in this course!)
 
*If you don’t meet the official prerequisites* but still want to take the course, please feel free to ask the instructors–we are happy to discuss your individual situation to determine if the course is right for you!

Your willingness to challenge yourself is perhaps the most important prerequsite for the course. Security can be frustrating at times, but the rewards are great. In exchange for engaging with some difficult intellectual challenges, you’ll have the opportunity to gain concrete insights about systems and security and become a better computer scientist along the way! 

CS1660: Computer Systems Security

Computational assumptions

Symmetric-key encryption

RSA (cryptosystem)

Shannon's Theorem

Computational security

ElGamal public key encryption

Message integrity

DSA signature schemes

Authenticated encryption

Collision-resistant hash functions

Birthday attack

Random oracle model

Secure Hash Algorithm (SHA)

Hash-based Message Authentication Code (HMAC)

HKDF

Hash-and-Sign paradigm

Pseudorandom generator (PRG)

Pseudorandom function/permutation (PRF/PRP)

Modes of operation

CBC-MAC

Secure shell protocol (SSH)

Public key infrastructure (PKI)

Password-based authentication

Two-factor authentication

Secure authentication

Single Sign-On (SSO) authentication

Diffie-Hellman tuple

Proof of knowledge

Schnorr's identification protocol

Sigma protocol

Non-interactive zero-knowledge (NIZK) proof

Fiat-Shamir heuristic

Anonymous online voting

Succinct Non-Interactive Arguments (SNARGs)

Secure multi-party computation (MPC)

Garbled circuit

Oblivious transfer (OT)

GMW: MPC for any function

Malicious security: GMW compiler

Cut-and-choose for garbled circuits

Private set intersection

Fully homomorphic encryption

Somewhat homomorphic encryption over integers

GSW: SWHE from LWE

BFV: SWHE from RLWE

Private information retrieval

Bootstrapping SWHE to FHE

Secure hardware: secure enclaves (Intel SGX)

Hardware security module (HSM)

Cryptography in blockchain

Secure deployment of MPC applications

Blockchain

Differential privacy

Privacy in machine learning

 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

Pre-modern cryptography

Definitions in cryptography

Randomized encryption

Information-theoretic security

Pseudorandom Generator (PRG)

Constructing PRGs

Chosen Plaintext Attacks (CPA)

Pseudorandom Function (PRF)

Pseudorandom Permutation (PRP)

Constructing block ciphers

Attacks on block ciphers

Chosen Ciphertext Attacks (CCA) security

Collision-resistant hashing

Commitment schemes

Number-theoretic constructions of symmetric primitives

Relationships between symmetric primitives

Trapdoor permutations

Identification protocols

COS 433 - Cryptography Princeton University Fall 2020 An introductory course into modern cryptography, grounded in rigorous mathematical definitions. Covers topics such as secret key and public key encryption, pseudorandom generators, and zero-knowledge proofs. Requires a basic understanding of probability theory and complexity theory, and entails some programming for course projects.  Cryptography is an ancient practice dating back almost 4000 years. However, cryptography practiced today is very different than the cryptography used as recently as a few decades ago. For one, traditional cryptography was mostly synonymous with encryption: translating data into secret codes. Today, however, cryptography extends far beyond basic codes to encompass concepts such as authentication and integrity, and can be used to solve seemingly impossible tasks such as public key encryption (exchanging secret messages without ever having met in person to share a secret key) and zero knowledge proofs (proving theorems without revealing the proof).

Another new feature in modern cryptography is its foundations. Until recently, cryptography was largely an art form based on intuition and ad hoc tweaks to block vulnerabilities. Modern crytpography is instead more of a science, characterized by rigorous mathematical definitions and theorems that guide the design of new systems.

This course is an introduction to modern cryptography, focusing on the theoretical foundations, with some attention to practical considerations. We will cover a variety of topics, including secret key and public key encryption, authentication, commitments, pseudorandom generators, and zero knowledge proofs.  Basic probability theory. Basic complexity theory (as in COS340) recommended. The course projects will involve programming, but no specific programming language is required. 

COS 433 - Cryptography

Cipher

One time pad

Perfect secrecy

Semantic security

Iterated Even-Mansour ciphers

Advanced Encryption Standard (AES)

Pseudo Random Permutations (PRP)

Pseudo Random Functions (PRF)

Counter mode

Cipher Block Chaining (CBC)

PMAC

Merkle-Damgard construction

Davies-Meyer construction

Active attacks

Arithmetic modulo primes

Finite cyclic groups

Computational Diffie-Hellman (CDH) assumption

Discrete logarithm assumption

Trapdoor function

RSA trapdoor permutation

Hash-based signatures

Certificate Transparency

Certificate revocation

Password protocols

Salts

One-time passwords

S/Key

SecurID

Challenge-response authentication

Authenticated key exchange

Secure Socket Layer (SSL)

End-to-end encryption

Grover's algorithm

Shor's algorithm

Post-quantum cryptography

Post-quantum digital signatures

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

Man-in-the-middle attacks

Merkle trees

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

Computer security and cryptography are related fields that focus on protecting the confidentiality, integrity, and availability of information and systems. Common sub-topics include Cryptography, Operating System Security, Software Security, Encryption etc.

Computer Security and Cryptography

Computer Science

Computer Security and Cryptography

Prerequisites

Common concepts