Dennis Hofheinz: Catalogue data in Spring Semester 2020 |
Name | Prof. Dr. Dennis Hofheinz |
Field | Computer Science |
Address | Inst. f. Theoretische Informatik ETH Zürich, CAB E 78 Universitätstrasse 6 8092 Zürich SWITZERLAND |
Telephone | +41 44 632 40 29 |
hofheinz@inf.ethz.ch | |
URL | https://people.inf.ethz.ch/dhofheinz/ |
Department | Computer Science |
Relationship | Full Professor |
Number | Title | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|
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. | 2 credits | 2S | D. Hofheinz, U. Maurer, K. Paterson | |
Abstract | In this seminar course, students present and discuss a variety of recent research papers in Cryptography. | ||||
Learning objective | Independent study of scientific literature and assessment of its contributions as well as learning and practicing presentation techniques. | ||||
Content | The course lecturers will provide a list of papers from which students will select. | ||||
Literature | The reading list will be published on the course website. | ||||
Prerequisites / Notice | 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”. | ||||
263-4656-00L | Digital Signatures | 4 credits | 2V + 1A | D. Hofheinz | |
Abstract | 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. | ||||
Learning objective | 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. | ||||
Content | 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. | ||||
Literature | Jonathan Katz, "Digital Signatures." | ||||
Prerequisites / Notice | Ideally, students will have taken the D-INFK Bachelors course "Information Security" or an equivalent course at Bachelors level. |