A low cost and un-cancelled laplace noise based differential privacy algorithm for spatial decompositions
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
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 · see citing works
Guttman, A. (1984) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/602259.602266 · Cited by 6,611 · see citing works
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557 · see citing works
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856 · see citing works
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542 · see citing works
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451 · see citing works
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J. E., Kifer, D., & Venkitasubramaniam, M. (2006) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2006.1 · Cited by 2,397 · see citing works
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 · cited 1× · see citing works
“To address this problem, we can perturb the information of this tree to achieve preserving privacy [7] before publishing, which is called preserving privacy data publishing [8, 9].”
BackgroundGuttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,616 · see citing works
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Bodlaender, H. L. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793251219 · Cited by 1,566 · see citing works
Towards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.41 · Cited by 1,339 · see citing works
A firm foundation for private data analysis
Dwork, C. (2010) · Communications of the ACM · doi:10.1145/1866739.1866758 · Cited by 858 · see citing works
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygın, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 810 · see citing works
Differentially private recommender systems
McSherry, F., & Mironov, I. (2009) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557090 · Cited by 676 · see citing works
Data mining with differential privacy
Friedman, A., & Schuster, A. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835868 · Cited by 471 · see citing works
Differentially Private Spatial Decompositions
Cormode, G., Procopiuc, C. M., Srivastava, D., Shen, E., & Yu, T. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.16 · Cited by 412 · see citing works
Differential Privacy via Wavelet Transforms
Xiao, X., Wang, G., & Gehrke, J. E. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.247 · Cited by 373 · see citing works
Differentially private data release for data mining
Mohammed, N., Chen, R., Fung, B. C. M., & Yu, P. S. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020487 · Cited by 328 · see citing works
Optimizing linear counting queries under differential privacy
Li, C., Hay, M., Rastogi, V., Miklau, G., & McGregor, A. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807104 · Cited by 321 · see citing works
Self-citationBig privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307 · see citing works
A simple and practical algorithm for differentially private data releasePreprint
Hardt, M., Ligett, K., & McSherry, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.4763 · Cited by 296 · see citing works
Zhang, J., Cormode, G., Procopiuc, C. M., Srivastava, D., & Xiao, X. (2014) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2588555.2588573 · Cited by 279 · see citing works
Differentially private grids for geospatial data
Qardaji, W., Yang, W., & Li, N. (2013) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2013.6544872 · Cited by 265 · see citing works
Beyond RNNs: Positional Self-Attention with Co-Attention for Video Question Answering
Li, X., Song, J., Gao, L., Liu, X., Huang, W., He, X., & Gan, C. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33018658 · Cited by 265 · see citing works
Self-citationDifferentially private histogram publication
Xu, J. W., Zhang, Z., Xiao, X., Yang, Y., Yu, G., & Winslett, M. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0309-y · Cited by 239 · see citing works
Differential privacy via wavelet transforms
Xiao, X., Wang, G., & Gehrke, J. E. (2010) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2010.5447831 · Cited by 178 · see citing works
Online Task Assignment for Crowdsensing in Predictable Mobile Social Networks
Xiao, M., Wu, J., Huang, L., et al. (2016) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2016.2616473 · Cited by 166 · see citing works
Zhang, J., Xiao, X., & Xie, X. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2882928 · Cited by 163 · see citing works
Private Release of Graph Statistics using Ladder Functions
Zhang, J. J., Cormode, G., Procopiuc, C. M., et al. (2015) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2737785 · Cited by 117 · see citing works
Efficient task assignment in spatial crowdsourcing with worker and task privacy protection
Liu, A., Wang, W., Shang, S., Li, Q., & Zhang, X. (2017) · GeoInformatica · doi:10.1007/s10707-017-0305-2 · Cited by 113 · see citing works
Self-citationAn Optimal Decomposition Algorithm for Tree Edit Distance
Demaine, E. D., Mozes, S., Rossman, B., et al. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73420-8_15 · Cited by 99 · see citing works
A Survey of Privacy Preserving Data Publishing using Generalization and Suppression
Yang, X., Ma, T., Tang, M., & Tian, W. (2014) · Applied Mathematics & Information Sciences · doi:10.12785/amis/080321 · Cited by 82 · see citing works
SRA: Secure Reverse Auction for Task Assignment in Spatial Crowdsourcing
Xiao, M., Ma, K., Liu, A., Zhao, H., Li, Z., Zheng, K., & Zhou, X. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2893240 · Cited by 69 · see citing works
Privacy-Preserving Task Assignment in Spatial Crowdsourcing
Liu, A., Li, Z., Liu, G., et al. (2017) · Journal of Computer Science and Technology · doi:10.1007/s11390-017-1772-5 · Cited by 45 · see citing works
Shen, F., Mu, Y., Yang, Y., et al. (2017) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3077136.3080767 · Cited by 42 · see citing works
Towards secure and truthful task assignment in spatial crowdsourcing
Zhai, D., Sun, Y., Liu, A., et al. (2018) · World Wide Web · doi:10.1007/s11280-018-0638-2 · Cited by 36 · see citing works
Kd-tree Based Nonuniform Simplification of 3D Point Cloud
Xiao, Z., & Huang, W. (2009) · International Conference on Genetic and Evolutionary Computing · doi:10.1109/wgec.2009.20 · Cited by 24 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Federated learning meets blockchain in edge computing: Opportunities and challenges
Nguyen, D. C., Ding, M., Pham, Q.-V., Pathirana, P. N., Le, L. B., Seneviratne, A., Li, J., Niyato, D., & Poor, H. V. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3072611 · Cited by 661 · see citing works
- Authors
- Li, X., Wang, Y., Song, J., Liu, Y., Zhang, X., Zhou, K., & Li, C.
- Affiliations
- Wuhan National Laboratory for Optoelectronics (CN)
- University of Electronic Science and Technology of China (CN)
- Wuhan University (CN)
- Corresponding author
- Li, Chunhua
- Venue
- World Wide Web
- Published
- 2020-01
- Volume
- 23
- Issue
- 1
- Pages
- 549-572
- ISSN
- 1386-145X (ISSN-L)
- 1573-1413
- OpenAlex
- W3000354307
- Cited by
- 7
- References
- 37
- Citations by year
- 2026: 1 · 2023: 1 · 2022: 3 · 2021: 1 · 2020: 1
- FWCI
- 0.59
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- World Wide Web (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Signal Processing › Data Management and Algorithms
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- differential privacy, Laplace noise, spatial decomposition, noise cancellation, query privacy, sensitivity analysis, spatial data privacy
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