skip to main content
10.1145/1806689.1806786acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

On the geometry of differential privacy

Published: 05 June 2010 Publication History

Abstract

We consider the noise complexity of differentially private mechanisms in the setting where the user asks d linear queries f:Rn -> R non-adaptively. Here, the database is represented by a vector in R and proximity between databases is measured in the l1-metric. We show that the noise complexity is determined by two geometric parameters associated with the set of queries. We use this connection to give tight upper and lower bounds on the noise complexity for any d ≤ n. We show that for d random linear queries of sensitivity 1, it is necessary and sufficient to add l2-error Θ(min d√d/ε,d√(log (n/d))/ε) to achieve ε-differential privacy. Assuming the truth of a deep conjecture from convex geometry, known as the Hyperplane conjecture, we can extend our results to arbitrary linear queries giving nearly matching upper and lower bounds.
Our bound translates to error $O(min d/ε,√(d log(n/d)/ε)) per answer. The best previous upper bound (Laplacian mechanism) gives a bound of O(min (d/ε,√n/ε)) per answer, while the best known lower bound was Ω(√d/ε).
In contrast, our lower bound is strong enough to separate the concept of differential privacy from the notion of approximate differential privacy where an upper bound of O(√{d}/ε) can be achieved.

References

[1]
B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In Proc. $26$th PODS, pages 273--282. ACM, 2007.
[2]
I. Barany and Z. Furedi. Approximation of the sphere by polytopes having few vertices. Proceedings of the American Mathematical Society, 102(3):651--659, 1988.
[3]
A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In PODS '05: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 128--138, New York, NY, USA, 2005. ACM.
[4]
A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 609--618, New York, NY, USA, 2008. ACM.
[5]
K. Chaudhuri and C. Monteleoni. Privacy-preserving logistic regression. In Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems (NIPS), pages 289--296, 2008.
[6]
I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. $22$nd PODS, pages 202--210. ACM, 2003.
[7]
C. Dwork. Differential privacy: A survey of results. In Proc. 5th TAMC, pages 1--19. Springer, 2008.
[8]
C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation. In Proc. 25th EUROCRYPT, pages 486--503. Springer, 2006.
[9]
C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Proc. $3$rd TCC, pages 265--284. Springer, 2006.
[10]
C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of LP decoding. In Proc. 39th STOC, pages 85--94. ACM, 2007.
[11]
C. Dwork and S. Yekhanin. New efficient attacks on statistical disclosure control mechanisms. In Proc. 28th CRYPTO, pages 469--480. Springer, 2008.
[12]
M. E. Dyer, A. M. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1--17, 1991.
[13]
D. Feldman, A. Fiat, H. Kaplan, and K. Nissim. Private coresets. In Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, pages 361--370. ACM New York, NY, USA, 2009.
[14]
A. Ghosh, T. Roughgarden, and M. Sundararajan. Universally utility-maximizing privacy mechanisms. In STOC, pages 351--360, 2009.
[15]
A. Giannopoulos. Notes on isotropic convex bodies. Preprint, 2003.
[16]
A. Gupta, K. Ligett, F. McSherry, A. Roth, and K. Talwar. Differentially private approximation algorithms. In Proceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010. To appear.
[17]
R. Kannan, L. Lovász, and M. Simonovits. Random walks and an o*(n5) volume algorithm for convex bodies. Random Struct. Algorithms, 11(1):1--50, 1997.
[18]
S. Kasiviswanathan, M. Rudelson, and A. Smith. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. Manuscript, 2009.
[19]
S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. What can we learn privately? In FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 531--540, Washington, DC, USA, 2008. IEEE Computer Society.
[20]
B. Klartag. On convex perturbations with a bounded isotropic constant. Geometric and Functional Analysis (GAFA), 16(6):1274--1290, December 2006.
[21]
B. Klartag and G. Kozma. On the hyperplane conjecture for random convex sets. Israel Journal of Mathematics, 170(1):253--268, 2009.
[22]
A. E. Litvak, A. Pajor, M. Rudelson, and T.-J. N. Smallest singular value of random matrices and geometry of random polytopes. Adv. Math., 195(2):491--523, 2005.
[23]
F. McSherry and I. Mironov. Differentially private recommender systems: building privacy into the net. In Proc. 15th KDD, pages 627--636. ACM, 2009.
[24]
F. McSherry and K. Talwar. Mechanism design via differential privacy. In Proc. 48th FOCS, pages 94--103. IEEE, 2007.
[25]
V. Milman and A. Pajor. Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space. Geometric Aspects of Functional Analysis, 1376:64--104, 1989.
[26]
K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 75--84, New York, NY, USA, 2007. ACM.
[27]
V. Rastogi, D. Suciu, and S. Hong. The boundary between privacy and utility in data publishing. In VLDB '07: Proceedings of the 33rd international conference on Very large data bases, pages 531--542. VLDB Endowment, 2007.
[28]
S. Vempala. Geometric random walks: a survey. MSRI Volume on Combinatorial and Computational Geometry, 52:577--616, 2005.

Cited By

View all

Index Terms

  1. On the geometry of differential privacy

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '10: Proceedings of the forty-second ACM symposium on Theory of computing
    June 2010
    812 pages
    ISBN:9781450300506
    DOI:10.1145/1806689
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 05 June 2010

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. complexity
    2. differential privacy
    3. geometry
    4. histogram
    5. privacy
    6. statistical data analysis

    Qualifiers

    • Research-article

    Conference

    STOC'10
    Sponsor:
    STOC'10: Symposium on Theory of Computing
    June 5 - 8, 2010
    Massachusetts, Cambridge, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)197
    • Downloads (Last 6 weeks)13
    Reflects downloads up to 13 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)Better and Simpler Lower Bounds for Differentially Private Statistical EstimationIEEE Transactions on Information Theory10.1109/TIT.2024.351162471:2(1376-1388)Online publication date: Feb-2025
    • (2025)Simulation-Based, Finite-Sample Inference for Privatized DataJournal of the American Statistical Association10.1080/01621459.2024.2427436(1-14)Online publication date: 3-Jan-2025
    • (2024)Less is moreProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3698953(937-954)Online publication date: 14-Aug-2024
    • (2024)Differentially private post-processing for fair regressionProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3694296(54212-54235)Online publication date: 21-Jul-2024
    • (2024)Optimal differentially private model training with public dataProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3693404(32849-32903)Online publication date: 21-Jul-2024
    • (2024)Mean estimation in the add-remove model of differential privacyProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3693097(25642-25661)Online publication date: 21-Jul-2024
    • (2024)Improved communication-privacy trade-offs in L2 mean estimation under streaming differential privacyProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692338(6973-6991)Online publication date: 21-Jul-2024
    • (2024)Differentially Private Hierarchical Heavy HittersProceedings of the ACM on Management of Data10.1145/36958262:5(1-25)Online publication date: 7-Nov-2024
    • (2024)Metric Differential Privacy at the User-Level via the Earth-Mover's DistanceProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690363(348-362)Online publication date: 2-Dec-2024
    • (2024)Scenario-based Adaptations of Differential Privacy: A Technical SurveyACM Computing Surveys10.1145/365115356:8(1-39)Online publication date: 26-Apr-2024
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media