The Target-Charging Technique for Privacy Analysis across Interactive Computations
Edith Cohen, Xin Lyu
Abstract
We propose the Target Charging Technique (TCT), a unified privacy analysis framework for interactive settings where a sensitive dataset is accessed multiple times using differentially private algorithms. Unlike traditional composition, where privacy guarantees deteriorate quickly with the number of accesses, TCT allows computations that don't hit a specified target, often the vast majority, to be essentially free (while incurring instead a small overhead on those that do hit their targets). TCT generalizes tools such as the sparse vector technique and top- selection from private candidates and extends their remarkable privacy enhancement benefits from noisy Lipschitz functions to general private algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext aa6d7025-1074-4f2e-8398-b70a8db0b0baCited by top-tier papers4
- Hot PATE: Private Aggregation of Distributions for Diverse TasksEdith Cohen, Benjamin Cohen-Wang, Xin Lyu, Jelani Nelson et al.ICLR 2026 · 5 citations
- Private Learning of Littlestone Classes, RevisitedXin LyuSTOC 2026 · 4 citations
- Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive QueriesEdith Cohen, Mihir Singhal, Uri StemmerICML 2025
- Private Set Union with Multiple ContributionsTravis Dick, Haim Kaplan, Alex Kulesza, Uri Stemmer et al.NeurIPS 2025
Builds on5
- Adversarially Robust Streaming Algorithms via Differential PrivacyAvinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias et al.NeurIPS 2020 · 85 citations
- The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal SpaceAdam D. Smith, Shuang Song, Abhradeep ThakurtaNeurIPS 2020 · 48 citations
- Oneshot Differentially Private Top-k SelectionGang Qiao, Weijie J. Su, Li ZhangICML 2021 · 40 citations
- On the Robustness of CountSketch to Adaptive InputsEdith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós et al.ICML 2022 · 29 citations
- Dynamic algorithms against an adaptive adversary: generic constructions and lower boundsAmos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim et al.STOC 2022 · 11 citations
Related papers
- Free Gap Information from the Differentially Private Sparse Vector and Noisy Max MechanismsZeyu Ding, Yuxin Wang, Danfeng Zhang, Dan KiferVLDB 2020 · 14 citations
- Improving Sparse Vector Technique with Renyi Differential PrivacyYuqing Zhu, Yu-Xiang WangNeurIPS 2020 · 25 citations
- Unbounded Differentially Private Quantile and Maximum EstimationDavid DurfeeNeurIPS 2023 · 14 citations
- Composition Theorems for Interactive Differential PrivacyXin LyuNeurIPS 2022 · 29 citations
- Individualized Privacy Accounting via Subsampling with Applications in Combinatorial OptimizationBadih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi et al.ICML 2024 · 1 citation
