当前位置: X-MOL 学术IEEE Trans. Inform. Forensics Secur. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Privacy-Preserving Online Ride-Hailing System Without Involving a Third Trusted Server
IEEE Transactions on Information Forensics and Security ( IF 6.8 ) Pub Date : 2021-03-12 , DOI: 10.1109/tifs.2021.3065832
Hongcheng Xie , Yu Guo , Xiaohua Jia

The increasing popularity of Online Ride-hailing (ORH) services has greatly facilitated our daily travel. It enables a rider to easily request the nearest driver through mobile devices in a short time. However, existing ORH systems require the collection of users’ location information and thus raise critical privacy concerns. While several privacy-preserving solutions for ORH service have been proposed, most of existing schemes rely on an additional trusted party to compute the distance between a rider and a driver. Such a security assumption cannot fully address the privacy concerns for practical deployment. In this paper, we present a new ride-matching scheme for ORH systems, which allows privacy-preserving and effective distance calculation without involving a third-party server. Our proposed scheme enables ORH systems to securely compute the user distance while protecting the location privacy of both riders and drivers. Specifically, we resort to state-of-the-art distance calculation techniques based on Road Network Embedding (RNE), and show how to uniquely bridge cryptographic primitives like Property-preserving Hash (PPH) with RNE in depth to support privacy-preserving ride-matching services. Moreover, we also propose an optimized design to improve the matching efficiency. We formally analyze the security strengths and implement the system prototype. Evaluation results demonstrate that our design is secure and efficient for ORH systems.

中文翻译:

不涉及第三台受信任服务器的保护隐私的在线乘车导航系统

在线乘车(ORH)服务的日益普及极大地便利了我们的日常旅行。它使骑手能够在短时间内通过移动设备轻松请求最近的驾驶员。但是,现有的ORH系统需要收集用户的位置信息,因此引起了严重的隐私问题。尽管已经提出了几种用于ORH服务的隐私保护解决方案,但是大多数现有方案都依赖于额外的受信方来计算骑手与驾驶员之间的距离。这样的安全性假设不能完全解决实际部署中的隐私问题。在本文中,我们提出了一种用于ORH系统的新乘车匹配方案,该方案无需第三方服务器即可实现隐私保护和有效的距离计算。我们提出的方案使ORH系统能够安全地计算用户距离,同时保护骑手和驾驶员的位置隐私。具体来说,我们诉诸于基于道路网络嵌入(RNE)的最新距离计算技术,并展示了如何在深度上唯一地将诸如属性保留哈希(PPH)之类的加密原语与RNE进行深度桥接,以支持隐私保护游乐设施配套服务。此外,我们还提出了优化设计以提高匹配效率。我们正式分析安全优势并实施系统原型。评估结果表明,我们的设计对于ORH系统是安全且高效的。我们采用基于路网嵌入(RNE)的最新距离计算技术,并展示了如何在深度上唯一地将诸如属性保留哈希(PPH)之类的加密基元与RNE进行唯一桥接,以支持隐私保护的乘车匹配服务。此外,我们还提出了优化设计以提高匹配效率。我们正式分析安全优势并实施系统原型。评估结果表明,我们的设计对于ORH系统是安全且高效的。我们采用基于路网嵌入(RNE)的最新距离计算技术,并展示了如何在深度上唯一地将诸如属性保留哈希(PPH)之类的加密基元与RNE进行唯一桥接,以支持隐私保护的乘车匹配服务。此外,我们还提出了优化设计以提高匹配效率。我们正式分析安全优势并实施系统原型。评估结果表明,我们的设计对于ORH系统是安全且高效的。
更新日期:2021-05-11
down
wechat
bug