VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Cryptographic Protocols
Last Updated: 2026-02-05 16:38:19
Abstract
In a cryptographic protocol, a set of parties wants to achieve some common goal, while some of the parties are dishonest. Most prominent example of a cryptographic protocol is multi-party computation, where the parties compute an arbitrary (but fixed) function of their inputs, while maintaining the secrecy of the inputs and the correctness of the outputs even if some of the parties try to cheat.
Objective
To know and understand a selection of cryptographic protocols and to be able to analyze and prove their security and efficiency.
Content
The selection of considered protocols varies. Currently, we consider multi-party computation, secret-sharing, broadcast and Byzantine agreement. We look at both the synchronous and the asynchronous communication model, and focus on simple protocols as well as on highly-efficient protocols.
Resources
Lecture Notes
We provide handouts of the slides. For some of the topics, we alsoprovide papers and/or lecture notes.
Learning Materials (Links)
- Main link
- Information
General Information
- Language
- English
- Levels
- BSC , DZ , SHE , MSC , WBZ
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- oral 20 minutes
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Cryptographic Protocols |
|
2 h weekly |
| exercise | Cryptographic Protocols |
|
2 h weekly |
| independent project | Cryptographic Protocols | No time listed | 1 h weekly |
Offered In
-
-
-
Selection: Theoretical Computer Science (In the Bachelor's programme in Mathematics (Programme Regulations 2016) 401-3052-05L Graph Theory is eligible as an elective course, but only if 401-3052-10L Graph Theory isn't recognised for credits (neither in the Bachelor's nor in the Master's programme). For the category assignment take contact with the Study Administration Office ( ) after having received the credits.)
-
-
-
Computer Science TC (Detailed information on the programme at: )
-
Computer Science Teaching Diploma (More informations at : )
-
-
-
-
Electives (For the Master's degree in Applied Mathematics the following additional condition (not manifest in myStudies) must be obeyed: At least 14 of the required 26 credits from core courses and electives must be acquired in areas of applied mathematics and further application-oriented fields.)
-
-
Selection: Theoretical Computer Science, Discrete Mathematics (In the Master's programme in Mathematics 401-3052-05L Graph Theory is eligible as an elective course, but only if 401-3052-10L Graph Theory isn't recognised for credits (neither in the Bachelor's nor in the Master's programme). For the category assignment take contact with the Study Administration Office ( ) after having received the credits.)
-
-
-
-
-
-
Track: Computers and Networks (The core courses and specialization courses below are a selection for students who wish to specialize in the area of "Computers and Networks", see . The individual study plan is subject to the tutor's approval.)
-
Specialization Courses (These specialization courses are particularly recommended for the area of "Computers and Networks", but you are free to choose courses from any other field in agreement with your tutor. A minimum of 40 credits must be obtained from specialization courses during the Master's Programme.)
-
-
-
-
Major Courses (A total of 42 CP must be achieved form courses during the Master Program. The individual study plan is subject to the tutor's approval.)
-
-
Recommended Subjects (These courses are recommended, but you are free to choose courses from any other special field. Please consult your tutor.)
-
-
-
-
-
-
-