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 条
  • [1] P2 Ride: Practical and Privacy-Preserving Ride-Matching Scheme for Ridesharing
    Luo, Yuchuan
    Fu, Shaojing
    Jia, Xiaohua
    Xu, Ming
    Chen, Yingwen
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (03) : 3584 - 3593
  • [2] Hail the Closest Driver on Roads: Privacy-Preserving Ride Matching in Online Ride Hailing Services
    Yu, Haining
    Zhang, Hongli
    Yu, Xiangzhan
    SECURITY AND COMMUNICATION NETWORKS, 2020, 2020
  • [3] A Privacy-Preserving Order Dispatch Scheme for Ride-Hailing Services
    Duan, Yubin
    Gao, Guoju
    Xiao, Mingjun
    Wu, Jie
    2019 IEEE 16TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SMART SYSTEMS (MASS 2019), 2019, : 118 - 126
  • [4] Efficient and Privacy-Preserving Ride Matching Using Exact Road Distance in Online Ride Hailing Services
    Yu, Haining
    Jia, Xiaohua
    Zhang, Hongli
    Shu, Jiangang
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (04) : 1841 - 1854
  • [5] VOMA: A Privacy-Preserving Matching Mechanism Design for Community Ride-Sharing
    Gao, Jie
    Wong, Terrence
    Selim, Bassant
    Wang, Chun
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (12) : 23963 - 23975
  • [6] PSRide: Privacy-Preserving Shared Ride Matching for Online Ride Hailing Systems
    Yu, Haining
    Jia, Xiaohua
    Zhang, Hongli
    Yu, Xiangzhan
    Shu, Jiangang
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (03) : 1425 - 1440
  • [7] Privacy-Preserving Ride Sharing Scheme for Autonomous Vehicles in Big Data Era
    Sherif, Ahmed B. T.
    Rabieh, Khaled
    Mahmoud, Mohamed M. E. A.
    Liang, Xiaohui
    IEEE INTERNET OF THINGS JOURNAL, 2017, 4 (02): : 611 - 618
  • [8] Privacy-Preserving Ride Sharing Organization Scheme for Autonomous Vehicles in Large Cities
    Sherif, Ahmed
    Alsharif, Ahmad
    Moran, Jacob
    Mahmoud, Mohamed
    2017 IEEE 86TH VEHICULAR TECHNOLOGY CONFERENCE (VTC-FALL), 2017,
  • [9] pdRide: Privacy-Preserving Distributed Online Ride-Hailing Matching Scheme
    Wang, Qian
    Lai, Chengzhe
    Han, Gang
    Zheng, Dong
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (11) : 12491 - 12505
  • [10] PGRide: Privacy-Preserving Group Ridesharing Matching in Online Ride Hailing Services
    Yu, Haining
    Zhang, Hongli
    Yu, Xiangzhan
    Du, Xiaojiang
    Guizani, Mohsen
    IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (07) : 5722 - 5735