Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
DOI10.1016/j.entcs.2011.09.015zbMath1342.68212OpenAlexW1668939463WikidataQ113318232 ScholiaQ113318232MaRDI QIDQ5739351
Anupam Datta, Dilsun Kaynar, Michael Carl Tschantz
Publication date: 15 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2011.09.015
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (4)
Uses Software
Cites Work
- Analyzing security protocols using time-bounded task-PIOAs
- Probabilistic weak simulation is decidable in polynomial time
- Forward and backward simulations. I. Untimed Systems
- Deciding bisimilarity and similarity for probabilistic processes.
- The reactive simulatability (RSIM) framework for asynchronous systems
- Differential privacy under continual observation
- Computational Differential Privacy
- Assessing security threats of looping constructs
- Differential Privacy: A Survey of Results
- Computing the Leakage of Information-Hiding Systems
- The Differential Privacy Frontier (Extended Abstract)
- Computational Probabilistic Non-interference
- Universally utility-maximizing privacy mechanisms
- Distance makes the types grow stronger
- Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
- Theory of Cryptography
- Differential Privacy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)