Foundations of Cryptographic ProtocolsModule description #41003 / Version 1
- 6 CP
- Portfolio examination
- Graded
- Summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #41003 / #1 |
|---|---|
| Validity | Summer semester 2020 – Summer semester 2022 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Weber, Ingo |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Wirtschaftsinformatik und Quantitative Methoden |
| Academic chair | 34361500 FG Software and Business Engineering (SBE) |
Contact
| Office | EN 6 |
|---|---|
| Contact person | Heindel, Tobias |
| E-mail address | heindel@tu-berlin.de |
| Website | Not specified |
Learning outcomes
The course aims to teach students to assess security properties of protocols, and describe possible scenarios in which they can function correctly based on methods from cryptography, process calculi, and formal verification. In particular, after completion of the course, students should be able to
* outline the role of cryptographic primitives, recall the standard assumptions about cryptographic primitives, and explain the dependencies of exchanged messages in protocols;
* justify why a given protocol satisfies the desired security properties and how they could be checked (automatically);
* summarize the relevant logical facts and mathematical theorems that are essential to prove the correctness of protocols;
* gauge the difficulty of the verification of a given security property, and recommend suitable standard methods accordingly;
* illustrate and explain the relevance of results from complexity theory.
* outline the role of cryptographic primitives, recall the standard assumptions about cryptographic primitives, and explain the dependencies of exchanged messages in protocols;
* justify why a given protocol satisfies the desired security properties and how they could be checked (automatically);
* summarize the relevant logical facts and mathematical theorems that are essential to prove the correctness of protocols;
* gauge the difficulty of the verification of a given security property, and recommend suitable standard methods accordingly;
* illustrate and explain the relevance of results from complexity theory.
Content
The module covers
1) basic cryptographic concepts, methods, and standards: one-time-pad, advanced encryption standard, RSA and prime number algorithms, one-way and hash functions;
2) examples of protocols and communication systems: interactive proof systems, zero knowledge proofs, secure multi-party computations;
3) formal specification and verification of cryptographic protocols: Dolev-Yao model, security flaws, applied pi-calcuil, model-checking, logic programming.
1) basic cryptographic concepts, methods, and standards: one-time-pad, advanced encryption standard, RSA and prime number algorithms, one-way and hash functions;
2) examples of protocols and communication systems: interactive proof systems, zero knowledge proofs, secure multi-party computations;
3) formal specification and verification of cryptographic protocols: Dolev-Yao model, security flaws, applied pi-calcuil, model-checking, logic programming.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Foundations of Cryptographic Protocols | Integrated course | 3436 L 10634 | Summer semester | [en] | 4 | ISIS |
Workload and credit points
Foundations of Cryptographic Protocols (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance (lecture) | 15 | 3 h | 45 h |
| Attendance (Übung) | 15 | 1 h | 15 h |
| Exam preparation | 2 | 7.5 h | 15 h |
| Homework | 6 | 10 h | 60 h |
| Pre/post processing | 15 | 3 h | 45 h |
| 180 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The main part of the course consists of bi-weekly blocks that start with a week of two lectures, followed by a week with one lecture and one practicum (Übung). During the final weeks of the semester, the course will focus on the use of verification tools and discussion of current research topics.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
The course presupposes familiarity with complexity theory, mathematical logic, probability theory, and arithmetic in fields.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| (Deliverable Assessment) Homework, 6 assignments | 25 | written | 2-3 pages each |
| (Examination) Mid term exam | 30 | written | 1 hour |
| (Examination) Final exam | 45 | written | 80 minutes |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
The maximum capacity of participants is 24.
Registration procedures
Registering for the exam is open to Master's students of the listed programs (and the respective specializations).
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available
Recommended literature
- John Talbot, Dominic Welsh: Complexity and Cryptography - An Introduction. Cambridge, 2006
- Christo H. Papadimitriou: Computational Complexity. Addison-Wesley, 1994
- Oded Goldreich: Foundations of Cryptography (Basic Applications). Cambridge University Press, 2004
- William Stallings: Cryptography and Network Security: Principles and Practice. Prentice-Hall, 2003
- Arto Salomaa: Public Key Cryptography. Springer, 1990
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified