vix.ing · top · new · best · stats · spec

Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds

2016/05/06 by Mark Bun, Thomas Steinke, Bun, Mark +1 · 41 citations
Computer Science · Social Sciences · #Cryptography and Data Security #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Theory (cs.IT) #Machine Learning (cs.LG) #Privacy, Security, and Data Protection #Privacy-Preserving Technologies in Data

paper · pdf · doi:10.48550/arxiv.1605.02065

openalex publication_date 2016/05/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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

Cited by

Related