scientific article; zbMATH DE number 7147447
From MaRDI portal
Publication:5207055
zbMath1442.68099arXiv1705.00133MaRDI QIDQ5207055
Justin Hsu, Tetsuya Sato, Thomas Espitau, Gilles Barthe, Pierre-Yves Strub
Publication date: 3 January 2020
Full work available at URL: https://arxiv.org/abs/1705.00133
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Privacy of data (68P27)
Cites Work
- Unnamed Item
- Unnamed Item
- The Max-Flow Min-Cut theorem for countable networks
- Approximate relational Hoare logic for continuous random samplings
- Probabilistic relational reasoning for differential privacy
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
- Proving Differential Privacy via Probabilistic Couplings
- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
- The Existence of Probability Measures with Given Marginals
- Theory of Cryptography
- Information Theory and Statistics: A Tutorial
- Optimal Transport
- Constraint-based synthesis of coupling proofs
This page was built for publication:
