pith. sign in

arxiv: 1603.01887 · v2 · pith:YB6GZPM2new · submitted 2016-03-06 · 💻 cs.DS · cs.CR

Concentrated Differential Privacy

classification 💻 cs.DS cs.CR
keywords privacydifferentialconcentratedrelaxationaccuracybettercompromisingcomputations
0
0 comments X
read the original abstract

We introduce Concentrated Differential Privacy, a relaxation of Differential Privacy enjoying better accuracy than both pure differential privacy and its popular "(epsilon,delta)" relaxation without compromising on cumulative privacy loss over multiple computations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions

    cs.LG 2026-05 unverdicted novelty 8.0

    Derives a federated van Trees lower bound under total clientwise sample-level zCDP for parameter estimation with squared l2 loss in federated learning protocols with arbitrary public-transcript interactions.

  2. Barriers to Counterfactual Credit Attribution for Autoregressive Models

    cs.LG 2026-05 unverdicted novelty 7.0

    CCA does not compose autoregressively and retrofitting requires exponential query complexity under weak optimality.

  3. Conformal-DP: A Density-Aware Mechanism for Differential Privacy over Riemannian Manifolds via Conformal Transformation

    cs.CR 2025-04 unverdicted novelty 7.0

    Conformal-DP applies conformal transformations to create a density-aware DP mechanism on Riemannian manifolds, proving ε-DP and deriving a closed-form geodesic error bound dependent only on density ratio and independe...

  4. Private Minimum Hellinger Distance Estimation via Hellinger Distance Differential Privacy

    math.ST 2025-01 unverdicted novelty 7.0

    Private minimum Hellinger distance estimators are introduced to satisfy Hellinger differential privacy while retaining robustness and efficiency properties.

  5. Edgeworth Accountant: An Analytical Approach to Differential Privacy Composition

    cs.CR 2022-06 unverdicted novelty 7.0

    The Edgeworth Accountant uses the Edgeworth expansion on privacy-loss log-likelihood ratios to derive closed-form non-asymptotic (ε, δ)-DP bounds for composed noise-addition mechanisms.

  6. Beyond Membership: Limitations of Add/Remove Adjacency in Differential Privacy

    cs.CR 2025-11 unverdicted novelty 6.0

    Add/remove adjacency in DP overstates attribute privacy relative to substitute adjacency; new auditing attacks confirm inconsistency with add/remove reports but consistency with substitute accounting.

  7. The 2020 US Decennial Census is more private than you (might) think

    cs.CR 2024-10 unverdicted novelty 6.0

    Using f-differential privacy to track losses across eight geographic levels, the 2020 Census provides stronger privacy than its nominal guarantees, enabling 15.08-24.82% noise variance reduction.

  8. Privacy Preserving Reinforcement Learning with One-Sided Feedback

    cs.LG 2026-05 unverdicted novelty 5.0

    POOL is a new RL algorithm that adds privacy protection in continuous spaces with one-sided feedback and achieves sample complexity matching known non-private lower bounds.