The complexity of verifying loop-free programs as differentially private
From MaRDI portal
Cites work
- Approximate counting in SMT and value estimation for probabilistic programs
- Asymmetric Distances for Approximate Differential Privacy
- Bisimilarity distances for approximate differential privacy
- Boosting and differential privacy
- Distance makes the types grow stronger: a calculus for differential privacy
- Formal verification of differential privacy for interactive systems (extended abstract)
- Generalized Bisimulation Metrics
- Higher-order approximate relational refinement types for mechanism design and differential privacy
- scientific article; zbMATH DE number 3915608 (Why is no real title available?)
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- LightDP: towards automating differential privacy proofs
- On the relation between differential privacy and quantitative information flow
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- PP is as Hard as the Polynomial-Time Hierarchy
- Probabilistic relational reasoning for differential privacy
- Proving differential privacy via probabilistic couplings
- Randomized response: a survey technique for eliminating evasive answer bias
- Satisfiability modulo counting
- Semantics of probabilistic programs
- Testing and reconstruction of Lipschitz functions with applications to data privacy
- Testing the Lipschitz property over product distributions with applications to data privacy
- The complexity of computing the optimal composition of differential privacy
- Theory of Cryptography
- Universal equivalence and majority of probabilistic programs over finite fields
This page was built for publication: The complexity of verifying loop-free programs as differentially private
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842441)
