VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

252-0408-00L 6 Credits BSC , DZ , SHE , MSC , WBZ D-ITET , D-INFK , D-MATH
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Cryptographic Protocols

Lecturers & Examiners: Dr. Martin Hirt
VVZ CR 3.37

Last Updated: 2026-06-01 11:33:11

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)

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
  • Thu 10:15-12:00 (HG D 1.1)
  • 20.02 Date 10:15-12:00 (HG D 1.2)
2 h weekly
exercise Cryptographic Protocols
  • Thu 12:15-14:00 (HG D 1.1)
  • 20.02 Date 12:15-14:00 (HG D 1.2)
2 h weekly
independent project Cryptographic Protocols No time listed 1 h weekly

Offered In