Stanford Root

Schedule

Stanford Root

Schedule

CS 356

Topics in Computer and Network Security

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Research seminar covering foundational work and current topics in computer and network security. Students will read and discuss published research papers as well as complete an original research project in small groups. Open to Ph.D. and masters students as well as advanced undergraduate students. Prerequisites: While the course has no official prerequisites, students need a mature understanding of software systems and networks to be successful. We strongly encourage students to first take CS 155: Computer and Network Security.

Syllabus for selected term:
View Autumn 2026 Syllabus

Sections

2 Terms
Seminar 1Open
ID: 27863
0 / 50 enrolled
DAYS:Monday, Wednesday
TIME:10:30 AM – 11:50 AM
LOCATION:Littlefield 103
INSTRUCTOR:
Durumeric, Zakir
3units

CS 356: Topics in Computer and Network Security

3 units · Letter or Credit/No Credit

Research seminar covering foundational work and current topics in computer and network security. Students will read and discuss published research papers as well as complete an original research project in small groups. Open to Ph.D. and masters students as well as advanced undergraduate students. Prerequisites: While the course has no official prerequisites, students need a mature understanding of software systems and networks to be successful. We strongly encourage students to first take CS155: Computer and Network Security.

Offered in Autumn 2026, Winter 2027 at Stanford University.

Autumn 2026 sections

  • Seminar — Monday Wednesday 10:30 AM – 11:50 AM — Littlefield 103 — Durumeric, Zakir (Graduate)

Winter 2027 sections

  • Seminar — TBA TBA (Graduate)

More CS courses

  • CS 349H: Software Techniques for Emerging Hardware Platforms (EE 349)
  • CS 349M: Machine Learning for Software Engineering
  • CS 350S: Privacy-Preserving Systems
  • CS 353: Seminar on Logic & Formal Philosophy (PHIL 391)
  • CS 354: Topics in Intractability: Unfulfilled Algorithmic Fantasies
  • CS 355: Advanced Topics in Cryptography
  • CS 357S: Formal Methods for Computer Systems
  • CS 359D: Quantum Complexity Theory
  • CS 359E: Quantum Complexity Theory
  • CS 360: Simplicity and Complexity in Economic Theory (ECON 284)
  • CS 361: Engineering Design Optimization (AA 222, CME 222)
  • CS 372: Artificial General Intelligence for Reasoning, Planning, and Decision Making

All CS courses · All departments