SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1605.02065 · 2016

Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

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

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1605.02065")
get_code_for_paper("1605.02065")
have("1605.02065")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1605.02065.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1605.02065.svg)](https://syntology.ai/paper/1605.02065)

Connect an agent — have() is free.