Robust Optimization for Local Differential Privacy

Research output: Working paperPreprintAcademic

24 Downloads (Pure)

Abstract

We consider the setting of publishing data without leaking sensitive information. We do so in the framework of Robust Local Differential Privacy (RLDP). This ensures privacy for all distributions of the data in an uncertainty set. We formulate the problem of finding the optimal data release protocol as a robust optimization problem. By deriving closed-form expressions for the duals of the constraints involved we obtain a convex optimization problem. We compare the performance of four possible optimization problems depending on whether or not we require robustness in i) utility and ii) privacy.
Original languageEnglish
PublisherArXiv.org
Publication statusPublished - 10 May 2022

Keywords

  • cs.IT
  • cs.CR
  • math.IT
  • math.OC

Fingerprint

Dive into the research topics of 'Robust Optimization for Local Differential Privacy'. Together they form a unique fingerprint.

Cite this