Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds

Conference paper

DOI: 10.1007/978-3-662-53641-4_24

Volume 9985 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bun M., Steinke T. (2016) Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds. In: Hirt M., Smith A. (eds) Theory of Cryptography. TCC 2016. Lecture Notes in Computer Science, vol 9985. Springer, Berlin, Heidelberg

Abstract

“Concentrated differential privacy” was recently introduced by Dwork and Rothblum as a relaxation of differential privacy, which permits sharper analyses of many privacy-preserving computations. We present an alternative formulation of the concept of concentrated differential privacy in terms of the Rényi divergence between the distributions obtained by running an algorithm on neighboring inputs. With this reformulation in hand, we prove sharper quantitative results, establish lower bounds, and raise a few new questions. We also unify this approach with approximate differential privacy by giving an appropriate definition of “approximate concentrated differential privacy”.

Copyright information

© International Association for Cryptologic Research 2016

Authors and Affiliations

  1. 1.John A. Paulson School of Engineering and Applied SciencesHarvard UniversityCambridgeUSA
  2. 2.IBM, Almaden Research CenterSan JoseUSA