Search result: Catalogue data in Spring Semester 2021

Number	Title	Type	ECTS	Hours	Lecturers
Cyber Security Master
Field of Specialization
Core Courses
263-4660-00L	Applied Cryptography Number of participants limited to 150.	W	8 credits	3V + 2U + 2P	K. Paterson
Abstract	This course will introduce the basic primitives of cryptography, using rigorous syntax and game-based security definitions. The course will show how these primitives can be combined to build cryptographic protocols and systems.
Learning objective	The goal of the course is to put students' understanding of cryptography on sound foundations, to enable them to start to build well-designed cryptographic systems, and to expose them to some of the pitfalls that arise when doing so.
Content	Basic symmetric primitives (block ciphers, modes, hash functions); generic composition; AEAD; basic secure channels; basic public key primitives (encryption,signature, DH key exchange); ECC; randomness; applications.
Literature	Textbook: Boneh and Shoup, “A Graduate Course in Applied Cryptography”, https://crypto.stanford.edu/~dabo/cryptobook/BonehShoup_0_4.pdf.
Prerequisites / Notice	Students should have taken the D-INFK Bachelor's course “Information Security" (252-0211-00) or an alternative first course covering cryptography at a similar level. / In this course, we will use Moodle for content delivery: https://moodle-app2.let.ethz.ch/course/view.php?id=14558.

Electives
Number	Title	Type	ECTS	Hours	Lecturers
252-0408-00L	Cryptographic Protocols	W	6 credits	2V + 2U + 1A	M. Hirt, U. Maurer
Abstract	The course presents a selection of hot research topics in cryptography. The choice of topics varies and may include provable security, interactive proofs, zero-knowledge protocols, secret sharing, secure multi-party computation, e-voting, etc.
Learning objective	Indroduction to a very active research area with many gems and paradoxical results. Spark interest in fundamental problems.
Content	The course presents a selection of hot research topics in cryptography. The choice of topics varies and may include provable security, interactive proofs, zero-knowledge protocols, secret sharing, secure multi-party computation, e-voting, etc.
Lecture notes	the lecture notes are in German, but they are not required as the entire course material is documented also in other course material (in english).
Prerequisites / Notice	A basic understanding of fundamental cryptographic concepts (as taught for example in the course Information Security or in the course Cryptography Foundations) is useful, but not required.
263-2925-00L	Program Analysis for System Security and Reliability	W	7 credits	2V + 1U + 3A	M. Vechev
Abstract	Security issues in modern systems (blockchains, datacenters, deep learning, etc.) result in billions of losses due to hacks and system downtime. This course introduces fundamental techniques (ranging from automated analysis, machine learning, synthesis, zero-knowledge and their combinations) that can be applied in practice so to build more secure and reliable modern systems.