Verifying Differential Privacy by Program Logic

Add to your list(s) Download to your calendar using vCal

• Marco Gaboardi
• Thursday 20 March 2014, 10:00-11:00
• Room 222, School of Computer Science.

If you have a question about this talk, please contact Vincent Cheval.

Differential Privacy is becoming a standard approach in data privacy: it offers ways to answer queries about sensitive information while providing strong, provable privacy guarantees, ensuring that the presence or absence of a single individual in the database has a negligible statistical effect on the query’s result. Many specific queries have been shown to be differentially private, but manually checking that a given query is differentially private can be both tedious and rather subtle. Moreover, this process becomes unfeasible when large programs are considered.

In this talk I will introduce the basics of differential privacy and some of the fundamental mechanisms for building differentially private programs. Additionally, I will present a verification approach based on Hoare Logic useful to certify a broad range of probabilistic programs as differentially private.

This talk is part of the Computer Security Seminars series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Security Seminars
• Room 222, School of Computer Science
• computer sience

Note that ex-directory lists are not shown.