A Privacy-Preserving Ride Matching Scheme for Ride Sharing Services in a Hot Spot Area

被引:1
|
作者
Li, Qingyuan [1 ]
Wu, Hao [1 ,2 ]
Dong, Chen [1 ]
机构
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
[2] Beijing Jiaotong Univ, Frontiers Sci Ctr Smart High Speed Railway Syst, Beijing 100044, Peoples R China
基金
中国博士后科学基金; 北京市自然科学基金;
关键词
ride sharing services; privacy preserving; homomorphic encryption; road network; hot spot; ride matching;
D O I
10.3390/electronics12040915
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Ride sharing is a service that enables users to share trips with others, conserving energy, decreasing emissions and reducing traffic congestion. Selecting a suitable partner for a user based on the their trip data is essential for the service, but it also leads to privacy disclosure, e.g., the user's location and trajectory. Many privacy-preserving solutions for ride sharing services have been proposed, which are based on cryptographic technology and provide accurate matching services. However, these encryption-based algorithms are very complicated and difficult to calculate. In hot spots, such as stations, airports and sport gymnasiums, a large number of users may apply for a ride sharing service in short space of time, which will place huge pressure on the service provider. Using traditional matching methods increases the matching time and leads to a less favorable user experience. To solve these problems, we model them, aiming to maximize the vehicle's carrying capacity and propose a lightweight privacy-preserving ride matching scheme for selecting feasible partners during busy periods with a large number of requests. To achieve this, we make use of the homomorphic encryption technique to hide location data and design a scheme to calculate the distances between users in road networks securely and efficiently. We employ a road network embedding technique to calculate the distance between users. Moreover, we use travel time instead of space distance, which makes matching more accurate. Further, with the encrypted itineraries of users, the service provider selects potential ride share partners according to the feasibility of time schedules. We use ciphertext packing to reduce overhead, improving the efficiency of ride matching. Finally, we evaluate our scheme with simulation and demonstrate that our scheme achieves an efficient and accurate matching service. It only takes a few seconds to complete the matching, and the matching accuracy is higher than 85 percent in most cases.
引用
收藏
页数:17
相关论文
共 50 条
  • [21] pSafety: Privacy-Preserving Safety Monitoring in Online Ride Hailing Services
    Yu, Haining
    Zhang, Hongli
    Jia, Xiaohua
    Chen, Xiao
    Yu, Xiangzhan
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (01) : 209 - 224
  • [22] Mnemosyne: Privacy-Preserving Ride Matching With Collusion-Resistant Driver Exclusion
    Li, Meng
    Gao, Jianbo
    Zhang, Zijian
    Zhu, Liehuang
    Lal, Chhagan
    Conti, Mauro
    Alazab, Mamoun
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (04) : 5139 - 5151
  • [23] Privacy-Preserving Online Ride-Hailing Matching System with an Untrusted Server
    Xie, Hongcheng
    Chen, Zizhuo
    Guo, Yu
    Liu, Qin
    Jia, Xiaohua
    NETWORK AND SYSTEM SECURITY, NSS 2022, 2022, 13787 : 429 - 442
  • [24] BRIP: Towards a privacy-preserving, trustworthy, and transparent ride-sharing system with semantic matching powered by blockchain and IPFS
    Mahmoud, Nesma
    Abdelkader, Hatem
    Aly, Asmaa
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2024, 226
  • [25] pShare: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route
    Huang, Junxin
    Luo, Yuchuan
    Xu, Ming
    Hu, Bowen
    Long, Jian
    APPLIED SCIENCES-BASEL, 2022, 12 (02):
  • [26] An Efficient and Privacy-Preserving Route Matching Scheme for Carpooling Services
    Xu, Qi
    Zhu, Hui
    Zheng, Yandong
    Zhao, Jiaqi
    Lu, Rongxing
    Li, Hui
    IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (20) : 19890 - 19902
  • [27] Privacy-preserving Ride Clustering for Customized-bus Sharing: A Fog-assisted Approach
    He, Yuanyuan
    Ni, Jianbing
    Niu, Ben
    Li, Fenghua
    Shen, Xuemin
    2018 16TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT), 2018,
  • [28] Cryptanalysis of the Privacy-Preserving Ride-Hailing Service TRACE
    Kumaraswamy, Deepak
    Vivek, Srinivas
    PROGRESS IN CRYPTOLOGY, INDOCRYPT 2021, 2021, 13143 : 462 - 484
  • [29] Decentralized Privacy-Preserving Solution Through Blockchain Smart Contracts and Spatial Cloaking for Ride Sharing Application
    Fadhil, M.
    Sukarno, Parman
    Wardana, Aulia Arif
    INTELLIGENT COMPUTING, VOL 4, 2024, 2024, 1019 : 377 - 395
  • [30] Privacy-Preserving Data Sharing in Telehealth Services
    Computer Science Department, King Hussein School of Computing Sciences, Princess Sumaya University of Technology, Amman
    11941, Jordan
    不详
    CT
    06825, United States
    Appl. Sci., 2024, 23