| Publication | Date of Publication | Type |
|---|
Refinement Metrics for Quantitative Information Flow
| 2024-03-14 | Paper |
On the Additive Capacity Problem for Quantitative Information Flow
Quantitative Evaluation of Systems | 2023-06-28 | Paper |
Leakage and protocol composition in a game-theoretic perspective
| 2019-09-16 | Paper |
Up-to techniques for generalized bisimulation metrics
| 2018-03-21 | Paper |
Information leakage games
| 2017-10-27 | Paper |
On the Compositionality of Quantitative Information Flow
| 2017-10-12 | Paper |
Compositional methods for information-hiding
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Quantitative notions of leakage for one-try attacks
Electronic Notes in Theoretical Computer Science | 2016-05-10 | Paper |
Location privacy via geo-indistinguishability
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Epistemic strategies and games on concurrent processes
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Generalized Bisimulation Metrics
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Generalized differential privacy: regions of priors that admit robust optimal mechanisms
Lecture Notes in Computer Science | 2014-06-02 | Paper |
A monotonicity principle for information theory
Electronic Notes in Theoretical Computer Science | 2014-05-13 | Paper |
A differentially private mechanism of optimal utility for a region of priors
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Quantitative information flow and applications to differential privacy
Foundations of Security Analysis and Design VI | 2011-09-16 | Paper |
On the relation between differential privacy and quantitative information flow
Automata, Languages and Programming | 2011-07-07 | Paper |
Making random choices invisible to the scheduler
Information and Computation | 2010-06-25 | Paper |
Statistical measurement of information leakage
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Anonymity Protocols as Noisy Channels
Trustworthy Global Computing | 2009-03-05 | Paper |
Epistemic Strategies and Games on Concurrent Processes
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Making Random Choices Invisible to the Scheduler
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Anonymity protocols as noisy channels
Information and Computation | 2008-04-16 | Paper |
Compositional Methods for Information-Hiding
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
Theoretical Computer Science | 2007-12-14 | Paper |
Methods and Applications of Artificial Intelligence
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Probable innocence revisited
Theoretical Computer Science | 2007-01-09 | Paper |
Trustworthy Global Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
