The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Privacy: Theory meets Practice on the Map
Abstract
In this paper, we propose the first formal privacy analysis of a data anonymization process known as the synthetic data generation, a technique becoming popular in the statistics community. The target application for this work is a mapping program that shows the commuting patterns of the population of the United States. The source data for this application were collected by the U.S. Census Bureau, but due to privacy constraints, they cannot be used directly by the mapping program. Instead, we generate synthetic data that statistically mimic the original data while providing privacy guarantees. We use these synthetic data as a surrogate for the original data. We find that while some existing definitions of privacy are inapplicable to our target application, others are too conservative and render the synthetic data useless since they guard against privacy breaches that are very unlikely. Moreover, the data in our target application is sparse, and none of the existing solutions are tailored to anonymize sparse data. In this paper, we propose solutions to address the above issues.
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
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
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
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Samarati, P., & Sweeney, L. (2018) · doi:10.1184/r1/6625469 · Cited by 1,326
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Smooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., & Smith, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250803 · Cited by 974
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
Limiting privacy breaches in privacy preserving data mining
Evfimievski, A., Gehrke, J., & Srikant, R. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773174 · Cited by 815
Self-citationPractical privacy: the SuLQ framework
Blum, A., Dwork, C., McSherry, F., & Nissim, K. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065184 · Cited by 797
Multiple Imputation for Nonresponse in Surveys
Campion, W. M., & Rubin, D. B. (1989) · Journal of Marketing Research · doi:10.2307/3172772 · Cited by 764
Personalized privacy preservation
Xiao, X., & Tao, Y. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142500 · Cited by 670
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., & Talwar, K. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265569 · Cited by 468
Multiple Imputation for Statistical Disclosure Limitation
Raghunathan, T., Reiter, J. P., & Rubin, D. B. (2003) · Journal of Official Statistics · Cited by 376
Aggregate Query Answering on Anonymized Tables
Zhang, Q., Koudas, N., Srivastava, D., & Yu, T. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367857 · Cited by 357
Data-swapping: A technique for disclosure control
Dalenius, T., & Reiss, S. P. (1982) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(82)90058-1 · Cited by 349
Injecting utility into anonymized datasets
Kifer, D., & Gehrke, J. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142499 · Cited by 296
Self-citationSuppression Methodology and Statistical Disclosure Control
Cox, L. H. (1980) · Journal of the American Statistical Association · doi:10.1080/01621459.1980.10477481 · Cited by 271
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
Martin, D. J., Kifer, D., Machanavajjhala, A., Gehrke, J., & Halpern, J. Y. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367858 · Cited by 263
Self-citationAgrawal, R., Srikant, R., & Thomas, D. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066187 · Cited by 242
Approximation Algorithms for k-Anonymity
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., & Zhu, A. (2005) · Cited by 231
The boundary between privacy and utility in data publishing
Rastogi, V., Suciu, D. M., & Hong, S. (2007) · Very Large Data Bases · Cited by 228
Disclosure-Limited Data Dissemination
Duncan, G. T., & Lambert, D. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478229 · Cited by 226
Using CART to generate partially synthetic public use microdata
Reiter, J. P. (2005) · Cited by 216
Privacy skyline: privacy with multidimensional adversarial knowledge
Chen, B.-C., LeFevre, K., & Ramakrishnan, R. (2007) · Cited by 168
Estimating Risks of Identification Disclosure in Microdata
Reiter, J. P. (2005) · Journal of the American Statistical Association · doi:10.1198/016214505000000619 · Cited by 129
When Random Sampling Preserves Privacy
Chaudhuri, K., & Mishra, N. (2006) · Lecture notes in computer science · doi:10.1007/11818175_12 · Cited by 101
Statistical tools for disclosure limitation in multi-way contingency tables
Dobra, A. (2002) · Medical Entomology and Zoology · Cited by 35
Cited by
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Geo-indistinguishability: differential privacy for location-based systems
Andrés, M. E., Bordenabe, N. E., Chatzikokolakis, K., & Palamidessi, C. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516735 · Cited by 1,059
Differentially private recommender systems: Building privacy into the Netflix Prize contenders
McSherry, F., & Mironov, I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557090 · Cited by 664
Kifer, D., & Machanavajjhala, A. (2011) · Proceedings of the 2011 ACM SIGMOD International Conference on Management of data · doi:10.1145/1989323.1989345 · Cited by 619
Self-citationData mining with differential privacy
Friedman, A., & Schuster, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835868 · Cited by 461
Metadata
- Authors
- Machanavajjhala, A., Kifer, D., Abowd, J., Gehrke, J., & Vilhuber, L.
- Venue
- 2008 IEEE 24th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2008-04
- Pages
- 277-286
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W4255574744
- Cited by
- 435
- References
- 30
- FWCI
- 11.66
- Type
- conference paper
- Language
- en
- Open access
- closed
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.