Proving Differential Privacy via Probabilistic Couplings

DOI10.1145/2933575.2934554zbMath1401.68184arXiv1601.05047OpenAlexW2295961883MaRDI QIDQ4635938

Justin Hsu, Marco Gaboardi, Pierre-Yves Strub, Benjamin Grégoire, Gilles Barthe

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.05047

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Unnamed Item ⋮ Verifying Pufferfish privacy in hidden Markov models ⋮ Model checking differentially private properties ⋮ Divergences on monads for relational program logics ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Coupled relational symbolic execution for differential privacy ⋮ Graded Hoare logic and its categorical semantics ⋮ Approximate relational Hoare logic for continuous random samplings ⋮ Strassen's theorem for quantum couplings

This page was built for publication: Proving Differential Privacy via Probabilistic Couplings