Selected Publications: Dash: Accelerating Distributed Private Convolutional Neural Network Inference with Arithmetic Garbled Circuits (TCHES 2025), Polynomial sharings on two secrets: Buy one, get one free (TCHES 2024), TeeJam: Sub-Cache-Line Leakages Strike Back (TCHES 2024), Combined Fault and Leakage Resilience: Composability, Constructions and Compiler (CRYPTO 2023), Util: : Lookup: Exploiting Key Decoding in Cryptographic Libraries (CCS 2021), Side-Channel Protections for Picnic Signatures (TCHES 2021), SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis (CCS 2020), Online Bin Covering with Limited Migration (ESA 2019, JCSS), On the Gold Standard for Security of Universal Steganography (EUROCRYPT 2018), Practical Access to Dynamic Programming on Tree Decompositions (ESA 2018, best student paper award), Algorithm Substitution Attacks from a Steganographic Perspective (CCS 2017), Learning Residual Alternating Automata (AAAI 2017, Inf. Comput.)
Research Experience
Active researcher and reviewer for many conferences and journals; Editorial Membership: IPL; PC Membership (selected): CHES 2022—2025, USENIX 2024, CiC 2024—2025, ACNS 2025, INDOCRYPT 2021, PACE 2023 (chair),…; Steering Committee: Parameterized Algorithms and Computational Experiments (PACE); External Reviewer Conferences (selected): STOC; SODA, CRYPTO; EUROCRYPT; Usenix; S&P; ICALP; STACS, ESA, …; External Reviewer Journals (selected): Algorithmica; Int. J. Inform. Secur.; JCSS; JEA; Trans. Inf. Forensics Secur., …
Education
Professor, 2024 - Present, TH Lübeck; PhD in Computer Science, 2012 - 2018, University of Lübeck; M.Sc. in Computer Science, 2010 - 2012, Kiel University; B.Sc. in Computer Science, 2007 - 2010, Kiel University.
Background
Research Interests: Cryptography, IT Security, Algorithms, Artificial Intelligence; Professional Field: Applied Mathematics and IT Security; Biography: His research interests revolve around intractable problems. On the one hand, he applies these problems to cryptography and steganography to enable secure communication. On the other hand, he tries to solve them with approaches such as approximation algorithms or fixed-parameter-tractability.