Cryptographic Protocols


How do you authenticate online without disclosing any identity or password? Could a cloud service process encrypted data? How can individuals safeguard their privacy against ubiquitous online services? How do cryptographic voting protocols solve the conflicting goals of authorizing all voters while maintaining their privacy? Will Big Brother always be able to watch every one of your actions on the Internet, or can you hide your data from future cloud systems? Can one distribute a cryptographic operation among a group of participants such that any minority of them may try to cheat but will not succeed? How can two millionaires compute who is richer without disclosing their wealth to each other?

This course gives an introduction to the amazing world of cryptographic protocols with multilateral security. They realize such diverse goals as zero-knowledge proofs, secure multi-party computation, private online elections, auctions without trusted parties, distributed threshold cryptosystems and more. These methods have been developed over the last decades and start to find applications on the Internet today, ranging from nation-wide electronic voting and secure cloud platforms to cryptocurrencies and blockchains.


Code 11106/41106
Type Course
Site Bern
Track(s) T1 – Distributed Systems
T4 – Logic
Semester S2021


Lecturer(s) Christian Cachin
Language english
Course Page

The course page in ILIAS can be found at

Schedules and Rooms

Period Weekly
Schedule Wednesday, 14:15 - 17:00
Location UniBE, Engehaldenstrasse 8
Room 002

Additional information


First Lecture
The first lecture will take place online on Wednesday, 24.02.2021 at 14:15.

Students are expected to have background knowledge in cryptography, covering notions such as public-key encryption and digital signatures. Ideally they have taken the course “Cryptography,” which is offered in the Fall Semester immediately before, but this is not strictly required.