DNSSEC

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

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

Certificates

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

Cryptography

Diffie-Hellman key exchange

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)

Transport Layer Security (TLS)

Intrusion Detection

Asymmetric Key Cryptography

x86 assembly language

Cryptographic Hashes

Digital signature

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

Computer Security and Cryptography

Domain Name System Security Extensions

DNSSEC

2 courses cover this concept

CS 249i The Modern Internet

CS 161: Computer Security