Education, Science, Technology, Innovation and Life
Open Access
Sign In

Protecting Privacy through Differential Privacy of Location Data

Download as PDF

DOI: 10.23977/acss.2023.070209 | Downloads: 12 | Views: 392

Author(s)

Wenbing Tang 1, Weiyuan Zhang 1

Affiliation(s)

1 School of Computer Science and Engineering, Anhui University of Science and Technology, Anhui Huainan, China

Corresponding Author

Weiyuan Zhang

ABSTRACT

Location-based services (LBS) are now used in many different industries thanks to the quick growth of mobile computing devices, but this also puts user security and privacy at risk. A location protection system that combines clustering and differential privacy is suggested to solve the issue of uploading and sharing user location information with outside parties. Firstly, the surrounding location points are sorted and divided according to the density of location information, and k-means clustering is used to generalize them; the cluster centers are noise-added by a planar Laplacian mechanism under the premise of satisfying geographic indistinguishability to obtain the perturbed position of each location point, and then location privacy is protected. The experimental results proved that the algorithm in this paper has higher data utilization under the premise of ensuring location privacy.

KEYWORDS

Differential privacy, k - means clustering, location privacy, LBS

CITE THIS PAPER

Wenbing Tang, Weiyuan Zhang. Protecting Privacy through Differential Privacy of Location Data. Advances in Computer, Signals and Systems (2023) Vol. 7: 65-72. DOI: http://dx.doi.org/10.23977/acss.2023.070209.

REFERENCES

[1] Jiang H.Y., Zeng J.Q., & Han K. (2021) Research on Location Privacy Protection Methods for Mobile Users in 5G Environment. Transactions of Beijing Institute of Technology, 41(01), 84-92.
[2] Yang Y., Wang R.C. (2020) Location based service location privacy protection method based on location security in augmented reality. Journal of Computer Applications, 40(05):1364-1368.
[3] Xiong, J., Ren, J., Chen, L., Yao, Z., Lin, M., Wu, D., & Niu, B. (2018). Enhancing privacy and availability for data clustering in intelligent electrical service of IoT. IEEE Internet of Things Journal, 6(2), 1530-1540.
[4] Xiong, J., Ma, R., Chen, L., Tian, Y., Li, Q., Liu, X., & Yao, Z. (2019). A personalized privacy protection framework for mobile crowdsensing in IIoT. IEEE Transactions on Industrial Informatics, 16(6), 4231-4241.
[5] He J., Du J., & Zhu N. (2020) Research on k-anonymity Algorithm for Personalized Quasi-identifier Attributes. Information network security, 20(10), 19-26.
[6] Liu, Q., Yu, J., Han, J., & Yao, X. (2021). Differentially private and utility-aware publication of trajectory data. Expert Systems with Applications, 180, 115120.
[7] Cheng, S., Yadong, Z., Lei, W., & Zhizhong, L. (2018). Research on k-anonymity privacy protection scheme based on bilinear pairings. The Journal of China Universities of Posts and Telecommunications, 25(5), 18-25.
[8] Zhang, Y. B., Zhang, Q. Y., Li, Z., Yan, Y., & Zhang, M. Y. (2019). A k-anonymous Location Privacy Protection Method of Dummy Based on Geographical Semantics. Int. J. Netw. Secur, 21(6), 937-946.
[9] Zhao, X., Pi, D., & Chen, J. (2020). Novel trajectory privacy-preserving method based on prefix tree using differential privacy. Knowledge-Based Systems, 198, 105940.
[10] Tian, Y., Kaleemullah, M. M., Rodhaan, M. A., Song, B., Al-Dhelaan, A., & Ma, T. (2019). A privacy preserving location service for cloud-of-things system. Journal of Parallel and Distributed Computing, 123, 215-222.
[11] Tareq, M., Sundararajan, E. A., Mohd, M., & Sani, N. S. (2020). Online clustering of evolving data streams using a density grid-based method. IEEE Access, 8, 166472-166490.
[12] Sabarish, B. A., Karthi, R., & Kumar, T. G. (2020). Graph similarity-based hierarchical clustering of trajectory data. Procedia Computer Science, 171, 32-41.
[13] Sinaga, K. P., & Yang, M. S. (2020). Unsupervised K-means clustering algorithm. IEEE access, 8, 80716-80727.

Downloads: 13687
Visits: 260467

Sponsors, Associates, and Links


All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.