{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T23:49:03Z","timestamp":1773013743992,"version":"3.50.1"},"reference-count":31,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T00:00:00Z","timestamp":1755302400000},"content-version":"vor","delay-in-days":227,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["5244100178"],"award-info":[{"award-number":["5244100178"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["2024GX-YBXM-001"],"award-info":[{"award-number":["2024GX-YBXM-001"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>There are user privacy risks in cloud\u2010based vehicle dispatch platforms due to the unauthorized collection, use, and dissemination of data. However, existing data protection methods cannot balance privacy, usability, and efficiency well. To address this, we propose a local privacy\u2010preserving vehicle assignment strategy via spatial\u2013temporal fusion (STF\u2010LPPVA). Specifically, the strategy allows the cloud platform to train and distribute a spatial\u2013temporal representation model to the user side. Encoded by this model, drivers and passengers can privately fuze the spatial\u2013temporal information of their trips and then transmit these fuzed vectors to the cloud platform. Based on the similarity of the vectors, the cloud platform can allocate vehicles using the Kuhn\u2013Monkreth (KM) algorithm. In addition, we analyze the theoretical feasibility of the STF\u2010LPPVA strategy using entropy change and get good performance with a dataset from DiDi in Chengdu, China. The results show that the successful matching rate of the STF\u2010LPPVA strategy is very close to the original data matching with lower time overhead. Our approach can reduce the traveling distance by 66.5% and improve the matching success rate by 36.2% on average.<\/jats:p>","DOI":"10.1049\/ise2\/1915019","type":"journal-article","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T07:03:56Z","timestamp":1755327836000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["STF\u2010LPPVA: Local Privacy\u2010Preserving Method for Vehicle Assignment Based on Spatial\u2013Temporal Fusion"],"prefix":"10.1049","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5465-610X","authenticated-orcid":false,"given":"Lei","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0142-4469","authenticated-orcid":false,"given":"Zhengxin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1496-405X","authenticated-orcid":false,"given":"Xin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6543-6073","authenticated-orcid":false,"given":"Junzhe","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6944-7511","authenticated-orcid":false,"given":"Junchi","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2025,8,16]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/3375752"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.16383\/j.aas.2015.c140139"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3429256"},{"key":"e_1_2_11_4_2","first-page":"125","article-title":"l-Diversity Algorithm for Privacy Preserving Trajectory Data Publishing","volume":"51","author":"Guo X.","year":"2015","journal-title":"Computer Engineering and Applications"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3611307"},{"key":"e_1_2_11_6_2","doi-asserted-by":"crossref","unstructured":"YaoL. WangX. WangX. HuH. andWuG. Publishing Sensitive Trajectory Data Under Enhanced l-Diversity Model 20th IEEE International Conference on Mobile Data Management (MDM) 2019 IEEE 160\u2013169 https:\/\/doi.org\/10.1109\/MDM.2019.00-61 2-s2.0-85071015078.","DOI":"10.1109\/MDM.2019.00-61"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.3969\/j.issn.1001-0505.2014.01.010"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.03.015"},{"key":"e_1_2_11_9_2","first-page":"400","article-title":"A Trajectory Data Publication Method under Differential Privacy","volume":"41","author":"Huo Z. H.","year":"2018","journal-title":"Chinese Journal of Computers"},{"key":"e_1_2_11_10_2","first-page":"54","article-title":"Trajectory Privacy Protection Scheme Based on Differential Privacy","volume":"42","author":"Chen S.","year":"2021","journal-title":"Journal on Communications"},{"key":"e_1_2_11_11_2","first-page":"1235","volume-title":"Proceedings of the 26th USENIX Security Symposium","author":"Pham A."},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2885282"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.3022875"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2931295"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2024.3403842"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"Andr\u00e9sM. BordenabeN. ChatzikokolakisK. andPalamidessiC. Geo-Indistinguishability: Differential Privacy for Location-Based Systems Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security 2013 ACM 901\u2013904.","DOI":"10.1145\/2508859.2516735"},{"key":"e_1_2_11_17_2","first-page":"138","article-title":"K-Anonymous Location Privacy Protection Scheme for the Mobile Terminal","volume":"48","author":"Song C. H.","year":"2021","journal-title":"Journal of Xidian University"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5574415"},{"key":"e_1_2_11_19_2","first-page":"147","article-title":"Localized Location Privacy Protection Method Using the Hilbert Encoding","volume":"50","author":"Yan Y.","year":"2023","journal-title":"Journal of Xidian University"},{"key":"e_1_2_11_20_2","first-page":"2469","article-title":"Location Privacy Protection Through Local Differential Privacy Under k-Anonymity","volume":"39","author":"Liu Z. H.","year":"2022","journal-title":"Application Research of Computers"},{"key":"e_1_2_11_21_2","first-page":"1981","article-title":"Survey on Local Differential Privacy","volume":"29","author":"Ye Q.","year":"2018","journal-title":"Journal of Software"},{"key":"e_1_2_11_22_2","unstructured":"MikolovT. ChenK. CorradoG. andDeanJ. Efficient Estimation of Word Representations in Vector Space International Conference on Learning Representations 2013 ACM."},{"key":"e_1_2_11_23_2","doi-asserted-by":"crossref","unstructured":"PerozziB. Al-RfouR. andSkienaS. Deepwalk: Online Learning of Social Representations Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2014 ACM 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_11_24_2","doi-asserted-by":"crossref","unstructured":"GroverA.andLeskovecJ. node2vec: Scalable Feature Learning for Networks Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2016 ACM 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_11_25_2","doi-asserted-by":"crossref","unstructured":"TangJ. QuM. WangM. ZhangM. YanJ. andMeiQ. Line: Large-Scale Information Network Embedding Proceedings of the 24th International Conference on World Wide Web 2015 ACM 1067\u20131077.","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3113661"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3111024"},{"key":"e_1_2_11_28_2","volume-title":"The Dynamic Hungarian Algorithm for the Assignment Problem With Changing Costs","author":"Mills-Tettey A.","year":"2007"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-88553-9"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2024.3395794"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3353302"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/ise2\/1915019","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/ise2\/1915019","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/ise2\/1915019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T22:34:07Z","timestamp":1773009247000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/ise2\/1915019"}},"subtitle":[],"editor":[{"family":"Deepali","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1049\/ise2\/1915019"],"URL":"https:\/\/doi.org\/10.1049\/ise2\/1915019","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-03-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1915019"}}