Esfandiar Mohammadi
Ph.D. |


  • Building E9.1
  • +49 681 302 57372
  • +49 681 302 57365
  • mohammadi(aeht)cs.uni-saarland.de
  • Personal Webpage

Curriculum Vitae

'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.

Projects

AnoA

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.

CoSP: A General Framework for Computational Soundness Proofs

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.

Publications

2015

Boxify: Full-fledged App Sandboxing for Stock Android

2014

(Nothing else) MATor(s): Monitoring the Anonymity of Tor's Path Selection

TUC: Time-sensitive and Modular Analysis of Anonymous Communication

Zero-Communication Seed Establishment for Anti-Jamming Techniques

Computational Soundness Results for ProVerif - Bridging the Gap from Trace Properties to Uniformity

2013

AnoA: A Framework For Analyzing Anonymous Communication Protocols

Privacy-Preserving Accountable Computation

2012

Ace: An Efficient Key-Exchange Protocol for Onion Routing

Provably Secure and Practical Onion Routing

2010

Computationally Sound Abstraction and Verification of Secure Multi-Party Computations