research-article

A learning theory approach to non-interactive database privacy

Authors:

Katrina Ligett,

Aaron RothAuthors Info & Claims

STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

Pages 609 - 618

https://doi.org/10.1145/1374376.1374464

Published: 17 May 2008 Publication History

Abstract

We demonstrate that, ignoring computational constraints, it is possible to release privacy-preserving databases that are useful for all queries over a discretized domain from any given concept class with polynomial VC-dimension. We show a new lower bound for releasing databases that are useful for halfspace queries over a continuous domain. Despite this, we give a privacy-preserving polynomial time algorithm that releases information useful for all halfspace queries, for a slightly relaxed definition of usefulness. Inspired by learning theory, we introduce a new notion of data privacy, which we call distributional privacy, and show that it is strictly stronger than the prevailing privacy notion, differential privacy.

References

[1]

M. Anthony and P. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.

Digital Library

[2]

M.F. Balcan, A. Blum, and S. Vempala. Kernels as features: On kernels, margins, and low-dimensional mappings. Machine Learning, 65(1):79--94, 2006.

Digital Library

[3]

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. Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 273--282, 2007.

Digital Library

[4]

A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 128--138, 2005.

Digital Library

[5]

S. Dasgupta and A. Gupta. An elementary proof of the Johnson-Lindenstrauss Lemma. International Computer Science Institute, Technical Report, pages 99--006, 1999.

[6]

I. Dinur and K. Nissim. Revealing information while preserving privacy. Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 202--210, 2003.

Digital Library

[7]

C. Dwork. Differential privacy. Proc. ICALP, 2006.

Digital Library

[8]

C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our Data, Ourselves: Privacy via Distributed Noise Generation. Proceedings of Advances in CryptologyEurocrypt 2006, pages 486--503, 2006.

Digital Library

[9]

C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. Proceedings of the 3rd Theory of Cryptography Conference, pages 265--284, 2006.

Digital Library

[10]

C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of LP decoding. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 85--94, 2007.

Digital Library

[11]

C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. Proc. CRYPTO, pages 528--544, 2004.

[12]

Alexandre Evfimievski, Johannes Gehrke, and Ramakrishnan Srikant. Limiting privacy breaches in privacy preserving data mining. In PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 211--222, New York, NY, USA, 2003. ACM.

Digital Library

[13]

P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 604--613, 1998.

Digital Library

[14]

Shiva Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? http://arxiv.org/abs/0803.0924v1.

[15]

F. McSherry and K. Talwar. Mechanism Design via Differential Privacy. Proceedings of the 48th Annual Symposium on Foundations of Computer Science, 2007.

Digital Library

[16]

K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 75--84, 2007.

Digital Library

[17]

V. Rastogi, D. Suciu, and S. Hong. The Boundary Between Privacy and Utility in Data Publishing. VLDB, 2007.

Digital Library

[18]

A. J. Smola and B. Scholkopf. Learning with Kernels. MIT Press, 2002.

[19]

V. N. Vapnik. Statistical Learning Theory. John Wiley and Sons Inc., 1998.

Digital Library

Cited By

Bun MGaboardi MNeunhoeffer MZhang W(2024)Continual Release of Differentially Private Synthetic Data from Longitudinal Data CollectionsProceedings of the ACM on Management of Data10.1145/36515952:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651595
Zhang MWei EBerry RHuang J(2024)Age-Dependent Differential PrivacyIEEE Transactions on Information Theory10.1109/TIT.2023.334014770:2(1300-1319)Online publication date: Feb-2024
https://doi.org/10.1109/TIT.2023.3340147
Fathalizadeh AMoghtadaiee VAlishahi M(2024)Indoor Geo-Indistinguishability: Adopting Differential Privacy for Indoor Location Data ProtectionIEEE Transactions on Emerging Topics in Computing10.1109/TETC.2023.324216612:1(293-306)Online publication date: Jan-2024
https://doi.org/10.1109/TETC.2023.3242166
Show More Cited By

Index Terms

A learning theory approach to non-interactive database privacy
1. Theory of computation

Recommendations

A learning theory approach to noninteractive database privacy

In this article, we demonstrate that, ignoring computational constraints, it is possible to release synthetic databases that are useful for accurately answering large classes of queries while preserving differential privacy. Specifically, we give a ...
Database privacy: balancing confidentiality, integrity and availability

The emphasis in database privacy should fall on a balance between confidentiality, integrity and availability of personal data, rather than on confidentiality alone. This balance should not necessarily be a trade-off, but should take into account the ...
Privacy-preserving deletion to generalization-based anonymous database
CUBE '12: Proceedings of the CUBE International Information Technology Conference

While creating an anonymous database it is assumed that all data is available at the time of creation. Once record is added to database, it is not deleted or if a user wants to delete person's record from database, it will be removed from it in its next ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

May 2008

712 pages

ISBN:9781605580470

DOI:10.1145/1374376

General Chair:
Richard Ladner
University of Washington
,
Program Chair:
Cynthia Dwork
Microsoft Research, Silicon Valley

Copyright © 2008 ACM.

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: 17 May 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

STOC '08

Sponsor:

STOC '08: Symposium on Theory of Computing

May 17 - 20, 2008

British Columbia, Victoria, Canada

Acceptance Rates

STOC '08 Paper Acceptance Rate 80 of 325 submissions, 25%;

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

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

273
Total Citations
View Citations
852
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bun MGaboardi MNeunhoeffer MZhang W(2024)Continual Release of Differentially Private Synthetic Data from Longitudinal Data CollectionsProceedings of the ACM on Management of Data10.1145/36515952:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651595
Zhang MWei EBerry RHuang J(2024)Age-Dependent Differential PrivacyIEEE Transactions on Information Theory10.1109/TIT.2023.334014770:2(1300-1319)Online publication date: Feb-2024
https://doi.org/10.1109/TIT.2023.3340147
Fathalizadeh AMoghtadaiee VAlishahi M(2024)Indoor Geo-Indistinguishability: Adopting Differential Privacy for Indoor Location Data ProtectionIEEE Transactions on Emerging Topics in Computing10.1109/TETC.2023.324216612:1(293-306)Online publication date: Jan-2024
https://doi.org/10.1109/TETC.2023.3242166
Liu CMaeda KTakai JMurota KShin K(2024)Synthetic Data Generation Without Real Data: Uncovering Insights in Malware DetectionAdvances in Information and Communication10.1007/978-3-031-53963-3_17(235-255)Online publication date: 17-Mar-2024
https://doi.org/10.1007/978-3-031-53963-3_17
Yang ZZhang YZheng YTian XPeng HLiu THan BOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)FedFedProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668761(60397-60428)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3668761
Liu TTang JVietri GWu ZKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Generating private synthetic data with genetic algorithmsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3619321(22009-22027)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3619321
Kostopoulou KTholoniat PCidon AGeambasu RLécuyer MDruschel PKaufmann AMace JFlinn JSeltzer M(2023)Turbo: Effective Caching in Differentially-Private DatabasesProceedings of the 29th Symposium on Operating Systems Principles10.1145/3600006.3613174(579-594)Online publication date: 23-Oct-2023
https://dl.acm.org/doi/10.1145/3600006.3613174
Liu FWang DXu Z(2023)Privacy-Preserving Travel Time Prediction With Uncertainty Using GPS Trace DataIEEE Transactions on Mobile Computing10.1109/TMC.2021.307486522:1(417-428)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TMC.2021.3074865
Xu XFan ZTrovati MPalmieri F(2023)MLPKV: A Local Differential Multi-Layer Private Key-Value Data Collection Scheme for Edge Computing EnvironmentsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.325612418(1825-1838)Online publication date: 2023
https://doi.org/10.1109/TIFS.2023.3256124
Pedrouzo-Ulloa ARamon JPéerez-González FLilova SDuflot PChihani ZGentili NUlivi PHoque MMukammel TPritzker ZLemesle ALoureiro-Acuña JMartínez XJiménez-Balsa G(2023)Introducing the TRUMPET project: TRUstworthy Multi-site Privacy Enhancing Technologies2023 IEEE International Conference on Cyber Security and Resilience (CSR)10.1109/CSR57506.2023.10224961(604-611)Online publication date: 31-Jul-2023
https://doi.org/10.1109/CSR57506.2023.10224961
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents