Privacy Amplification by Sampling under User-level Differential Privacy
Juanru Fang, Ke Yi
Abstract
Random sampling is an effective tool for reducing the computational costs of query processing in large databases. It has also been used frequently for private data analysis, in particular, under differential privacy (DP). An interesting phenomenon that the literature has identified, is that sampling can amplify the privacy guarantee of a mechanism, which in turn leads to reduced noise scales that have to be injected.
All existing privacy amplification results only hold in the standard, record-level DP model. Recently, userlevel differential privacy (user-DP) has gained a lot of attention as it protects all data records contributed by any particular user, thus offering stronger privacy protection. Sampling-based mechanisms under user-DP have not been explored so far, except naively running the mechanism on a sample without privacy amplification, which results in large DP noises. In fact, sampling is in even more demand under user-DP, since all state-of-the-art user-DP mechanisms have high computational costs due to the complex relationships between users and records. In this paper, we take the first step towards the study of privacy amplification by sampling under user-DP, and give the amplification results for two common user-DP sampling strategies: simple sampling and sample-and-explore. The experimental results show that these sampling-based mechanisms can be a useful tool to obtain some quick and reasonably accurate estimates on large private datasets.
CCS Concepts: • Security and privacy → Database and storage security.
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 62159a1e-e8d2-4c73-9017-74c5771a43a0Cited by top-tier papers3
- Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value StoreJiaoyi Zhang, Liqiang Peng, Mo Sha, Weiran Liu et al.SIGMOD 2025 · 4 citations
- The Adverse Effects of Omitting Records in Differential Privacy: How Sampling and Suppression Degrade the Privacy–Utility TradeoffÀlex Miranda-Pascual, Javier Parra-Arnau, Thorsten StrufeUSENIX Security 2026
- DP-S4S: Accurate and Scalable Select-Join-Aggregate Query Processing with User-Level Differential PrivacyYuan Qiu, Xiaokui Xiao, Yin YangSIGMOD 2026
Builds on7
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan et al.CCS 2016 · 7,620 citations
- Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by ShufflingVitaly Feldman, Audra McMillan, Kunal TalwarFOCS 2021 · 76 citations
- R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign KeysWei Dong, Juanru Fang, Ke Yi, Yuchao Tao et al.SIGMOD 2022 · 41 citations
- Computing Local Sensitivities of Counting Queries with JoinsYuchao Tao, Xi He, Ashwin Machanavajjhala, Sudeepa RoySIGMOD 2020 · 37 citations
- Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential PrivacyVitaly Feldman, Audra McMillan, Kunal TalwarSODA 2023 · 23 citations
Related papers
- Privacy amplification by random allocationMoshe Shenfeld, Vitaly FeldmanNeurIPS 2025 · 18 citations
- Efficient privacy loss accounting for subsampling and random allocationVitaly Feldman, Moshe ShenfeldICML 2026 · 5 citations
- Shifted Inverse: A General Mechanism for Monotonic Functions under User Differential PrivacyJuanru Fang, Wei Dong, Ke YiCCS 2022 · 13 citations
- Metric Differential Privacy at the User-Level via the Earth-Mover's DistanceJacob Imola, Amrita Roy Chowdhury, Kamalika ChaudhuriCCS 2024
- Network Shuffling: Privacy Amplification via Random WalksSeng Pei Liew, Tsubasa Takahashi, Shun Takagi, Fumiyuki Kato et al.SIGMOD 2022 · 12 citations
