research-article

GUPT: privacy preserving data analysis made easy

Authors:

Prashanth Mohan,

Abhradeep Thakurta,

David CullerAuthors Info & Claims

SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

Pages 349 - 360

https://doi.org/10.1145/2213836.2213876

Published: 20 May 2012 Publication History

Abstract

It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking information through its output. Differential privacy provides a theoretical framework for processing data while protecting the privacy of individual records in a dataset. Unfortunately, it has seen limited adoption because of the loss in output accuracy, the difficulty in making programs differentially private, lack of mechanisms to describe the privacy budget in a programmer's utilitarian terms, and the challenging requirement that data owners and data analysts manually distribute the limited privacy budget between queries.

This paper presents the design and evaluation of a new system, GUPT, that overcomes these challenges. Unlike existing differentially private systems such as PINQ and Airavat, it guarantees differential privacy to programs not developed with privacy in mind, makes no trust assumptions about the analysis program, and is secure to all known classes of side-channel attacks.

GUPT uses a new model of data sensitivity that degrades privacy of data over time. This enables efficient allocation of different levels of privacy for different user applications while guaranteeing an overall constant level of privacy and maximizing the utility of each application. GUPT also introduces techniques that improve the accuracy of output while achieving the same level of privacy. These approaches enable GUPT to easily execute a wide variety of data analysis programs while providing both utility and privacy.

References

[1]

N. Anciaux, L. Bouganim, H. H. van, P. Pucheral, and P. M. Apers. Data degradation: Making private data less sensitive over time. In CIKM, 2008.

Digital Library

[2]

F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing strategies. In SIGMOD, 1986.

Digital Library

[3]

M. Barbaro and T. Zeller. A face is exposed for aol searcher no. 4417749. The New York Times, Aug. 2006.

[4]

J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. Operating Systems Design and Implementation, October 2004.

Digital Library

[5]

C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.

Digital Library

[6]

C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum. Differential privacy under continual observation. In STOC, 2010.

Digital Library

[7]

A. Frank and A. Asuncion. UCI machine learning repository, 2010.

[8]

S. R. Ganta, S. P. Kasiviswanathan, and A. Smith. Composition attacks and auxiliary information in data privacy. In KDD, 2008.

Digital Library

[9]

A. Ghosh and A. Roth. Selling privacy at auction. http://arxiv.org/abs/1011.1375.

Digital Library

[10]

A. Haeberlen, B. C. Pierce, and A. Narayan. Differential privacy under fire. In USENIX Security, 2011.

Digital Library

[11]

M. Hay, V. Rastogi, G. Miklau, and D. Suciu. Boosting the accuracy of differentially private histograms through consistency. Proc. VLDB Endow., 3:1021--1032, September 2010.

Digital Library

[12]

V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev. Private analysis of graph structure. In VLDB, 2011.

Digital Library

[13]

D. Kifer. Attacks on privacy and definetti's theorem. In SIGMOD, 2009.

Digital Library

[14]

C. Li, M. Hay, V. Rastogi, G. Miklau, and A. McGregor. Optimizing linear counting queries under differential privacy. In PODS, 2010.

Digital Library

[15]

A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In ICDE, 2006.

Digital Library

[16]

F. McSherry. Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In SIGMOD, 2009.

Digital Library

[17]

F. McSherry and K. Talwar. Mechanism design via differential privacy. In FOCS, 2007.

Digital Library

[18]

A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE Symposium on Security and Privacy, 2008.

Digital Library

[19]

K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC, 2007.

Digital Library

[20]

L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999--66, Stanford InfoLab, 1999.

[21]

V. Rastogi and S. Nath. Differentially private aggregation of distributed time-series with transformation and encryption. In SIGMOD, 2010.

Digital Library

[22]

I. Roy, S. T. V. Setty, A. Kilzer, V. Shmatikov, and E. Witchel. Airavat: security and privacy for mapreduce. In NSDI, 2010.

Digital Library

[23]

A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In PET, 2002.

Digital Library

[24]

A. Smith. Privacy-preserving statistical estimation with optimal convergence rates. In STOC, 2011.

Digital Library

[25]

L. Sweeney. k-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 2002.

Digital Library

[26]

H. H. van, M. Fokkinga, and N. Anciaux. A framework to balance privacy and data usability using data degradation. In CSE, 2009.

[27]

C. Wright, C. Cowan, S. Smalley, J. Morris, and G. Kroah-Hartman. Linux security modules: General security support for the linux kernel. In USENIX Security, 2002.

Digital Library

[28]

X. Xiao, G. Bender, M. Hay, and J. Gehrke. ireduct: differential privacy with

Cited By

Chen YPang XLi XWang HNiu BHu S(2025)U-DPAP: Utility-aware Efficient Range Counting on Privacy-preserving Spatial Data FederationProceedings of the ACM on Management of Data10.1145/37143333:1(1-25)Online publication date: 11-Feb-2025
https://doi.org/10.1145/3714333
Lahjouji NGhayyur SHe XMehrotra SLuo BLiao XXu JKirda ELie D(2024)ProBE: Proportioning Privacy Budget for Complex Exploratory Decision SupportProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670394(1924-1938)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670394
Xiao LZhang XWu DHu MZhou YYu S(2024)History-Aware Privacy Budget Allocation for Model Training on Evolving Data-Sharing PlatformsIEEE Transactions on Services Computing10.1109/TSC.2024.3451187(1-15)Online publication date: 2024
https://doi.org/10.1109/TSC.2024.3451187
Show More Cited By

Index Terms

GUPT: privacy preserving data analysis made easy

Recommendations

Efficient privacy-aware search over encrypted databases
CODASPY '14: Proceedings of the 4th ACM conference on Data and application security and privacy

In recent years, database as a service (DAS) model where data management is outsourced to cloud service providers has become more prevalent. Although DAS model offers lower cost and flexibility, it necessitates the transfer of potentially sensitive data ...
Differentially private data release for data mining
KDD '11: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining

Privacy-preserving data publishing addresses the problem of disclosing sensitive data when mining for useful information. Among the existing privacy models, ∈-differential privacy provides one of the strongest privacy guarantees and has no assumptions ...
IMR based Anonymization for Privacy Preservation in Data Mining
KMO '16: Proceedings of the The 11th International Knowledge Management in Organizations Conference on The changing face of Knowledge Management Impacting Society

Privacy Preserving Data Mining (PPDM) is a data mining research area that aims to protect individual's personal information from unsolicited or unauthorized disclosure. Privacy relates to personal information that a person would not wish others to know ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

May 2012

886 pages

ISBN:9781450312479

DOI:10.1145/2213836

General Chairs:
K. Selçuk Candan
Arizona State University
,
Yi Chen
Arizona State University
,
Richard Snodgrass
University of Arizona
,
Program Chair:
Luis Gravano
Columbia University
,
Publications Chair:
Ariel Fuxman
Microsoft Research

Copyright © 2012 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

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '12

Sponsor:

SIGMOD

SIGMOD/PODS '12: International Conference on Management of Data

May 20 - 24, 2012

Arizona, Scottsdale, USA

Acceptance Rates

SIGMOD '12 Paper Acceptance Rate 48 of 289 submissions, 17%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

176
Total Citations
View Citations
1,612
Total Downloads

Downloads (Last 12 months)73
Downloads (Last 6 weeks)2

Reflects downloads up to 14 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen YPang XLi XWang HNiu BHu S(2025)U-DPAP: Utility-aware Efficient Range Counting on Privacy-preserving Spatial Data FederationProceedings of the ACM on Management of Data10.1145/37143333:1(1-25)Online publication date: 11-Feb-2025
https://doi.org/10.1145/3714333
Lahjouji NGhayyur SHe XMehrotra SLuo BLiao XXu JKirda ELie D(2024)ProBE: Proportioning Privacy Budget for Complex Exploratory Decision SupportProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670394(1924-1938)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670394
Xiao LZhang XWu DHu MZhou YYu S(2024)History-Aware Privacy Budget Allocation for Model Training on Evolving Data-Sharing PlatformsIEEE Transactions on Services Computing10.1109/TSC.2024.3451187(1-15)Online publication date: 2024
https://doi.org/10.1109/TSC.2024.3451187
Shi WZhang JChen XYe X(2024)PCDP-CRLPPM: a classified regional location privacy-protection model based on personalized clustering with differential privacy in data managementThe Computer Journal10.1093/comjnl/bxae118Online publication date: 12-Nov-2024
https://doi.org/10.1093/comjnl/bxae118
Olatunji IRauch JKatzensteiner MKhosla M(2024)A Review of Anonymization for Healthcare DataBig Data10.1089/big.2021.016912:6(538-555)Online publication date: 1-Dec-2024
https://doi.org/10.1089/big.2021.0169
Xie YYang YZeng W(2024)Coordinate Descent for k-Means with Differential PrivacyWeb and Big Data10.1007/978-981-97-2387-4_10(145-158)Online publication date: 28-Apr-2024
https://doi.org/10.1007/978-981-97-2387-4_10
Epasto AMirrokni VNarayanan SZhong POh ANaumann TGloberson ASaenko KHardt MLevine S(2023)k-means clustering with distance-based privacyProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3666981(19570-19593)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3666981
Li YLi B(2023)Solving the Performance Issues of Epsilon Estimation Method in Differentially Private ERM: Analysis, Solution and EvaluationProceedings of the 2023 2nd International Conference on Networks, Communications and Information Technology10.1145/3605801.3605820(93-99)Online publication date: 16-Jun-2023
https://dl.acm.org/doi/10.1145/3605801.3605820
Cormode G(2023)Technical Perspective on 'R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign KeysACM SIGMOD Record10.1145/3604437.360446152:1(114-114)Online publication date: 8-Jun-2023
https://dl.acm.org/doi/10.1145/3604437.3604461
Rasifard HGopinath RBackes MNemati HRanise SCarbone RTakabi D(2023)SEAL: Capability-Based Access Control for Data-Analytic ScenariosProceedings of the 28th ACM Symposium on Access Control Models and Technologies10.1145/3589608.3593838(67-78)Online publication date: 24-May-2023
https://dl.acm.org/doi/10.1145/3589608.3593838
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.

Figures

Tables

Media

View Table of Conten