Certificates

BGP and ASN refresher

Transit vs. Peering

Internet Topology Evolution

Netflix-Comcast dispute

Private Peerings

Blackholing

Mobile internet access

Internet access inequity

IP allocation patterns

DNS (Domain Name System)

DNS failure modes

Domain name security

IPv4 open market

QUIC

Third-party content

HTTP/2

ACME Protocol

Middleboxes

HTTPS

TLS 1.0-1.2

HSTS

Multicast

CDN protocols

Ubiquitous encryption

Tier 1

Peering policies

Submarine links

BGP and ASNs

RPKI

BGP communities

Satellite internet access

MAC rotation

DNSSEC

EDNS

Domain name attacks

IPv4 pricing and sales

Certificate Transparency

GDPR regulation

WebPKI

Let's Encrypt

Internet security problems

Carrier Grade NAT

TLS 1.3

Content delivery strategies

Anycast

Online censorship

Signal messaging protocol

iMessage attacks

Internet Exchange Points (IXPs)

Transit costs

Content centralization

MPLS

BGP hijacking

Last-mile Internet access

Residential internet access technology

IPv4 vs. IPv6

L3-L4 privacy

Load balancing

Domain name ecosystem players

IANA, RIRs, ICANN

.org dispute

HTTP/3

HTTP/1.x

Attack origins

HTTPS interception

HPKP

CDN mechanics

Points of presence (POPs)

SMTP and SMS security

CS 249i The Modern Internet Stanford University Winter 2022–2023 Stanford University's CS 249i is an advanced networking course focusing on modern Internet topology, routing practices, and recent network protocols. The course covers pressing privacy, security, and abuse challenges, with a mix of lectures, guest talks, and practical projects. CS249i is an advanced networking course that covers how the Internet has evolved and operates today. Topics include modern Internet topology and routing practices, recently introduced network protocols, popular content delivery strategies, and pressing privacy, security, and abuse challenges. The course consists of a mixture of lectures, guest talks, and investigative projects where students analyze how the Internet operates in practice.  This course assumes a basic understanding of networking, including protocols like Ethernet, IP, and TCP, as well as routing concepts and socket programming. This is not an introductory networking course and students should first take Stanford [CS 144](https://cs144.stanford.edu), EE 284, or equivalent. For a refresher, consider "Computer Networking: A Top-Down Approach" by J. Kurose and K. Ross or "Computer Networks: A Systems Approach" by L. Peterson and B. Davie. Projects will be implemented in [Go](https://golang.org/). 

CS 249i The Modern Internet

Computer Networks

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

End-to-end encryption

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

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

Zero-knowledge proof

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

Computer Security and Cryptography

Cryptography

Bitcoin

UI Attacks

WPA (WiFi Protected Access)

Malware

Cookies

Memory Safety Vulnerabilities

Pseudorandom Number Generator (PRNG)

Passwords

Cross-Site Scripting (XSS)

DHCP (Dynamic Host Configuration Protocol)

Intrusion Detection

Asymmetric Key Cryptography

x86 assembly language

Cryptographic Hashes

Session Management

Networking

TCP (Transmission Control Protocol)

Denial-of-Service (DoS) Attacks

Message authentication code (MAC)

Call stack

Cross-Site Request Forgery (CSRF)

ARP (Address Resolution Protocol)

UDP (User Datagram Protocol)

Firewalls

Memory Safety

Security Principles

Public-key cryptography

Same-Origin Policy

Anonymity

SQL Injection

Symmetric-key Cryptography

Border Gateway Protocol (BGP)

CS 161: Computer Security UC Berkeley Summer 2022 This course offers an introduction to computer security, including cryptography, operating system security, network security, and software security. It uses case studies from real-world systems. Prerequisites include experience working with large codebases and a basic understanding of modular arithmetic/set notation. Introduction to computer security. Cryptography, including encryption, authentication, hash functions, cryptographic protocols, and applications. Operating system security, access control. Network security, firewalls, viruses, and worms. Software security, defensive programming, and language-based security. Case studies from real-world systems.  The prerequisites for CS 161 are:

- CS 61B (Data Structures), for experience working with large codebases (500–1000 lines of code) and basic data structures. This is relevant for Project 2.
- CS 61C (Machine Structures), for understanding of C memory layout and hex/binary number representation. This is relevant for the memory safety unit (Project 1). All necessary CS 61C content will be reviewed during lecture.
- CS 70 (Discrete Math and Probability Theory), for basic understanding of modular arithmetic/set notation and some mathematical intuition. This is relevant in the cryptography unit. We will review any necessary CS 70 content in lectures, so don’t worry if you don’t feel very comfortable with all the CS 70 material.

We assume basic knowledge of C and Python. Some basic familiarity with Unix systems is helpful for Project 1. Project 2 is done in Go and we won’t have any lectures on Go syntax, so we expect students to be able to learn the basics of the language on their own. The readings are all linked on [the course website](https://su22.cs161.org/) and freely available. The majority of readings come from the [course textbook](https://textbook.cs161.org/), which is freely available for you to use as a study and review resource. All readings are optional (but recommended) unless otherwise indicated.

CS 161: Computer Security

Web Technologies

Web Protocols

Denial-of-service attack (DoS attack)

Transport Protocols

Operating System Security

Physical Security

OS Isolation

Authorization

Cloud Security

Accounting

Storage Encryption

Web Security Model

Networks

One-time pad

Hash functions

Scanning

Authentication

OS Privileges

Browser 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

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)

 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