The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Differentially private sequential data publication via variable-length n-grams
Open accessAbstract
Sequential data is being increasingly used in a variety of applications. Publishing sequential data is of vital importance to the advancement of these applications. However, as shown by the re-identification attacks on the AOL and Netflix datasets, releasing sequential data may pose considerable threats to individual privacy. Recent research has indicated the failure of existing sanitization techniques to provide claimed privacy guarantees. It is therefore urgent to respond to this failure by developing new schemes with provable privacy guarantees. Differential privacy is one of the only models that can be used to provide such guarantees. Due to the inherent sequentiality and high-dimensionality, it is challenging to apply differential privacy to sequential data. In this paper, we address this challenge by employing a variable-length n-gram model, which extracts the essential information of a sequential database in terms of a set of variable-length n-grams. Our approach makes use of a carefully designed exploration tree structure and a set of novel techniques based on the Markov assumption in order to lower the magnitude of added noise. The published n-grams are useful for many purposes. Furthermore, we develop a solution for generating a synthetic database, which enables a wider spectrum of data analysis tasks. Extensive experiments on real-life datasets demonstrate that our approach substantially outperforms the state-of-the-art techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Foundations of statistical natural language processing
Manning, C. D., & Schütze, H. (1999) · Cited by 9,816
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Privacy integrated queries: an extensible platform for privacy-preserving data analysis
McSherry, F. D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559850 · Cited by 1,124
Broken Promises of Privacy: Responding to the Surprising Failure of AnonymizationPreprint
Ohm, P. (2009) · SSRN Electronic Journal · Cited by 997
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Abul, O., Bonchi, F., & Nanni, M. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497446 · Cited by 506
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., & Roth, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374464 · Cited by 505
On the complexity of differentially private data release: efficient algorithms and hardness results
Dwork, C., Naor, M., Reingold, O., Rothblum, G. N., & Vadhan, S. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536467 · Cited by 358
Differentially private data release for data mining
Mohammed, N., Chen, R., Fung, B. C. M., & Yu, P. S. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020487 · Cited by 325
Self-citationOptimizing linear counting queries under differential privacy
Li, C., Hay, M., Rastogi, V., Miklau, G., & McGregor, A. (2010) · Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1807085.1807104 · Cited by 319
Privacy Preservation in the Publication of Trajectories
Terrovitis, M., & Mamoulis, N. (2008) · The Ninth International Conference on Mobile Data Management (mdm 2008) · doi:10.1109/mdm.2008.29 · Cited by 289
A simple and practical algorithm for differentially private data release
Hardt, M., Ligett, K., & McSherry, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.4763 · Cited by 283
Privacy-preserving trajectory data publishing by local suppression
Chen, R., Fung, B. C. M., Mohammed, N., Desai, B. C., & Wang, K. (2013) · Information Sciences · doi:10.1016/j.ins.2011.07.035 · Cited by 252
Self-citationPublishing set-valued data via differential privacy
Chen, R., Mohammed, N., Fung, B. C. M., Desai, B. C., & Xiong, L. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402744 · Cited by 220
Self-citationDifferential privacy via wavelet transforms
Xiao, X., Wang, G., & Gehrke, J. (2010) · 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) · doi:10.1109/icde.2010.5447831 · Cited by 178
Yarovoy, R., Bonchi, F., Lakshmanan, L. V. S., & Wang, H. (2009) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1516360.1516370 · Cited by 151
Movement Data Anonymity through Generalization
Monreale, A., Giannotti, F., Pedreschi, D., Rinzivillo, S., Andrienko, G., Andrienko, N. V., & Wrobel, S. (2010) · Cited by 146
Xiao, X., Bender, G., Hay, M., & Gehrke, J. E. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989348 · Cited by 145
Differentially-private network trace analysis
McSherry, F., & Mahajan, R. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851199 · Cited by 110
Differentially Private Trajectory Data PublicationPreprint
Chen, R., Fung, B. C. M., & Desai, B. C. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.2020 · Cited by 83
Self-citationTrajectory anonymity in publishing personal mobility data
Bonchi, F., Lakshmanan, L. V. S., & Wang, H. (2011) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2031331.2031336 · Cited by 68
Privacy-aware location data publishing
Hu, H., Xu, J., On, S. T., Du, J., & Ng, J. K. (2010) · ACM Transactions on Database Systems · doi:10.1145/1806907.1806910 · Cited by 56
Cited by
Differential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
Differential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
SafePath: Differentially-private publishing of passenger trajectories in transportation systems
Al-Hussaeni, K., Fung, B. C. M., Iqbal, F., Dagher, G. G., & Park, E. G. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.07.007 · Cited by 52
MNSSp3: medical big data privacy protection platform based on internet of things
Wu, X., Zhang, Y., Wang, A., Shi, M., Wang, H., & Liu, L. (2022) · Neural Computing and Applications · doi:10.1007/s00521-020-04873-z · Cited by 38
Sequential Trajectory Data Publishing With Adaptive Grid-Based Weighted Differential Privacy
Xie, G., Xu, H., Xu, J., Zhao, S., Li, Y., Wang, C.-D., Hu, X., & Tian, Y. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3449433 · Cited by 6
Metadata
- Authors
- Chen, R., Acs, G., & Castelluccia, C.
- Venue
- Proceedings of the 2012 ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2012-10-16
- Pages
- 638-649
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2108215372
- Cited by
- 274
- References
- 23
- FWCI
- 10.34
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.