Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2588555.2588575acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

PriView: practical differentially private release of marginal contingency tables

Published: 18 June 2014 Publication History

Abstract

We consider the problem of publishing a differentially private synopsis of a d-dimensional dataset so that one can reconstruct any k-way marginal contingency tables from the synopsis. Marginal tables are the workhorses of categorical data analysis. Thus, the private release of such tables has attracted a lot of attention from the research community. However, for situations where $d$ is moderate to large and k is beyond 3, no accurate and practical method exists. We introduce PriView, which computes marginal tables for a number of strategically chosen sets of attributes that we call views, and then use these view marginal tables to reconstruct any desired k-way marginal. In PriView, we apply maximum entropy optimization to reconstruct k-way marginals from views. We also develop a novel method to efficiently making all view marginals consistent while correcting negative entries to improve accuracy. For view selection, we borrow the concept of covering design from combinatorics theory. We conduct extensive experiments on real and synthetic datasets, and show that PriView reduces the error over existing approaches by 2 to 3 orders of magnitude.

References

[1]
AOL search log dataset. http://www.gregsadetsky.com/aol-data/.
[2]
Frequent itemset mining dataset repository. http://fimi.ua.ac.be/data/.
[3]
MSNBC.com anonymous web data data set. http://archive.ics.uci.edu/ml/datasets/MSNBC.com
[4]
Anonymous Web Data.
[5]
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 PODS'07, pages 273--282, 2007.
[6]
Y. M. Bishop, S. E. Fienberg, and P. W. Holl. Discrete Multivariate Analysis: Theory and Practice. Springer, 2007.
[7]
A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In PODS, pages 128--138, 2005.
[8]
M. Cheraghchi, A. Klivans, P. Kothari, and H. K. Lee. Submodular functions are noise stable. In SODA, pages 1586--1592, 2012.
[9]
B. Ding, M. Winslett, J. Han, and Z. Li. Differentially private data cubes: optimizing noise sources and consistency. In SIGMOD, pages 217--228, 2011.
[10]
C. Dwork. Differential privacy. In ICALP, pages 1--12, 2006.
[11]
C. Dwork. A firm foundation for private data analysis. Commun. ACM, 54(1):86--95, 2011.
[12]
C. Dwork, F. Mcsherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, pages 265--284. Springer, 2006.
[13]
C. Fellbaum. WordNet: An Electronic Lexical Database. Bradford Books, 1998.
[14]
D. Gordon. La jolla covering repository, Nov. 2012. http://www.ccrwest.org/cover.html.
[15]
D. M. Gordon, G. Kuperberg, and O. Patashnik. New constructions for covering designs. J. Combin. Designs, 3:269--284, 1995.
[16]
A. Gupta, M. Hardt, A. Roth, and J. Ullman. Privately releasing conjunctions and the statistical query barrier. In STOC, pages 803--812, 2011.
[17]
M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In NIPS, pages 2348--2356, 2012.
[18]
M. Hardt and G. N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In FOCS, pages 61--70. IEEE, 2010.
[19]
M. Hardt, G. N. Rothblum, and R. A. Servedio. Private data release via learning thresholds. In SODA, pages 168--187, 2012.
[20]
M. Hay, V. Rastogi, G. Miklau, and D. Suciu. Boosting the accuracy of differentially private histograms through consistency. PVLDB, 3:1021--1032, September 2010.
[21]
S. P. Kasiviswanathan, M. Rudelson, A. Smith, and J. Ullman. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In STOC, pages 775--784, 2010.
[22]
J. Lei. Differentially private m-estimators. In NIPS, pages 361--369, 2011.
[23]
C. Li, M. Hay, V. Rastogi, G. Miklau, and A. McGregor. Optimizing linear counting queries under differential privacy. In PODS, pages 123--134, New York, NY, USA, 2010. ACM.
[24]
C. Li and G. Miklau. An adaptive mechanism for accurate query answering under differential privacy. PVLDB, 5(6):514--525, Feb. 2012.
[25]
N. Li, W. H. Qardaji, D. Su, and J. Cao. PrivBasis: Frequent itemset mining with differential privacy. PVLDB, 5(11):1340--1351, 2012.
[26]
J. Lin. Divergence measures based on the shannon entropy. IEEE Trans. Inf. Theory, 37(1):145--151, 1991.
[27]
F. McSherry and K. Talwar. Mechanism design via differential privacy. In FOCS, pages 94--103, 2007.
[28]
W. Qardaji and N. Li. Recursive partitioning and summarization: A practical framework for differential private data publishing. In ASIACCS, 2012.
[29]
J. Thaler, J. Ullman, and S. Vadhan. Faster algorithms for privately releasing marginals. In ICALP, pages 810--821, 2012.
[30]
J. Ullman and S. Vadhan. PCPs and the hardness of generating private synthetic data. In TCC, pages 400--416, 2011.
[31]
O. V. Usatenko and V. A. Yampol'skii. Binary n-step markov chains and long-range correlated systems. Phys. Rev. Lett., 90:110601, Mar 2003.
[32]
G. Yuan, Z. Zhang, M. Winslett, X. Xiao, Y. Yang, and Z. Hao. Low-rank mechanism: Optimizing batch queries under differential privacy. PVLDB, 5(11):1352--1363, July 2012.

Cited By

View all
  • (2024)PriPL-Tree: Accurate Range Query for Arbitrary Distribution under Local Differential PrivacyProceedings of the VLDB Endowment10.14778/3681954.368198117:11(3031-3044)Online publication date: 1-Jul-2024
  • (2024)Differentially Private Data Generation with Missing DataProceedings of the VLDB Endowment10.14778/3659437.365945517:8(2022-2035)Online publication date: 31-May-2024
  • (2024)NetDPSyn: Synthesizing Network Traces under Differential PrivacyProceedings of the 2024 ACM on Internet Measurement Conference10.1145/3646547.3689011(545-554)Online publication date: 4-Nov-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
June 2014
1645 pages
ISBN:9781450323765
DOI:10.1145/2588555
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 the author(s) 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: 18 June 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. contingency table
  2. differential privacy
  3. marginal table

Qualifiers

  • Research-article

Funding Sources

Conference

SIGMOD/PODS'14
Sponsor:

Acceptance Rates

SIGMOD '14 Paper Acceptance Rate 107 of 421 submissions, 25%;
Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)71
  • Downloads (Last 6 weeks)4
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)PriPL-Tree: Accurate Range Query for Arbitrary Distribution under Local Differential PrivacyProceedings of the VLDB Endowment10.14778/3681954.368198117:11(3031-3044)Online publication date: 1-Jul-2024
  • (2024)Differentially Private Data Generation with Missing DataProceedings of the VLDB Endowment10.14778/3659437.365945517:8(2022-2035)Online publication date: 31-May-2024
  • (2024)NetDPSyn: Synthesizing Network Traces under Differential PrivacyProceedings of the 2024 ACM on Internet Measurement Conference10.1145/3646547.3689011(545-554)Online publication date: 4-Nov-2024
  • (2024)VertiMRF: Differentially Private Vertical Federated Data SynthesisProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671771(4431-4442)Online publication date: 25-Aug-2024
  • (2024)SLIM-View: Sampling and Private Publishing of Multidimensional DatabasesProceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy10.1145/3626232.3653275(391-402)Online publication date: 19-Jun-2024
  • (2024)Collection and Analysis of Sensitive Data with Privacy Protection by a Distributed Randomized Response ProtocolProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3636024(1415-1424)Online publication date: 8-Apr-2024
  • (2024)Differentially Private Top-$k$ Flows Estimation Mechanism in Network TrafficIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.330925011:3(2462-2472)Online publication date: May-2024
  • (2024)ABSyn: An Accurate Differentially Private Data Synthesis Scheme With Adaptive Selection and Batch ProcessesIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.345317519(8338-8352)Online publication date: 2024
  • (2024)SoK: Privacy-Preserving Data Synthesis2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00002(4696-4713)Online publication date: 19-May-2024
  • (2024)PP-LDG: A Medical Privacy-Preserving Labeled Data Generation Framework2024 IEEE International Conference on Medical Artificial Intelligence (MedAI)10.1109/MedAI62885.2024.00091(651-658)Online publication date: 15-Nov-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