{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,11]],"date-time":"2022-12-11T05:28:50Z","timestamp":1670736530936},"reference-count":26,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The rapid development of mobile communication technology not only brings convenience and fun to our life, but also brings a series of problems such as privacy disclosure. Therefore, it is very necessary to study the privacy protection method based on location service to strengthen the security of location privacy. The purpose of this work is to improve the security of location privacy and prevent the disclosure of user privacy by studying the characteristics of location services and privacy protection methods. This article first describes the characteristics of the important location privacy protection law, and then studies the structural characteristics and operation process of the location privacy protection law. This work evaluates the advantages and disadvantages of different methods, and finally compares the performance of several privacy protection algorithms through experimental analysis. Through the research of hiding space method, two-level cache method based on user grid, differential privacy protection method and experimental analysis of the algorithm, an effective privacy protection algorithm can be obtained. It can better protect the location privacy of users. For example, dual-active in the hidden space algorithm has the best privacy protection performance. Compared with other algorithms, the success rate of generating hidden space is increased by more than 10%, and the time of generating hidden space is shortened by about a quarter. The algorithm It has certain practical value and significance for use in the privacy protection of users.<\/jats:p>","DOI":"10.1515\/comp-2022-0250","type":"journal-article","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T12:17:40Z","timestamp":1670674660000},"page":"389-402","source":"Crossref","is-referenced-by-count":0,"title":["Privacy protection methods of location services in big data"],"prefix":"10.1515","volume":"12","author":[{"given":"Wenfeng","family":"Liu","sequence":"first","affiliation":[{"name":"Student Affairs Office, Hunan College of Foreign Studies , Changsha , 410203, Hunan , China"}]},{"given":"Juanjuan","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Humanities and Arts, Hunan Institute of Transportation Engineering , Hengyang , 421000, Hunan , China"}]},{"given":"Zhong","family":"Xi","sequence":"additional","affiliation":[{"name":"College of Western Languages, Hunan College of Foreign Languages , Changsha , 410203, Hunan , China"}]}],"member":"374","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"2022121012173482207_j_comp-2022-0250_ref_001","doi-asserted-by":"crossref","unstructured":"O. Ruan, L. Zhang, and Y. Zhang, \u201cLocation-sharing protocol for privacy protection in mobile online social networks,\u201d EURASIP J. Wirel. Commun. Netw., vol. 2021, no. 1, pp. 1\u201314, 2021.","DOI":"10.1186\/s13638-021-01999-z"},{"key":"2022121012173482207_j_comp-2022-0250_ref_002","doi-asserted-by":"crossref","unstructured":"X. Xue, H. Li, Z. Li, and J. Xiong, \u201cLocation privacy protection scheme for LBS in IoT ,\u201d Wirel. Commun. Mob. Comput., vol. 2021, no. 5, pp. 1\u201318, 2021.","DOI":"10.1155\/2021\/9948543"},{"key":"2022121012173482207_j_comp-2022-0250_ref_003","doi-asserted-by":"crossref","unstructured":"M. R. Lee, W. W. Lee, and B. Jang, \u201cAnonymization algorithms for location privacy protection: A survey,\u201d JP J. Heat. Mass. Transf., vol. 15, no. 2, pp. 291\u2013298, 2018.","DOI":"10.17654\/HMSI218291"},{"key":"2022121012173482207_j_comp-2022-0250_ref_004","doi-asserted-by":"crossref","unstructured":"Z. Wu, R. Wang, Q. Li, X. Lian, G. Xu, E. Chen, et al., \u201cA location privacy-preserving system based on query range cover-up or location-based services,\u201d IEEE Trans. Veh. Technol., vol. 69, no. 5, pp. 5244\u20135254, 2020.","DOI":"10.1109\/TVT.2020.2981633"},{"key":"2022121012173482207_j_comp-2022-0250_ref_005","doi-asserted-by":"crossref","unstructured":"H. Li, Y. Wang, F. Guo, J. Wang, and C. Wu, \u201cDifferential privacy location protection method based on the Markov model,\u201d Wirel. Commun. Mob. Comput., vol. 2021, no. 4, pp. 1\u201312, 2021.","DOI":"10.1155\/2021\/4696455"},{"key":"2022121012173482207_j_comp-2022-0250_ref_006","doi-asserted-by":"crossref","unstructured":"M. U. Ashraf, K. Jambi, R. Qayyum, H. Ejaz, and I. Ilyas, \u201cIDP: A privacy provisioning framework for TIP attributes in trusted third party-based location-based services systems,\u201d Int. J. Adv. Comput. Sci. Appl., vol. 11, no. 7, pp. 604\u2013617, 2020.","DOI":"10.14569\/IJACSA.2020.0110773"},{"key":"2022121012173482207_j_comp-2022-0250_ref_007","doi-asserted-by":"crossref","unstructured":"K. S. Reddy and M. Balaraju, \u201cComparative study on trustee of third party auditor to provide integrity and security in cloud computing,\u201d Mater. Today Proc., vol. 5, no. 1, pp. 57\u2013564, 2018.","DOI":"10.1016\/j.matpr.2017.11.118"},{"key":"2022121012173482207_j_comp-2022-0250_ref_008","unstructured":"Y. B. Zhang, Q. Y. Zhang, Z. Y. Li, Y. Yan, and M. Y. Zhang, \u201cA k-anonymous location privacy protection method of dummy based on geographical semantics,\u201d Int. J. Netw. Secur., vol. 21, no. 6, pp. 937\u2013946, 2019."},{"key":"2022121012173482207_j_comp-2022-0250_ref_009","unstructured":"Y. Zhou, Z. Huang, J. Chen, and Q. Chen, \u201cPrivacy protection based on anonymous consultation for telemedicine diagnosis system,\u201d Boletin Tecnico\/Technical Bull., vol. 55, no. 17, pp. 443\u2013452, 2017."},{"key":"2022121012173482207_j_comp-2022-0250_ref_010","doi-asserted-by":"crossref","unstructured":"A. M. Olteanu, M. Humbert, K. Huguenin, and J. P. Hubaux, \u201cThe (co-)location sharing game,\u201d Proc. Priv. Enhancing Technol., vol. 2019, no. 2, p. 25, 2019.","DOI":"10.2478\/popets-2019-0017"},{"key":"2022121012173482207_j_comp-2022-0250_ref_011","doi-asserted-by":"crossref","unstructured":"Y. Huo, C. Meng, R. Li, and T. Jing, \u201cAn overview of privacy preserving schemes for industrial Internet of Things,\u201d China Commun., vol. 17, no. 10, pp. 1\u201318, 2020.","DOI":"10.23919\/JCC.2020.10.001"},{"key":"2022121012173482207_j_comp-2022-0250_ref_012","doi-asserted-by":"crossref","unstructured":"B. Khalfoun, S. B. Mokhtar, S. Bouchenak, and V. Nitu, \u201cEDEN: Enforcing location privacy through re-identification risk assessment: A federated learning approach,\u201d Proc. ACM Interact. Mob. Wearable Ubiquitous Technol., vol. 5, no. 2, pp. 1\u201325, 2021.","DOI":"10.1145\/3463502"},{"key":"2022121012173482207_j_comp-2022-0250_ref_013","doi-asserted-by":"crossref","unstructured":"C. Chen, Y. Luo, Q. Yu, and G. Hu, \u201cTPPG: Privacy-preserving trajectory data publication based on 3D-grid partition,\u201d Intell. Data Anal., vol. 23, no. 3, pp. 03\u2013533, 2019.","DOI":"10.3233\/IDA-183918"},{"key":"2022121012173482207_j_comp-2022-0250_ref_014","doi-asserted-by":"crossref","unstructured":"S. A. Kumar and M. S. Anbarasi, \u201cNoble authentication protocol with privacy preservation policy for public auditing on shared data,\u201d J. Comput. Theor. Nanosci., vol. 16, no. 8, pp. 3252\u20133258, 2019.","DOI":"10.1166\/jctn.2019.8172"},{"key":"2022121012173482207_j_comp-2022-0250_ref_015","doi-asserted-by":"crossref","unstructured":"A. Shukla, D. Singh, M. Sajwan, M. Kumar, D. Kumari, and A. Kumar, \u201cSLP-RRFPR: a source location privacy protection scheme based on random ring and limited hop fake packet routing for wireless sensor networks,\u201d Multimed. Tools Appl., vol. 81, no. 8, pp. 11145\u201311185, 2022.","DOI":"10.1007\/s11042-022-12157-y"},{"key":"2022121012173482207_j_comp-2022-0250_ref_016","doi-asserted-by":"crossref","unstructured":"L. Zheng, L. Zhang, M. Cui, N. Cao, J. Ding, L. Yalemshet, et al., \u201cThe research of mobile location privacy protection access control method based on game theory,\u201d Wirel. Commun. Mob. Comput., vol. 2018, no. 1, pp. 1\u20139, 2018.","DOI":"10.1155\/2018\/1847890"},{"key":"2022121012173482207_j_comp-2022-0250_ref_017","doi-asserted-by":"crossref","unstructured":"Z. Liu, Z. Xuan, Y. Dong, and B. Zhang, \u201cTrajectory rotation privacy protection algorithm based on k anonymity,\u201d J. Comput. Commun., vol. 6, no. 2, pp. 36\u201347, 2018.","DOI":"10.4236\/jcc.2018.62004"},{"key":"2022121012173482207_j_comp-2022-0250_ref_018","doi-asserted-by":"crossref","unstructured":"J. Chen, H. Ma, D. Zhao, and D. S. L. Wei, \u201cParticipant density-independent location privacy protection for data aggregation in mobile crowd-sensing,\u201d Wirel. Personal. Commun., vol. 98, no. 1, pp. 699\u2013723, 2018.","DOI":"10.1007\/s11277-017-4891-y"},{"key":"2022121012173482207_j_comp-2022-0250_ref_019","doi-asserted-by":"crossref","unstructured":"S. C. Soma, T. Hashem, M. A. Cheema, and S. Samrose, \u201cTrip planning queries with location privacy in spatial databases,\u201d World Wide Web, vol. 20, no. 2, pp. 205\u2013236, 2017.","DOI":"10.1007\/s11280-016-0384-2"},{"key":"2022121012173482207_j_comp-2022-0250_ref_020","doi-asserted-by":"crossref","unstructured":"Y. Dong and D. Pi, \u201cNovel privacy-preserving algorithm based on frequent path for trajectory data publishing,\u201d Knowl. Syst, vol. 148, no. MAY 15, pp. 5\u201365, 2018.","DOI":"10.1016\/j.knosys.2018.01.007"},{"key":"2022121012173482207_j_comp-2022-0250_ref_021","doi-asserted-by":"crossref","unstructured":"T. Murakami, H. Hino, and J. Sakuma, \u201cToward distribution estimation under local differential privacy with small samples,\u201d Proc. Priv. Enhancing Technol., vol. 2018, no. 3, pp. 84\u2013104, 2018.","DOI":"10.1515\/popets-2018-0022"},{"key":"2022121012173482207_j_comp-2022-0250_ref_022","doi-asserted-by":"crossref","unstructured":"M. V. Ahluwalia, A. Gangopadhyay, Z. Chen, and Y. Yesha, \u201cTarget-based, privacy preserving, and incremental association rule mining,\u201d IEEE Trans. Serv. Comput., vol. 10, no. 4, pp. 633\u2013645, 2017.","DOI":"10.1109\/TSC.2015.2484318"},{"key":"2022121012173482207_j_comp-2022-0250_ref_023","doi-asserted-by":"crossref","unstructured":"S. Li, H. Shen, Y. Sang, and H. Tian, \u201cAn efficient method for privacy-preserving trajectory data publishing based on data partitioning,\u201d J. Supercomput., vol. 76, no. 1, pp. 1\u201325, 2020.","DOI":"10.1007\/s11227-019-02906-6"},{"key":"2022121012173482207_j_comp-2022-0250_ref_024","doi-asserted-by":"crossref","unstructured":"M. Nanni, G. Andrienko, C. Boldrini, F. Bonchi, and A. Vespignani, \u201cGive more data, awareness and control to individual citizens, and they will help COVID-19 containment,\u201d Trans. Data Priv., vol. 13, no. 1, pp. 61\u201366, 2020.","DOI":"10.1007\/s10676-020-09572-w"},{"key":"2022121012173482207_j_comp-2022-0250_ref_025","doi-asserted-by":"crossref","unstructured":"H. Shen, G. Bai, and M. Yang, \u201cProtecting trajectory privacy: A user-centric analysis,\u201d J. Netw. Comput. Appl., vol. 82, no. MAR, pp. 128\u2013139, 2017.","DOI":"10.1016\/j.jnca.2017.01.018"},{"key":"2022121012173482207_j_comp-2022-0250_ref_026","doi-asserted-by":"crossref","unstructured":"A. A. Muthana and M. M. Saeed, \u201cAnalysis of user identity privacy in LTE and proposed solution,\u201d Int. J. Comput. Netw. Inf. Secur., vol. 9, no. 1, pp. 4\u201363, 2017.","DOI":"10.5815\/ijcnis.2017.01.07"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2022-0250\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2022-0250\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T12:18:01Z","timestamp":1670674681000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2022-0250\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12,10]]},"published-print":{"date-parts":[[2022,12,10]]}},"alternative-id":["10.1515\/comp-2022-0250"],"URL":"https:\/\/doi.org\/10.1515\/comp-2022-0250","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}