Suchergebnis: Katalogdaten im Frühjahrssemester 2021
Cyber Security Master ![]() | ||||||
![]() | ||||||
![]() ![]() | ||||||
Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
---|---|---|---|---|---|---|
263-4660-00L | Applied Cryptography ![]() ![]() Number of participants limited to 150. | W | 8 KP | 3V + 2U + 2P | K. Paterson | |
Kurzbeschreibung | 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. | |||||
Lernziel | 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. | |||||
Inhalt | 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. | |||||
Literatur | Textbook: Boneh and Shoup, “A Graduate Course in Applied Cryptography”, https://crypto.stanford.edu/~dabo/cryptobook/BonehShoup_0_4.pdf. | |||||
Voraussetzungen / Besonderes | 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. | |||||
![]() ![]() | ||||||
Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
252-0408-00L | Cryptographic Protocols ![]() | W | 6 KP | 2V + 2U + 1A | M. Hirt, U. Maurer | |
Kurzbeschreibung | 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. | |||||
Lernziel | Indroduction to a very active research area with many gems and paradoxical results. Spark interest in fundamental problems. | |||||
Inhalt | 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. | |||||
Skript | 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). | |||||
Voraussetzungen / Besonderes | 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 KP | 2V + 1U + 3A | M. Vechev | |
Kurzbeschreibung | 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. | |||||
Lernziel | * Understand the fundamental techniques used to create modern security and reliability analysis engines that are used worldwide. * Understand how symbolic techniques are combined with machine learning (e.g., deep learning, reinforcement learning) so to create new kinds of learning-based analyzers. * Understand how to quantify and fix security and reliability issues in modern deep learning models. * Understand open research questions from both theoretical and practical perspectives. | |||||
Inhalt | Please see: https://www.sri.inf.ethz.ch/teaching/pass2021 for detailed course content. | |||||
263-4600-00L | Formal Methods for Information Security ![]() | W | 5 KP | 2V + 1U + 1A | S. Krstic, R. Sasse, C. Sprenger | |
Kurzbeschreibung | The course focuses on formal methods for the modeling and analysis of security protocols for critical systems, ranging from authentication protocols for network security to electronic voting protocols and online banking. In addition, we will also introduce the notions of non-interference and runtime monitoring. | |||||
Lernziel | The students will learn the key ideas and theoretical foundations of formal modeling and analysis of security protocols. The students will complement their theoretical knowledge by solving practical exercises, completing a small project, and using state-of-the-art tools. The students also learn the fundamentals of non-interference and runtime monitoring. | |||||
Inhalt | The course treats formal methods mainly for the modeling and analysis of security protocols. Cryptographic protocols (such as SSL/TLS, SSH, Kerberos, SAML single-sign on, and IPSec) form the basis for secure communication and business processes. Numerous attacks on published protocols show that the design of cryptographic protocols is extremely error-prone. A rigorous analysis of these protocols is therefore indispensable, and manual analysis is insufficient. The lectures cover the theoretical basis for the (tool-supported) formal modeling and analysis of such protocols. Specifically, we discuss their operational semantics, the formalization of security properties, and techniques and algorithms for their verification. The second part of this course will cover a selection of advanced topics in security protocols such as abstraction techniques for efficient verification, secure communication with humans, the link between symbolic protocol models and cryptographic models as well as RFID protocols (a staple of the Internet of Things) and electronic voting protocols, including the relevant privacy properties. Moreover, we will give an introduction to two additional topics: non-interference as a general notion of secure systems, both from a semantic and a programming language perspective (type system), and runtime verification/monitoring to detect violations of security policies expressed as trace properties. | |||||
263-4656-00L | Digital Signatures ![]() | W | 5 KP | 2V + 2A | D. Hofheinz | |
Kurzbeschreibung | Digital signatures as one central cryptographic building block. Different security goals and security definitions for digital signatures, followed by a variety of popular and fundamental signature schemes with their security analyses. | |||||
Lernziel | The student knows a variety of techniques to construct and analyze the security of digital signature schemes. This includes modularity as a central tool of constructing secure schemes, and reductions as a central tool to proving the security of schemes. | |||||
Inhalt | We will start with several definitions of security for signature schemes, and investigate the relations among them. We will proceed to generic (but inefficient) constructions of secure signatures, and then move on to a number of efficient schemes based on concrete computational hardness assumptions. On the way, we will get to know paradigms such as hash-then-sign, one-time signatures, and chameleon hashing as central tools to construct secure signatures. | |||||
Literatur | Jonathan Katz, "Digital Signatures." | |||||
Voraussetzungen / Besonderes | Ideally, students will have taken the D-INFK Bachelors course "Information Security" or an equivalent course at Bachelors level. | |||||
![]() ![]() | ||||||
Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
252-2603-00L | Seminar on Systems Security ![]() ![]() Number of participants limited to 22. The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. | W | 2 KP | 2S | S. Shinde | |
Kurzbeschreibung | The seminar will focus on fundamental and recent topics in systems security. | |||||
Lernziel | The learning objective is to analyze selected research papers published at top systems+security venues and then identify open problems in this space. The seminar will achieve this via several components: reading papers, technical presentations, writing analysis and critique summaries, class discussions, and exploring potential research topics. | |||||
Inhalt | Each student will pick one paper from the selected list, present it in the class, and lead the discussion for that paper. All students will read at most two research papers per week and submit their critique summaries before each class. | |||||
Voraussetzungen / Besonderes | Students who are either interested in security research or are exploring thesis topics are highly encouraged to take this course. Students with systems/architecture/verification/PL expertise and basic security understanding are welcome. | |||||
263-4651-00L | Current Topics in Cryptography ![]() ![]() Number of participants limited to 24. The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. | W | 2 KP | 2S | D. Hofheinz, U. Maurer, K. Paterson | |
Kurzbeschreibung | In this seminar course, students present and discuss a variety of recent research papers in Cryptography. | |||||
Lernziel | Independent study of scientific literature and assessment of its contributions as well as learning and practicing presentation techniques. | |||||
Inhalt | The course lecturers will provide a list of papers from which students will select. | |||||
Literatur | The reading list will be published on the course website. | |||||
Voraussetzungen / Besonderes | Ideally, students will have taken the D-INFK Bachelors course “Information Security" or an equivalent course at Bachelors level. Ideally, they will have attended or will attend in parallel the Masters course in "Applied Cryptography”. |
Seite 1 von 1