- Building E9.1
- +49 681 302 57372
- +49 681 302 57365
- Personal Webpage
|'09 - '14||Doctorate in computer science, Saarland University, Saarbrücken.|
|'08 - '09||M.Sc. in computer science with distinction, Saarland University, Saarbrücken.|
|'04 - '08||B.Sc. in computer science, Saarland University, Saarbrücken.|
Anonymous communication (AC) protocols, such as the widely used Tor network, are an important tool for a privacy-aware usage of the internet. In this project, we develop a generic framework for analyzing and quantifying complex systems, such as Tor, and their different anonymity properties in a unified manner.
Dolev-Yao models of cryptographic operations constitute the foundation of many successful verification tools for security protocols. Many of these symbolic abstractions are computationally sound, i.e., the absence of attacks against the abstraction entails the security of suitable cryptographic realizations. CoSP is a general framework for conducting computational soundness proofs of symbolic models in a conceptually modular and generic way.