Coupled relational symbolic execution for differential privacy

From MaRDI portal
Publication:2233459

DOI10.1007/978-3-030-72019-3_8zbMATH Open1473.68072arXiv2007.12987OpenAlexW3150939926MaRDI QIDQ2233459FDOQ2233459


Authors: Gian Pietro Farina, Stephen Chong, Marco Gaboardi Edit this on Wikidata


Publication date: 18 October 2021

Abstract: Differential privacy is a de facto standard in data privacy with applications in the private and public sectors. Most of the techniques that achieve differential privacy are based on a judicious use of randomness. However, reasoning about randomized programs is difficult and error prone. For this reason, several techniques have been recently proposed to support designer in proving programs differentially private or in finding violations to it. In this work we propose a technique based on symbolic execution for reasoning about differential privacy. Symbolic execution is a classic technique used for testing, counterexample generation and to prove absence of bugs. Here we use symbolic execution to support these tasks specifically for differential privacy. To achieve this goal, we leverage two ideas that have been already proven useful in formal reasoning about differential privacy: relational reasoning and probabilistic coupling. Our technique integrates these two ideas and shows how such a combination can be used to both verify and find violations to differential privacy.


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




Recommendations



Cites Work


Cited In (5)





This page was built for publication: Coupled relational symbolic execution for differential privacy

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