Anonymity

Control Hijacking Attacks: defenses

Sandboxing

Web Defenses

Spectre Attack

Privacy

Control Hijacking Attacks: exploits

Isolation

Web Attacks

Intel SGX

Network Security

Network Defenses

Access control

Web Security

HTTPS

Mobile Platform Security Architecture

Internet Security

Censorship

System Security

Operating System Security

Web Security Model

Processor and Microarchitecture Security

Android Security

DoS Attacks

Principle of least privilege

Testing for vulnerabilities

Cryptography

Mobile Security

Internet Protocols

CS 155 Computer and Network Security Stanford University Spring 2022 This course focuses on principles of computer systems and network security, exploring different attack techniques and corresponding defenses. Course projects aim at building reliable code and understanding attacks. Prior knowledge in operating systems, networking protocols, and basic programming languages is needed. The course covers principles of computer systems and network security. We will discuss various attack techniques and how to defend against them. Topics include network attacks and defenses, operating system holes, web security, e-mail, botnet, malware, social engineering attacks, privacy, and digital rights management. Course projects will focus on building reliable code and understanding attacks. The course is intended for junior and senior undergraduates and first year graduate students.  The course requires an understanding of operating systems, networking protocols, and a basic understanding of programming languages. Programming projects will be done primarily in C and JavaScript, but other languages may be needed.

Pre-requisites: CS110/CS111 (Principles of Computer Systems) There is no textbook for the class.

Instead, we will use research papers posted on the course [syllabus page](https://cs155.stanford.edu/syllabus.html) for every lecture.

CS 155 Computer and Network Security

Computer Security and Cryptography

Denial-of-Service (DoS) Attacks

Traceback

DoS (Denial-of-Service) Defense

Network Monitoring

Fundamental NIDS (Network Intrusion Detection System) Issues

Evaluating Detectors

Computer worm

Worm Detection/Defense

Scanning

Inferring Activity

Forensics

IPv4 Addressing Architecture

Authentication

Digital identity

Botnets

PPI (Personally Identifiable Information) / Presentations

Abusive Surveillance

Spamming

Cybercrime

CS 261N: Internet/Network Security UC Berkeley Fall 2022 This course offers a comprehensive study of network security, exploring areas like denial-of-service, network monitoring, botnets, and internet ethics. It leans towards a research-based approach with a major team project. The class features a deep dive into seminal papers rather than the latest trends. Prerequisites include CS 168/EE 122 and CS 161 or their equivalents. This class aims to provide a thorough grounding in network security suitable for those interested in conducting research in the area, as well as students more generally interested in either security or networking. We will also look at broader issues relating to Internet security for which networking plays a role. The [syllabus](https://www.icir.org/vern/cs261n/syllabus.html) has overlap with portions of the SEC prelim.

Topics include: denial-of-service; capabilities; network monitoring / intrusion detection; worms; forensics; scanning; traffic analysis / inferring activity; architecture; protocol issues; legality and ethics; web attacks; anonymity; censorship; surveillance; honeypots; botnets; spam; the underground economy; research issues & pitfalls.

The course is taught with an emphasis on seminal papers rather than bleeding-edge for a given topic. It includes a [major project](https://www.icir.org/vern/cs261n/project.html) that students generally undertake in teams of two.

Three hours of lecture per week. 4 units, due to the significant workload.  CS 168 / EE 122 or equivalent; CS 161 or equivalent; basic probability/statistics. (Non-PhD students must receive instructor approval.) There is no required textbook. All reading will be from papers. A tentative list of these is available from the [syllabus](https://www.icir.org/vern/cs261n/homework.html#Syllabus). We will definitely cover most of these topics (and primary papers), but may make some changes over the course of the semester.

CS 261N: Internet/Network Security

Buffer overflow

Hash functions

Browser Security Model

Mobile Platform Security

Buffer Overflow Defenses

Message authentication code (MAC)

Web Application Security

Usable Security

Symmetric-key encryption

Asymmetric Key Cryptography

Web Privacy

Symmetric-key Cryptography

Physical Security

Block Cipher Modes

CSE 484 / CSE M 584 Computer Security University of Washington Autumn 2021 This course covers a wide range of computer security topics, including software security, cryptography, web security, malware, and physical security. It encourages a "security mindset" while requiring a firm understanding of computer science fundamentals and command-line Unix development environment. In this course, we will cover topics including: the "security mindset", threat modeling, software security, cryptography, malware, web security, web privacy, smartphone security, authentication, usable security, anonymity, physical security, and security for emerging technologies.  *CSE 332* and *CSE 351*

You should have maturity in both the mathematics of computer science and in the engineering of computer systems. This means that you should: have a good understanding of data structures and algorithms; be comfortable writing programs from scratch in C and Java; be comfortable writing and debugging assembly code; and be comfortable in a command-line Unix development environment (gdb, gcc, etc). You should also have a good understanding of computer architecture, operating systems, and computer networks. Most importantly, you should be eager to challenge yourself and learn more! ### No Textbook

In previous quarters we've used "Foundations of Security: What Every Programmer Needs to Know, Daswani, Kern, and Kesavan, ISBN 1-59059-784-2. This quarter we are not using an official textbook, and are instead using various freely available readings.
We will be using some readings from [Security Engineering](https://www.cl.cam.ac.uk/~rja14/book.html) of which the 2nd edition is freely available on the author's webpage

CSE 484 / CSE M 584 Computer Security

Diffie-Hellman key exchange

Bitcoin

UI Attacks

WPA (WiFi Protected Access)

DNS (Domain Name System)

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

x86 assembly language

Cryptographic Hashes

Digital signature

Session Management

Networking

TCP (Transmission Control Protocol)

Call stack

Certificates

Cross-Site Request Forgery (CSRF)

ARP (Address Resolution Protocol)

UDP (User Datagram Protocol)

Firewalls

Memory Safety

Security Principles

Public-key cryptography

Same-Origin Policy

DNSSEC

SQL Injection

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

Anonymity

4 courses cover this concept

CS 155 Computer and Network Security

CS 261N: Internet/Network Security

CSE 484 / CSE M 584 Computer Security

CS 161: Computer Security