{"title":"网约车服务的位置隐私保护、可验证和抗合谋乘车匹配","authors":"Hui Huang , Rui Zhang , Chenhuang Wu , Shihui Lin","doi":"10.1016/j.adhoc.2025.103910","DOIUrl":null,"url":null,"abstract":"<div><div>Ride-Hailing Services (RHS) provide riders with convenient travel services and offer drivers economic incentives. However, during the process of requesting ride-matching from the Ride-Hailing Service Provider (RHSP), the transmission of data and query processing between riders and drivers may potentially expose sensitive user information, such as boarding and alighting locations and movement trajectories. Moreover, the RHSP might collude with drivers to manipulate the accuracy and integrity of ride-matching results. In this paper, we propose a novel privacy-preserving and collusion-resistant driver verification scheme (PPCRV) that supports privacy protection, collusion resistance, verifiability, and accountability. Our approach allows for personalized settings, enabling both riders and drivers to protect their location privacy within predefined cloaked areas. Additionally, we employ prefix encoding to link identities with location prefixes, generating unpredictable movement trajectories. We also utilize Indistinguishable Bloom Filter (IBF) for efficient querying. By IBF trees and proof information, we ensure verifiable matching results, allowing riders to independently replicate the matching process. Simultaneously, we apply traceable signature technology to maintain user anonymity while enabling effective identity verification and traceability, ensuring that malicious users can be held accountable when required. Finally, we conduct theoretical analyses and experiments to evaluate the scheme’s performance in terms of computational cost and communication overhead.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"177 ","pages":"Article 103910"},"PeriodicalIF":4.8000,"publicationDate":"2025-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Location privacy-preserving ride matching with verifiable and collusion resistance for Ride-Hailing Services\",\"authors\":\"Hui Huang , Rui Zhang , Chenhuang Wu , Shihui Lin\",\"doi\":\"10.1016/j.adhoc.2025.103910\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Ride-Hailing Services (RHS) provide riders with convenient travel services and offer drivers economic incentives. However, during the process of requesting ride-matching from the Ride-Hailing Service Provider (RHSP), the transmission of data and query processing between riders and drivers may potentially expose sensitive user information, such as boarding and alighting locations and movement trajectories. Moreover, the RHSP might collude with drivers to manipulate the accuracy and integrity of ride-matching results. In this paper, we propose a novel privacy-preserving and collusion-resistant driver verification scheme (PPCRV) that supports privacy protection, collusion resistance, verifiability, and accountability. Our approach allows for personalized settings, enabling both riders and drivers to protect their location privacy within predefined cloaked areas. Additionally, we employ prefix encoding to link identities with location prefixes, generating unpredictable movement trajectories. We also utilize Indistinguishable Bloom Filter (IBF) for efficient querying. By IBF trees and proof information, we ensure verifiable matching results, allowing riders to independently replicate the matching process. Simultaneously, we apply traceable signature technology to maintain user anonymity while enabling effective identity verification and traceability, ensuring that malicious users can be held accountable when required. Finally, we conduct theoretical analyses and experiments to evaluate the scheme’s performance in terms of computational cost and communication overhead.</div></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":\"177 \",\"pages\":\"Article 103910\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870525001581\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870525001581","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Location privacy-preserving ride matching with verifiable and collusion resistance for Ride-Hailing Services
Ride-Hailing Services (RHS) provide riders with convenient travel services and offer drivers economic incentives. However, during the process of requesting ride-matching from the Ride-Hailing Service Provider (RHSP), the transmission of data and query processing between riders and drivers may potentially expose sensitive user information, such as boarding and alighting locations and movement trajectories. Moreover, the RHSP might collude with drivers to manipulate the accuracy and integrity of ride-matching results. In this paper, we propose a novel privacy-preserving and collusion-resistant driver verification scheme (PPCRV) that supports privacy protection, collusion resistance, verifiability, and accountability. Our approach allows for personalized settings, enabling both riders and drivers to protect their location privacy within predefined cloaked areas. Additionally, we employ prefix encoding to link identities with location prefixes, generating unpredictable movement trajectories. We also utilize Indistinguishable Bloom Filter (IBF) for efficient querying. By IBF trees and proof information, we ensure verifiable matching results, allowing riders to independently replicate the matching process. Simultaneously, we apply traceable signature technology to maintain user anonymity while enabling effective identity verification and traceability, ensuring that malicious users can be held accountable when required. Finally, we conduct theoretical analyses and experiments to evaluate the scheme’s performance in terms of computational cost and communication overhead.
期刊介绍:
The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to:
Mobile and Wireless Ad Hoc Networks
Sensor Networks
Wireless Local and Personal Area Networks
Home Networks
Ad Hoc Networks of Autonomous Intelligent Systems
Novel Architectures for Ad Hoc and Sensor Networks
Self-organizing Network Architectures and Protocols
Transport Layer Protocols
Routing protocols (unicast, multicast, geocast, etc.)
Media Access Control Techniques
Error Control Schemes
Power-Aware, Low-Power and Energy-Efficient Designs
Synchronization and Scheduling Issues
Mobility Management
Mobility-Tolerant Communication Protocols
Location Tracking and Location-based Services
Resource and Information Management
Security and Fault-Tolerance Issues
Hardware and Software Platforms, Systems, and Testbeds
Experimental and Prototype Results
Quality-of-Service Issues
Cross-Layer Interactions
Scalability Issues
Performance Analysis and Simulation of Protocols.