research-article

Private and Continual Release of Statistics

Authors:

T.-H. Hubert Chan,

Dawn SongAuthors Info & Claims

ACM Transactions on Information and System Security (TISSEC), Volume 14, Issue 3

Article No.: 26, Pages 1 - 24

https://doi.org/10.1145/2043621.2043626

Published: 01 November 2011 Publication History

Abstract

We ask the question: how can Web sites and data aggregators continually release updated statistics, and meanwhile preserve each individual user’s privacy? Suppose we are given a stream of 0’s and 1’s. We propose a differentially private continual counter that outputs at every time step the approximate number of 1’s seen thus far. Our counter construction has error that is only poly-log in the number of time steps. We can extend the basic counter construction to allow Web sites to continually give top-k and hot items suggestions while preserving users’ privacy.

References

[1]

Calandrino, J. A., Kilzer, A, Narayanan, A., Felten, E. W., and Shmatikov, V. 2011. “You might also like:” Privacy risks of collaborative filtering. In Proceedings of the IEEE Symposium on Security and Privacy.

Digital Library

[2]

Demaine, E. D., López-Ortiz, A., and Munro, J. I. 2002. Frequency estimation of internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA’02).

Digital Library

[3]

Dinur, I. and Nissim, K. 2003. Revealing information while preserving privacy. In Proceedings of the ACM SIGACT-SIGMOND-SIGART Symposium on Principles of Database Systems.

Digital Library

[4]

Dwork, C. 2006. Differential privacy. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming.

Digital Library

[5]

Dwork, C. 2008. Differential privacy: A survey of results. In Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation.

Digital Library

[6]

Dwork, C. 2009. The differential privacy frontier. In Proceedings of the Theory of Computing Conference.

[7]

Dwork, C. 2010a. Differential privacy in new settings. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA).

Digital Library

[8]

Dwork, C. 2010b. A firm foundation for private data analysis. Comm. ACM 54, 1.

Digital Library

[9]

Dwork, C. and Yekhanin, S. 2008. New efficient attacks on statistical disclosure control mechanisms. In Proceedings of the CRYPTO’08.

Digital Library

[10]

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

Digital Library

[11]

Dwork, C., Naor, M., Pitassi, T., and Rothblum, G. N. 2010a. Differential privacy under continual observation. In Proceedings of the Annual ACM Symposium on Theory of Computing.

Digital Library

[12]

Dwork, C., Naor, M., Pitassi, T., Rothblum, G. N., and Yekhanin, S. 2010b. Pan-private streaming algorithms. In Proceedings of the Conference on Innovations in Computer Science.

[13]

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

Digital Library

[14]

Jones, R., Kumar, R., Pang, B., and Tomkins, A. 2008. Vanity fair: Privacy in querylog bundles. In Proceedings of the International Conference on Information and Knowledge Management.

Digital Library

[15]

Korolova, A., Kenthapadi, K., Mishra, N., and Ntoulas, A. 2009. Releasing search queries and clicks privately. In Proceedings of the International World Wide Web Conference.

Digital Library

[16]

Li, C., Hay, M., Rastogi, V., Miklau, G., and McGregor, A. 2010. Optimizing linear counting queries under differential privacy. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 123--134.

Digital Library

[17]

Manku, G. S. and Motwani, R. 2002. Approximate frequency counts over data streams. In Proceedings of the International Conference on Very Large Databases.

Digital Library

[18]

McSherry, F. and Mironov, I. 2009. Differentially private recommender systems: Building privacy into the netflix prize contenders. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.

Digital Library

[19]

Metwally, A., Agrawal, D., and Abbadi, A. E. 2005. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the International Conference on Database Theory.

Digital Library

[20]

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

Digital Library

[21]

Warner, S. L. 1965. Randomized response: A survey technique for eliminating evasive answer bias. J. Amer. Stat. Assn.

[22]

Xiao, X., Wang, G., and Gehrke, J. 2010. Differential privacy via wavelet transforms. In Proceedings of the International Conference on Data Engineering. 225--236.

[23]

Yeganova, L. and Wilbur, W. 2009. Isotonic regression under Lipschitz constraint. J. Optimiz. Theory Appl 141, 429--443.

Cited By

Wang HCui LWang ELiu J(2025)A Differentially Private Approach for Budgeted Combinatorial Multi-Armed BanditsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.340183622:1(424-439)Online publication date: Jan-2025
https://doi.org/10.1109/TDSC.2024.3401836
Rameshwar VTandon ASharma A(2025)Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs2025 17th International Conference on COMmunication Systems and NETworks (COMSNETS)10.1109/COMSNETS63942.2025.10885649(1269-1274)Online publication date: 6-Jan-2025
https://doi.org/10.1109/COMSNETS63942.2025.10885649
La Tour MHenzinger MSaulpic DSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Making old things newProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692550(12046-12086)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692550
Show More Cited By

Index Terms

Private and Continual Release of Statistics
1. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

A differentially private algorithm for location data release

The rise of mobile technologies in recent years has led to large volumes of location information, which are valuable resources for knowledge discovery such as travel patterns mining and traffic analysis. However, location dataset has been confronted ...
Answering differentially private queries for continual datasets release
Abstract
Privacy preserving data release is a hot topic that attracts a lot of attentions in data mining, machine learning, and social network communities. Most studies on privacy preserving focus on static data releases; however, data are ...
Highlights
- We identify latent problems in the continual data release that have been long overlooked.
On the complexity of differentially private data release: efficient algorithms and hardness results
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing

We consider private data analysis in the setting in which a trusted and trustworthy curator, having obtained a large data set containing private information, releases to the public a "sanitization" of the data set that simultaneously protects the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information and System Security

ACM Transactions on Information and System Security Volume 14, Issue 3

November 2011

133 pages

ISSN:1094-9224

EISSN:1557-7406

DOI:10.1145/2043621

Issue’s Table of Contents

Copyright © 2011 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2011

Accepted: 01 June 2011

Revised: 01 January 2011

Received: 01 May 2010

Published in TISSEC Volume 14, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

224
Total Citations
View Citations
1,417
Total Downloads

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

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang HCui LWang ELiu J(2025)A Differentially Private Approach for Budgeted Combinatorial Multi-Armed BanditsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.340183622:1(424-439)Online publication date: Jan-2025
https://doi.org/10.1109/TDSC.2024.3401836
Rameshwar VTandon ASharma A(2025)Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs2025 17th International Conference on COMmunication Systems and NETworks (COMSNETS)10.1109/COMSNETS63942.2025.10885649(1269-1274)Online publication date: 6-Jan-2025
https://doi.org/10.1109/COMSNETS63942.2025.10885649
La Tour MHenzinger MSaulpic DSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Making old things newProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692550(12046-12086)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692550
Le JXing BZhang DQiao D(2024)Enhancing Real-Time Traffic Data Sharing: A Differential Privacy-Based Scheme with Spatial CorrelationMathematics10.3390/math1211172212:11(1722)Online publication date: 31-May-2024
https://doi.org/10.3390/math12111722
Fu YWang TLuo BLiao XXu JKirda ELie D(2024)Benchmarking Secure Sampling Protocols for Differential PrivacyProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690257(318-332)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3690257
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
He YVershynin RZhu Y(2024)Online Differentially Private Synthetic Data GenerationIEEE Transactions on Privacy10.1109/TP.2024.34866871(19-30)Online publication date: 2024
https://doi.org/10.1109/TP.2024.3486687
Le JZhang DYang FXiang TLiao X(2024)Secure and Efficient Continuous Learning Model for Traffic Flow PredictionIEEE Transactions on Network and Service Management10.1109/TNSM.2024.340795921:4(4900-4911)Online publication date: 31-May-2024
https://dl.acm.org/doi/10.1109/TNSM.2024.3407959
Sun HXiao MXu YGao GZhang S(2024)Crowdsensing Data Trading for Unknown Market: Privacy, Stability, and ConflictsIEEE Transactions on Mobile Computing10.1109/TMC.2024.339981623:12(11719-11734)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1109/TMC.2024.3399816
Zhang MWei EBerry RHuang J(2024)Age-Dependent Differential PrivacyIEEE Transactions on Information Theory10.1109/TIT.2023.334014770:2(1300-1319)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TIT.2023.3340147
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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents