Asymmetric Distances for Approximate Differential Privacy
From MaRDI portal
Publication:5875371
DOI10.4230/LIPIcs.CONCUR.2019.10OpenAlexW2971047472MaRDI QIDQ5875371
Andrzej S. Murawski, David Purser, Dmitry Chistikov
Publication date: 3 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2019.10
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- Bisimulation through probabilistic testing
- Geometric algorithms and combinatorial optimization
- A lattice-theoretical fixpoint theorem and its applications
- The Complexity of Computing the Optimal Composition of Differential Privacy
- On the Complexity of Computing Probabilistic Bisimilarity
- Probabilistic relational reasoning for differential privacy
- On the Complexity of Nash Equilibria and Other Fixed Points
- Generalized Bisimulation Metrics
- The Algorithmic Foundations of Differential Privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Computing Probabilistic Bisimilarity Distances via Policy Iteration
- On the total variation distance of labelled Markov chains
- On Computing the Total Variation Distance of Hidden Markov Models.
- On-the-Fly Exact Computation of Bisimilarity Distances
- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
- Asymmetric Distances for Approximate Differential Privacy
- Theory of Cryptography
- Bisimilarity distances for approximate differential privacy
This page was built for publication: Asymmetric Distances for Approximate Differential Privacy