192.059 Formal Methods for Security and Privacy
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2019S, VU, 4.0h, 6.0EC


  • Semester hours: 4.0
  • Credits: 6.0
  • Type: VU Lecture and Exercise

Aim of course

Writing secure code is a challenging, since one has to make sure that
attackers cannot interfere with the program execution in order to
steal confidential data or to perform unauthorized, security-critical
operations. This task is particularly hard for various reasons:
cryptography is often required to protect messages while
in transit over the network, 
programming languages (e.g., JavaScript) often feature a sophisticated and not clearly
defined semantics, and development environments (e.g., mobile OS,
web platforms, and smart contracts) are extremely complex and offer a large attack

In this course, students will learn the semantic foundations of
computer security. In particular, they will study the state-of-the-art
formal methods for the verification of security and privacy properties.  

These verification techniques are based on type systems and SMT-solving: students will study their foundations and learn how to apply them in various domains of interest, such as cryptographic protocols, source code, bytecode (e.g., Android and Ethereum). 

For instance, students will study and have hands-on experience on ProVerif, a state-of-the-art cryptographic protocol verifier, and F*, a typed programming language successfully used to verify  TLS 1.3 implementations as well as Firefox cryptographic libraries, thereby showing the
practical impact of formal methods for security and privacy in today's
software and systems (see also https://project-everest.github.io).

This is a research-oriented course, so it is particularly (but not
exclusively) indicated to those students who are potentially
interested in doing research at the intersection between logic &
verification and security & privacy, or to learn the state-of-the-art
in security and privacy verification.

Subject of course

- Analysis of Cryptographic Protocols via SMT solving (Applied
Pi-Calculus and ProVerif)
- Language-based Security (Non-Interference, Hyperproperties, and Side Channels)
- Secure JavaScript Programming (Semantics and Security Type Systems for
- Foundations of Security Static Analysis (Taint Analysis, Symbolic
Execution, SMT solving)
- Formal Security Analysis of Bytecode (Android, Ethereum Virtual Machine)

Additional information

ECTS Breakdown: 6 ECTS = 150 h

30h lectures, tutorials, exam

40h self-study

80h projects and exercises




Course dates

Wed08:45 - 12:0013.03.2019 - 26.06.2019FAV Hörsaal 1 - INF 192.059: Formal Methods for Security and Privacy
Wed08:45 - 12:0003.04.2019 - 05.06.2019Seminarraum Argentinierstrasse Lecture
Formal Methods for Security and Privacy - Single appointments
Wed13.03.201908:45 - 12:00FAV Hörsaal 1 - INF Lecture (Type Systems for Cryptographic Protocols)
Wed20.03.201908:45 - 12:00FAV Hörsaal 1 - INF Lecture (ProVerif)
Wed27.03.201908:45 - 12:00FAV Hörsaal 1 - INF Lecture (Observational Equivalence)
Wed03.04.201908:45 - 12:00Seminarraum Argentinierstrasse Tutorial (ProVerif)
Wed08.05.201908:45 - 12:00FAV Hörsaal 1 - INF Lecture (Information Flow)
Wed15.05.201908:45 - 12:00FAV Hörsaal 1 - INF Tutorial (Z3)
Wed22.05.201908:45 - 12:00FAV Hörsaal 1 - INF Lecture (Bytecode Analysis)
Wed29.05.201908:45 - 12:00FAV Hörsaal 1 - INF Tutorial (F*)
Wed05.06.201908:45 - 12:00Seminarraum Argentinierstrasse Formal Methods for Web Security
Wed12.06.201908:45 - 12:00FAV Hörsaal 1 - INF Backup
Wed19.06.201908:45 - 12:00FAV Hörsaal 1 - INF Backup
Wed26.06.201908:45 - 12:00FAV Hörsaal 1 - INF Exam

Examination modalities

Projects and final exam.


Course registration

Begin End Deregistration end
11.02.2019 13:00 24.03.2019 13:00 24.03.2019 13:00



No lecture notes are available.

Previous knowledge

Some background in verification and security is ideal, but motivated students with a good background in either of them are also welcome to the course.