{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:35:53Z","timestamp":1772908553990,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFE0126000"],"award-info":[{"award-number":["2018YFE0126000"]}]},{"DOI":"10.13039\/100017338","name":"Key Program of NSFC-Tongyong Union Foundation","doi-asserted-by":"crossref","award":["U1636209"],"award-info":[{"award-number":["U1636209"]}],"id":[{"id":"10.13039\/100017338","id-type":"DOI","asserted-by":"crossref"}]},{"name":"BUPT excellent Ph.D. students foundation","award":["CX2019233"],"award-info":[{"award-number":["CX2019233"]}]},{"name":"BUPT excellent Ph.D. students foundation","award":["CX2019119"],"award-info":[{"award-number":["CX2019119"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Online taxi-hailing has become people\u2019s most popular trip mode due to its convenience and low cost. However, it also poses a privacy threat to passengers and drivers, since the online taxi-hailing service providers are able to track their precise mobility trajectories. In addition, there is a certain time delay between the time of a passenger makes a request and the time of the driver arrives the passenger\u2019s boarding position in current online taxi-hailing system. To solve these two problems, we present a new and efficient location privacy protection scheme based on the MinHash algorithm (LPPM). With the LPPM, the exact positions of passengers and drivers are generalized into a set of points of interest around them, and the distance between them is transformed into the similarity between the two sets. Thus a service provider can efficiently match passengers and drivers by using MinHash algorithm without revealing their specific location information. In this paper, we use mobile edge computing technology in the online taxi-hailing system to address the second challenge. It can speed up data processing, drivers can make decisions in advance and reduce the possibility of road congestion. Security analysis shows that LPPM has high security, and the final experimental results confirmed that LPPM is effective.<\/jats:p>","DOI":"10.1007\/s12083-020-00982-7","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:02:23Z","timestamp":1598313743000},"page":"69-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Location privacy-preserving in online taxi-hailing services"],"prefix":"10.1007","volume":"14","author":[{"given":"Xiaoying","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingqi","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miaomiao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,25]]},"reference":[{"key":"982_CR1","doi-asserted-by":"crossref","unstructured":"Liu B, Fu Y, Yao Z, Xiong H (2013) Learning geographical preferences for point-of-interest recommendation. In: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013. ACM, Chicago, pp 1043\u20131051","DOI":"10.1145\/2487575.2487673"},{"key":"982_CR2","unstructured":"Beck MT, Werner M, Feld S, Schimper T (2014) Mobile edge computing: a taxonomy. In: Accepted for the sixth international conference on advances in future internet"},{"key":"982_CR3","doi-asserted-by":"crossref","unstructured":"Pham A, Dacosta I, Endignoux G, Troncoso-Pastoriza JR, Huguenin K, Hubaux J (2017) Oride: A privacy-preserving yet accountable ride-hailing service. In: 26th USENIX Security Symposium. USENIX Security 2017, Vancouver, pp 1235\u20131252","DOI":"10.1515\/popets-2017-0015"},{"key":"982_CR4","doi-asserted-by":"crossref","unstructured":"Beresford AR, Stajano F (2003) Location privacy in pervasive computing. In: IEEE Pervasive Computing, vol 2, pp 46\u201355","DOI":"10.1109\/MPRV.2003.1186725"},{"key":"982_CR5","doi-asserted-by":"crossref","unstructured":"Raya M, Hubaux J (2005) The security of vehicular ad hoc networks. In: Proceedings of the 3rd ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2005. ACM, Alexandria, pp 11\u201321","DOI":"10.1145\/1102219.1102223"},{"key":"982_CR6","unstructured":"Freudiger J, Raya M, F\u00e9legyh\u00e1zi M, Papadimitratos P, Hubaux J-P (2007) Mix-zones for location privacy in vehicular networks. In: Win-ITS 07"},{"key":"982_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TMC.2014.2321747","volume":"14","author":"B Palanisamy","year":"2015","unstructured":"Palanisamy B, Liu L (2015) Attack-resilient mix-zones over road networks: Architecture and algorithms. IEEE Trans Mob Comput 14:495\u2013508","journal-title":"IEEE Trans Mob Comput"},{"key":"982_CR8","doi-asserted-by":"crossref","unstructured":"Ying B, Makrakis D (2015) Pseudonym changes scheme based on candidate-location-list in vehicular networks. In: 2015 IEEE International Conference on Communications. ICC 2015, London, pp 7292\u20137297","DOI":"10.1109\/ICC.2015.7249491"},{"key":"982_CR9","doi-asserted-by":"crossref","unstructured":"Samarati P, Sweeney L (1998) Generalizing data to provide anonymity when disclosing information (abstract). In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, Washington, pp 188","DOI":"10.1145\/275487.275508"},{"key":"982_CR10","doi-asserted-by":"crossref","unstructured":"Gruteser M, Grunwald D (2003) Anonymous usage of location-based services through spatial and temporal cloaking. In: Proceedings of the First International Conference on Mobile Systems, Applications, and Services, MobiSys 2003. USENIX, San Francisco","DOI":"10.1145\/1066116.1189037"},{"key":"982_CR11","doi-asserted-by":"crossref","unstructured":"Yang D, Fang X, Xue G (2013) Truthful incentive mechanisms for k-anonymity location privacy. In: Proceedings of the IEEE INFOCOM, Turin, pp 2994\u20133002","DOI":"10.1109\/INFCOM.2013.6567111"},{"key":"982_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10707-009-0099-y","volume":"15","author":"C Chow","year":"2011","unstructured":"Chow C, Mokbel MF, Liu X (2011) Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments. GeoInformatica 15:351\u2013380","journal-title":"GeoInformatica"},{"key":"982_CR13","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1109\/JIOT.2018.2797206","volume":"5","author":"J Cui","year":"2018","unstructured":"Cui J, Wen J, Han S, Zhong H (2018) Efficient privacy-preserving scheme for real-time location data in vehicular ad-hoc network. IEEE Internet Things J 5:3491\u20133498","journal-title":"IEEE Internet Things J"},{"key":"982_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.pmcj.2013.06.002","volume":"13","author":"Y Xi","year":"2014","unstructured":"Xi Y, Schwiebert L, Shi W (2014) Privacy preserving shortest path routing with an application to navigation. Perv Mob Comput 13:142\u2013149","journal-title":"Perv Mob Comput"},{"key":"982_CR15","doi-asserted-by":"crossref","unstructured":"Dwork C (2008) Differential privacy: A survey of results. In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi\u2019an, China, April 25-29, 2008. Proceedings, vol. 4978 of Lecture Notes in Computer Science. Springer pp 1\u201319","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"982_CR16","doi-asserted-by":"crossref","unstructured":"Andr\u00e9s ME, Bordenabe NE, Chatzikokolakis K, Palamidessi C (2013) Geo-indistinguishability: differential privacy for location-based systems. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS\u201913, Berlin, pp 901\u2013914","DOI":"10.1145\/2508859.2516735"},{"key":"982_CR17","doi-asserted-by":"crossref","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (1998) Min-wise independent permutations (extended abstract). In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, pp 327\u2013336","DOI":"10.1145\/276698.276781"},{"key":"982_CR18","unstructured":"Ertl O Superminhash-A new minwise hashing algorithm for jaccard similarity estimation, CoRR arXiv:1706.05698"},{"key":"982_CR19","first-page":"26","volume":"45","author":"R Sakai","year":"2000","unstructured":"Sakai R, Ohgishi K, Kasahara M (2000) Cryptosystems based on pairing. Symp Cryptogr Inf Secur Jpn 45:26\u201328","journal-title":"Symp Cryptogr Inf Secur Jpn"},{"key":"982_CR20","doi-asserted-by":"crossref","unstructured":"Pham A, Dacosta I, Jacot-guillarmod B, Huguenin K, Hajar T, Tram\u00e8r F, Gligor VD, Hubaux J (2017) Privateride: A privacy-enhanced ride-hailing service, PoPETs, 2, 38\u201356","DOI":"10.1515\/popets-2017-0015"},{"key":"982_CR21","unstructured":"(cryptography) K (2007) key derivation function, pp 273"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-020-00982-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-020-00982-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-020-00982-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T00:08:08Z","timestamp":1629850088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-020-00982-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,25]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["982"],"URL":"https:\/\/doi.org\/10.1007\/s12083-020-00982-7","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,25]]},"assertion":[{"value":"4 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}