
Private Authentication and Messaging  since 2023  Universität der Bundeswehr München
Contents: authenticated key establishment, incl. BR93 model, key transport with PKE/KEMs, key exchange (DH, SIGMA, HMQV, RingLWE KEMs), key derivation (HKDF),
secure channels with AEAD, secure and private messaging (double ratchet, asynchronicity, Signal protocol, deniability), group key establishment (group key
transport, LKH, OFT, group key exchange, BurmesterDesmedt GKE, treebased DH, robustness in GKE), messagelayer security (TreeKEM, OpenMLS), passwordbased key exchange
(symmetric/asymmetric/strong PAKE, PACE and OPAQUE protocols, SPHF and VOPRF techniques, TPASS, Group PAKE), secret handshakes / affiliationhiding key exchange
(CAoblivious encryption, dynamic matching, multigroup protocols), group signatures (general constructions, revocation, VLR and dynamic accumulators), anonymous credentials (generic constructions, CL signatures),
ring signatures (incl. DualRing), anonymous communications (DC nets, mix nets, onion routing, TOR protocol).

Private Data Processing  since 2023  Universität der Bundeswehr München
Contents: secret sharing / threshold cryptography, oblivious transfer (incl. OT extensions, frameworks), secure 2PC (Yao's garbled circuits, GMW, optimisation techniques),
secure MPC (GMWN, BGW, BMR), private function evaluation (from universal circuits, homomorphic encryption, oblivious switching networks),
(fully) homomorphic encryption (incl. Gentry's blueprint, bootstrapping, key switching, (R)LWE, BGV), private information retrieval (multiserver, RAIDPIR, singleserver from (F)HE),
private set intersection (incl. based on OT, SortCompareShuffle, circuit phasing, Cuckoo hashing, unbalanced PSI from OPRF, Bloom filters), searchable encryption (incl. static/dynamic SSE, PEKS from IBE).

Modern Cryptography  since 2022  Universität der Bundeswehr München
Contents: perfect/statistical/computational security (definitions and proofs), oneway functions, pseudorandom functions,
block ciphers (incl. AES) with operation modes, hash functions (incl. SHA3), message authentication codes (incl. HMAC), mathematics for
cryptography (incl. integer factorization, discrete logarithms, elliptic curves, bilinear maps),
publickey encryption (incl. RSA, ElGamal, Paillier, CramerShoup, Linear encryption, KEM/DEM framework), authenticated encryption,
digital signatures (incl. RSA, (EC)DSA, Schnorr, BLS, BB, Waters, blind signatures), hash & sign,
commitments, identification protocols and zeroknowledge proofs.

Symmetric Cryptography  2014  2016, 2019  2022  University of Surrey
Contents: historical ciphers (incl. cryptanalysis), information entropy, unicity distance, perfect/statistical secrecy, onetime pad, oneway functions, pseudorandom generators and functions, computational security, block ciphers (incl. 3DES, AES), operation modes,
hash functions (incl. SHA1, Keccak), message authentication codes (incl. HMAC), security definitions and proofs, implementations.

Asymmetric Cryptography  2014  2019  University of Surrey
Contents: mathematical background (incl. modular arithmetic, integer factorization, cyclic groups, discrete logarithms), publickey encryption (incl. RSA, ElGamal, Paillier, CramerShoup), authenticated/homomorphic/hybrid encryption, digital signatures (incl. RSA, DSA, Schnorr), hash & sign, blind signatures,
key transport/exchange (incl. DiffieHellman), secret sharing, threshold cryptography, commitments, identification protocols, zeroknowledge proofs, security definitions and proofs, implementations.

Data Structures and Algorithms  2017  2020  University of Surrey
Contents: data structures (incl. arrays, lists, queues, stacks, binary trees, heaps, graphs), algorithmic complexity (incl. Big Oh, Big Omega, Big Theta, little Oh),
recursive algorithms, sorting algorithms (Bubble Sort, Insertion Sort, Quicksort, Heapsort, Radixsort), graph algorithms for minimal spanning trees (Prim, Kruskal) and shortest paths (Dijkstra), implementations using Java.

Introduction to Cryptography  2019  2020  University College London
This module was delivered for MSc and BSc students at UCL as an external teaching activity.
Contents: historical ciphers, perfect/statistical secrecy, oneway functions, pseudorandom generators, symmetric encryption, hash functions, message authentication codes, numbertheoretic problems, asymmetric encryption, digital signatures, authenticated encryption, key establishment, elliptic curve cryptography, pairingbased cryptography.

Web Hacking and Countermeasures  2013  2014  University of Surrey
Contents: background on hacking, shadow economy, types of attacks, malware, network layer security (ARP, IP, TCP), IPsec protocol, transport layer security (TLS, PKI, X.509), application layer security (XSS, CSRF, SQL injection attacks), human factors in security (passwords, phishing, social engineering attacks), security tools.

Advanced Algorithms  2012  2014  University of Surrey
Contents: divide & conquer, greedy algorithms, dynamic programming, branch & bound, backtracking, linear programming, P vs. NP, NPcompleteness, algorithms for selected NP problems, algorithms for number theory.

Applied Cryptography  2010  2012  TU Darmstadt
Contents: In a group of 23, students were researching some problem under supervision and had to submit a research article based on their results. A paper coauthored by the students of the course was published at ACM ASIACCS 2013.

Introduction to Cryptography  2010  2011  TU Darmstadt
This lecture received ETeaching Award 2010 from Carlo and Karin GierschStiftung at TU Darmstadt.
Contents: historical ciphers, perfect/statistical secrecy, oneway functions, pseudorandom generators, symmetric encryption, hash functions, message authentication codes, numbertheoretic problems, asymmetric encryption, digital signatures, authenticated encryption, key establishment, elliptic curve cryptography, pairingbased cryptography.

Cryptographic Protocols  Design, Analysis, Applications  2009  2012  TU Darmstadt
Contents: design and analysis of cryptographic protocols, commitments, coinflipping, identification protocols, zeroknowledge proofs, key establishment, secret handshakes, multisignatures, aggregate signatures, group signatures, ring signatures, secret sharing, threshold cryptography.

GroupOriented Communication and Application Security  since 2008  isits International School of IT Security
Distance lecture using elearning plattform for the MSc in Applied IT Security degree.
Contents: group applications, group communication systems (incl. safety, ordering, reliability), group admission and membership control, group key distribution/exchange protocols, grouporiented digital signatures.

Cryptography and Data Security  2006  2008  Industry tutorial at Academy of Ruhr University Bochum