Navigation To modulepage
Display language

Foundations of Cryptographic Protocols

6

English

#41003 / #1

Seit SoSe 2020

Fakultät IV

EN 6

Institut für Wirtschaftsinformatik und Quantitative Methoden

34361500 FG Software and Business Engineering

Weber, Ingo

Heindel, Tobias

heindel@tu-berlin.de

No information

POS-Nummer PORD-Nummer Modultitel
2349591 42152 Foundations of Cryptographic Protocols

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.

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.

Module Components

Pflichtgruppe:

All Courses are mandatory.

Course Name Type Number Cycle Language SWS
Foundations of Cryptographic Protocols IV 3436 L 10634 SS English 4

Workload and Credit Points

Foundations of Cryptographic Protocols (IV):

Workload description Multiplier Hours Total
Attendance (lecture) 15.0 3.0h 45.0h
Attendance (Übung) 15.0 1.0h 15.0h
Exam preparation 2.0 7.5h 15.0h
Homework 6.0 10.0h 60.0h
Pre/post processing 15.0 3.0h 45.0h
180.0h(~6 LP)
The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

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 test application:

No information

Module completion

Grading

graded

Type of exam

Portfolio examination

Type of portfolio examination

100 points in total

Language

English

Test elements

Name Points Categorie 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

Grading scale

1.01.31.72.02.32.73.03.33.74.0
95.090.085.080.075.070.065.060.055.050.0

Test description (Module completion)

No information

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Sommersemester.

Maximum Number of Participants

The maximum capacity of students 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

Availability:  unavailable

Electronical lecture notes

Availability:  available

Literature

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 Degree Programs

This moduleversion is used in the following modulelists:

Miscellaneous

No information