Esfandiar Mohammadi

Orcid: 0000-0002-2799-8128

Affiliations:
  • University of Lübeck, Germany
  • Saarland University, Saarbrücken, Germany (former)


According to our database1, Esfandiar Mohammadi authored at least 32 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
MixFlow: Assessing Mixnets Anonymity with Contrastive Architectures and Semantic Network Information.
IACR Cryptol. ePrint Arch., 2023

A Toolchain for Privacy-Preserving Distributed Aggregation on Edge-Devices.
CoRR, 2023

S-GBDT: Frugal Differentially Private Gradient Boosting Decision Trees.
CoRR, 2023

DPM: Clustering Sensitive Data through Separation.
CoRR, 2023

Towards Privacy and Utility in Tourette TIC Detection Through Pretraining Based on Publicly Available Video Data of Healthy Subjects.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Single SMPC Invocation DPHelmet: Differentially Private Distributed Learning on a Large Scale.
CoRR, 2022

Responsible and Regulatory Conform Machine Learning for Medicine: A Survey of Challenges and Solutions.
IEEE Access, 2022

2021
Divide and Funnel: a Scaling Technique for Mix-Networks.
IACR Cryptol. ePrint Arch., 2021

Learning Numeric Optimal Differentially Private Truncated Additive Mechanisms.
CoRR, 2021

Responsible and Regulatory Conform Machine Learning for Medicine: A Survey of Technical Challenges and Solutions.
CoRR, 2021

2020
Comprehensive Anonymity Trilemma: User Coordination is not enough.
Proc. Priv. Enhancing Technol., 2020

2019
Privacy Loss Classes: The Central Limit Theorem in Differential Privacy.
Proc. Priv. Enhancing Technol., 2019

Passive and active attackers in noiseless privacy.
CoRR, 2019

Deniable Upload and Download via Passive Participation.
Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, 2019

2018
PrivacyBuDe: Privacy Buckets Demo Tight Differential Privacy Guarantees made Simple.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

Tight on Budget?: Tight Bounds for r-Fold Approximate Differential Privacy.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
CoverUp: Privacy Through "Forced" Participation in Anonymous Communication Networks.
IACR Cryptol. ePrint Arch., 2017

Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead, Low Latency - Choose Two.
IACR Cryptol. ePrint Arch., 2017

Ratio Buckets: A Numeric Method for r-Fold Tight Differential Privacy.
IACR Cryptol. ePrint Arch., 2017

2016
Abstracting cryptographic protocols.
PhD thesis, 2016

AnoA: A Framework for Analyzing Anonymous Communication Protocols.
J. Priv. Confidentiality, 2016

Computational Soundness for Dalvik Bytecode.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Computational Soundness for Interactive Primitives.
Proceedings of the Computer Security - ESORICS 2015, 2015

Symbolic Malleable Zero-Knowledge Proofs.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

POSTER: In the Net of the Spider: Measuring the Anonymity-Impact of Network-level Adversaries Against Tor.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
(Nothing else) MATor(s): Monitoring the Anonymity of Tor's Path Selection.
IACR Cryptol. ePrint Arch., 2014

Computational Soundness Results for ProVerif - Bridging the Gap from Trace Properties to Uniformity.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

2013
TUC: Time-sensitive and Modular Analysis of Anonymous Communication.
IACR Cryptol. ePrint Arch., 2013

Privacy-Preserving Accountable Computation.
Proceedings of the Computer Security - ESORICS 2013, 2013

2012
Ace: an efficient key-exchange protocol for onion routing.
Proceedings of the 11th annual ACM Workshop on Privacy in the Electronic Society, 2012

2011
Provably Secure and Practical Onion Routing.
IACR Cryptol. ePrint Arch., 2011

2010
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010


  Loading...