A Hybrid Differential Privacy and k-Anonymity Framework for Enhancing Location Privacy in Location-Based Services
DOI:
https://doi.org/10.4108/eetss.9845Keywords:
Location-Based Services, Differential Privacy, k-Anonymity, Laplace Mechanism, Geo-Privacy, Smart City AnalyticsAbstract
The growing reliance on Location-Based Services (LBS) has intensified privacy risks, as the continuous collection of sensitive user location data exposes individuals to potential re-identification and unauthorised tracking. This paper presents a hybrid privacy-preserving framework that combines the Diameter-Bounded DBSCAN clustering algorithm for spatial k-anonymity with an adaptive Laplace mechanism for ε-differential privacy. This integration ensures the formation of compact anonymity groups while maintaining high data utility. Experimental evaluation on the real-world GeoLife dataset demonstrates 85.1% query accuracy, 0.14 trajectory distortion (EDR), and average query latency below 100 milliseconds for 20,000 users, outperforming DPPS and AdaptiveGrid baselines. Comprehensive sensitivity analysis of the diameter threshold (dmax) and evaluation of suppression bias confirm the framework’s robustness, scalability, and practical suitability for real-time LBS deployment.
References
[1] Sweeney L. k-anonymity: A MODEL FOR PROTECTING PRIVACY. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems. 2002;10(5):557–570.
[2] Dwork C, McSherry F, Nissim K, Smith A. Calibrating Noise to Sensitivity in Private Data Analysis. Lecture Notes in Computer Science 3876 LNCS:265–84. https://link.springer.com/chapter/10.1007/11681878_14.
[3] Gruteser M, Grunwald D. Anonymous usage of location-based services through spatial and temporal cloaking. Proceedings of the 1st International Conference on Mobile Systems, Applications and Services, MobiSys 2003– 2003 May 5 CA.p. 31-42.doi:10.1145/10661161189037.
[4] Andrés ME, Bordenabe NE, Chatzikokolakis K, Palamidessi C. Geo-Indistinguishability: Differential Privacy for Location-Based Systems. [cited 2025 Jul 27]; http://dx.doi.org/10.1145/2508859.2516735.
[5] Wang B, Li H, Ren X, Guo Y. An Efficient Differential Privacy-Based Method for Location Privacy Protection in Location-Based Services. Sensors. 2023 Jun 1;23(11).
[6] Li L, Huang J, Chang L, Weng J, Chen J, Li J. DPPS: A novel dual privacy-preserving scheme for enhancing query privacy in continuous location-based services. Front Comput Sci. 2023 Oct;17.
[7] Li Y, Wang B, Liu Q, Zheng X, Li J, Wang Y, et al. LPPS-IKHC: Location Privacy-Preserving Scheme using Improved k-anonymity and Hybrid Cache for IoV. IEEE Trans Veh Technol. 2025;
[8] Kim J. Improving Data Utility in Privacy-Preserving Location Data Collection via Adaptive Grid Partitioning. Electronics (Switzerland). 2024 Aug 1;13(15).
[9] Ma T, Deng Q, Rong H, Al-Nabhan N. A privacy-preserving trajectory data synthesis framework based on differential privacy. Journal of Information Security and Applications. 2023 Sep 1;77.
[10] Gionis A, Mazza A, Tassa T. K-anonymization revisited. Proc Int Conf Data Eng. 2008;744–53.
[11] Aggarwal G, Feder T, Kenthapadi K, Khuller S, Panigrahy R, Thomas D, et al. Achieving anonymity via clustering. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems;2006 p.153–62. Doi:10.1145/1142351.1142374
[12] Jin F, Hua W, Francia M, Chao P, Orlowska ME, Zhou X. A Survey and Experimental Study on Privacy-Preserving Trajectory Data Publishing. IEEE Trans Knowl Data Eng. 2023 Jun 1;35(6):5577–5596.
[13] Yan L, Li L, Mu X, Wang H, Chen X, Shin H. Differential Privacy Preservation for Location Semantics. Sensors. 2023 Feb 1;23(4):1-18.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 EAI Endorsed Transactions on Security and Safety
This work is licensed under a Creative Commons Attribution 4.0 International License.
This is an open-access article distributed under the terms of the Creative Commons Attribution CC BY 4.0 license, which permits unlimited use, distribution, and reproduction in any medium so long as the original work is properly cited.
