Existing location-privacy-preserving methods primarily focus on solving the problem of location-privacy preservation in the global space. This not only increases the response time of the location service, it also degrades the data quality. In this paper, a k-anonymity algorithm based on locality-sensitive hashing is proposed to solve the problem of location-privacy preservation in the subspace. In the proposed algorithm, higher efficiency and higher quality of service are achieved by applying a bottom-up grid-search method. Further, reasonable division is obtained based on locality-sensitive hashing by retaining position characteristics. The results of experiments conducted to evaluate the proposed algorithm indicate that the proposed algorithm provides a smaller anonymous spatial region, higher data quality, and lower time cost than methods with no subspace.
ZhangS.ChooK.-K.R.LiuQ. and WangG., Enhancing privacy through uniform grid and caching in location-based services, Future Generation Computer Systems-the International Journal of Escience86 (2018), 881–892.
2.
HuQ.WangS.HuC.HuangJ.LiW. and ChengX., Messages in a concealed bottle: achieving query content privacy with accurate location-based services, IEEE Transactions on Vehicular Technology67(2018), 7698–7711.
3.
DimitriouT. and Al IbrahimN., “I wasn’t there” Deniable, privacy-aware scheme for decentralized location-based services, Future Generation Computer Systems-the International Journal of Escience86 (2018), 253–265.
4.
AbulO. and BayrakC., From location to location pattern privacy in location-based services, Knowledge and Information Systems56 (2018), 533–557.
5.
ChenM.LiW.ChenX.LiZ.LuS. and ChenD., LPPS: A distributed cache pushing based k-anonymity location privacy preserving scheme, Mobile Information Systems2016 (2016), 1–16.
6.
JiaJ. and ZhangF., Nonexposure accurate location k-anonymity algorithm in LBS, The Scientific World Journal2014 (2014), 619357–619357.
7.
ShinK.G.JuX.ChenZ. and HuX., Privacy protection for users of location-based services, IEEE Wireless Communications19 (2012), 30–39.
8.
HeX.JinR. and DaiH., Leveraging spatial diversity for privacy-aware location-based services in mobile networks, IEEE Transactions on Information Forensics and Security13 (2018), 1524–1534.
9.
SweeneyL., K-anonymity: A model for protecting privacy, International Journal of Uncertainty Fuzziness and Knowledge-Based Systems10 (2002), 557–570.
10.
BiswasP. and SairamA.S., Modeling privacy approaches for location based services, Computer Networks140 (2018), 1–14.
11.
GhaffariM.GhadiriN.ManshaeiM.H. and LahijaniM.S., P(4)QS: A peer-to-peer privacy preserving query service for location-based mobile applications, IEEE Transactions on Vehicular Technology66 (2017), 9458–9469.
12.
ZhangY.TongW. and ZhongS., On designing satisfaction-ratio-aware truthful incentive mechanisms for k-anonymity location privacy, IEEE Transactions on Information Forensics and Security11 (2016), 2528–2541.
13.
GorisseD.CordM. and PreciosoF., Locality-sensitive hashing for chi2 distance, IEEE Transactions on Pattern Analysis and Machine Intelligence34 (2012), 402–409.
14.
ZhangH.ChenZ.,LiuZ.ZhuY. and WuC., Location prediction based on transition probability matrices constructing from sequential rules for spatial-temporal k-anonymity dataset, Plos One11(8), e0160629.
15.
KimJ.S. and LiK.J., Location k-anonymity in indoor spaces, Geoinformatica20 (2016), 415–451.
16.
BhaladhareP.R. and JinwalaD.C., Novel approaches for privacy preserving data mining in k-anonymity model, Journal of Information Science and Engineering32 (2016), 63–78.
17.
Caballero-GilC.Molina-GilJ.Hernandez-SerranoJ.LeonO. and Soriano-IbanezM., Providing k-anonymity and revocation in ubiquitous VANETs, Ad Hoc Networks36 (2016), 482–494.
18.
LiuC.G.LiuI.H.YaoW.S. and LiJ.S., K-anonymity against neighborhood attacks in weighted social networks, Security and Communication Networks8 (2015), 3864–3882.
19.
NayahiJ.J.V. and KavithaV., An efficient clustering for anonymizing data and protecting sensitive labels, International Journal of Uncertainty Fuzziness and Knowledge-Based Systems23 (2015), 685–714.
20.
GkountounaO. and TerrovitisM., Anonymizing collections of tree-structured data, IEEE Transactions on Knowledge and Data Engineering27 (2015), 2034–2048.
21.
WangS.L.TsaiY.C.KaoH.Y. and HongT.P., On anonymizing transactions with sensitive items, Applied Intelligence41 (2014), 1043–1058.
22.
WangL.E. and LiX.X., A clustering-based bipartite graph privacy-preserving approach for sharing high-dimensional data, International Journal of Software Engineering and Knowledge Engineering24 (2014), 1091–1111.
23.
FahadA.TariZ.AlmalawiA.GoscinskiA.KhalilI. and MahmoodA., PPFSCADA: Privacy preserving framework for SCADA data publishing, Future Generation Computer Systems-the International Journal of Escience37 (2014), 496–511.
24.
LoukidesG.Gkoulalas-DivanisA. and ShaoJ., Efficient and flexible anonymization of transaction data, Knowledge and Information Systems36 (2013), 153–210.
25.
GhinitaG.KalnisP. and TaoY., Anonymous publication of sensitive transactional data, IEEE Transactions on Knowledge and Data Engineering23 (2011), 161–174.
26.
WangJ. and LinC., MapReduce based personalized locality sensitive hashing for similarity joins on large scale data, Computational Intelligence and Neuroscience2015 (2015), 217216–217216.
27.
LuY.H.MaT.H.ZhongS.M.CaoJ.WangX. and Al-DhelaanA., Improved locality-sensitive hashing method for the approximate nearest neighbor problem, Chinese Physics B23 (2014), 217–225.
28.
WuZ. and ZouM., An incremental community detection method for social tagging systems using locality-sensitive hashing, Neural Networks58 (2014), 14–28.
29.
ZhangX.CuiY.LiD.LiuX. and ZhangF., An adaptive mean shift clustering algorithm based on locality-sensitive hashing, Optik123 (2012), 1891–1894.
30.
ChenC.HorngS.J. and HuangC.P., Locality sensitive hashing for sampling-based algorithms in association rule mining, Expert Systems with Applications38 (2011), 12388–12397.
31.
CaoY.JiangT. and GirkeT., Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing, Bioinformatics26 (2010), 953–959.
32.
KogaH.IshibashiT. and WatanabeT., Fast agglomerative hierarchical clustering algorithm using locality-sensitive hashing, Knowledge and Information Systems12 (2007), 25–53.
33.
ZamoraJ.MendozaM. and AllendeH., Hashing-based clustering in high dimensional data, Expert Systems with Applications62 (2016), 202–211.
34.
PanJ. and ManochaD., Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing, International Journal of Robotics Research35 (2016), 1477–1496.
35.
Al-QershiO.M. and KhooB.E., Copy-move forgery detection using on locality sensitive hashing and k-means clustering, In: Information science and applications (ICISA), Springer Singapore, 2016, pp. 663–672.
36.
ZhangW.JiJ.ZhuJ.LiJ.XuH. and ZhangB., BitHash: An efficient bitwise locality sensitive hashing method with applications, Knowledge-Based Systems97 (2016), 40–47.
37.
ZhuZ.XiaoJ.HeS.JiZ. and SunY., A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem, Information Sciences329 (2016), 73–89.
38.
DatarM.ImmorlicaN.IndykP. and MirrokniV.S., Locality-sensitive hashing scheme based on p-stable distributions, In: Twentieth Symposium on Computational Geometry, New York: ACM, 2004, pp. 253–262.
39.
VuK.ZhengR. and GaoJ., Efficient algorithms for k-anonymous location privacy in participatory sensing, In: IEEE INFOCOM, New York: IEEE, 2012, pp. 2399–2407.
