网约车服务的位置隐私保护、可验证和抗合谋乘车匹配

IF 4.8 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Hui Huang , Rui Zhang , Chenhuang Wu , Shihui Lin
{"title":"网约车服务的位置隐私保护、可验证和抗合谋乘车匹配","authors":"Hui Huang ,&nbsp;Rui Zhang ,&nbsp;Chenhuang Wu ,&nbsp;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 ,&nbsp;Rui Zhang ,&nbsp;Chenhuang Wu ,&nbsp;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}
引用次数: 0

摘要

网约车服务(RHS)为乘客提供便捷的出行服务,并为司机提供经济激励。然而,在向网约车服务提供商(RHSP)请求乘车匹配的过程中,乘客和司机之间的数据传输和查询处理可能会暴露敏感的用户信息,例如上下车位置和运动轨迹。此外,RHSP可能与司机串通操纵乘车匹配结果的准确性和完整性。在本文中,我们提出了一种新的隐私保护和抗合谋驱动验证方案(PPCRV),该方案支持隐私保护、抗合谋、可验证性和问责性。我们的方法允许个性化设置,使乘客和司机都能在预定义的隐蔽区域内保护他们的位置隐私。此外,我们使用前缀编码将身份与位置前缀联系起来,生成不可预测的运动轨迹。我们还利用不可区分布隆过滤器(IBF)进行高效查询。通过IBF树和证明信息,我们确保可验证的匹配结果,允许车手独立复制匹配过程。同时,我们应用可追踪签名技术来保持用户匿名性,同时实现有效的身份验证和可追溯性,确保恶意用户在需要时可以被追究责任。最后,我们进行理论分析和实验,从计算成本和通信开销两方面评估该方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信