Paper 2016/816

Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds

Mark Bun and Thomas Steinke


"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 Renyi 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."

Available format(s)
Publication info
Published by the IACR in TCC 2016
differential privacylower bounds
Contact author(s)
mbun @ seas harvard edu
tsteinke @ seas harvard edu
2016-08-26: received
Short URL
Creative Commons Attribution


      author = {Mark Bun and Thomas Steinke},
      title = {Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds},
      howpublished = {Cryptology ePrint Archive, Paper 2016/816},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.