Asymmetric Distances for Approximate Differential Privacy

DOI10.4230/LIPICS.CONCUR.2019.10MaRDI QIDQ5875371zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

bisimilarity distancesdifferential privacylabelled Markov chains

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Bisimilarity distances for approximate differential privacy
• Comparing approximate and probabilistic differential privacy parameters
• Privacy-Preserving Computation of the Earth Mover’s Distance
• Distribution-invariant differential privacy
• Gaussian Differential Privacy
• On the geometry of differential privacy
• \(*\)-liftings for differential privacy
• Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
• Differentially Private Approximations of a Convex Hull in Low Dimensions.

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
• Asymmetric Distances for Approximate Differential Privacy
• Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
• Bisimilarity distances for approximate differential privacy
• Bisimulation through probabilistic testing
• Computing probabilistic bisimilarity distances via policy iteration
• Generalized Bisimulation Metrics
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 4060392 (Why is no real title available?)
• scientific article; zbMATH DE number 910913 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Metrics for labelled Markov processes
• On computing the total variation distance of hidden Markov models
• On the complexity of computing probabilistic bisimilarity
• On the Complexity of Nash Equilibria and Other Fixed Points
• On the total variation distance of labelled Markov chains
• On-the-fly exact computation of bisimilarity distances
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Probabilistic relational reasoning for differential privacy
• The algorithmic foundations of differential privacy
• The complexity of computing the optimal composition of differential privacy
• Theory of Cryptography

Cited in

(6)

• Privacy-preserving inverse distance weighted interpolation
• The big-O problem for labelled Markov chains and weighted automata
• The big-O problem
• Asymmetric Distances for Approximate Differential Privacy
• Comparing approximate and probabilistic differential privacy parameters
• The complexity of verifying loop-free programs as differentially private

This page was built for publication: Asymmetric Distances for Approximate Differential Privacy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875371)