<i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route
Online ride-hailing (ORH) services allow people to enjoy on-demand transportation services through their mobile devices in a short responding time. Despite the great convenience, users need to submit their location information to the ORH service provider, which may incur unexpected privacy problems....
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-01-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/2/842 |
| _version_ | 1797496040885059584 |
|---|---|
| author | Junxin Huang Yuchuan Luo Ming Xu Bowen Hu Jian Long |
| author_facet | Junxin Huang Yuchuan Luo Ming Xu Bowen Hu Jian Long |
| author_sort | Junxin Huang |
| collection | DOAJ |
| description | Online ride-hailing (ORH) services allow people to enjoy on-demand transportation services through their mobile devices in a short responding time. Despite the great convenience, users need to submit their location information to the ORH service provider, which may incur unexpected privacy problems. In this paper, we mainly study the privacy and utility of the ride-sharing system, which enables multiple riders to share one driver. To solve the privacy problem and reduce the ride-sharing detouring waste, we propose a privacy-preserving ride-sharing system named <i>pShare</i>. To hide users’ precise locations from the service provider, we apply a zone-based travel time estimation approach to privately compute over sensitive data while cloaking each rider’s location in a zone area. To compute the matching results along with the least-detouring route, the service provider first computes the shortest path for each eligible rider combination, then compares the additional traveling time (ATT) of all combinations, and finally selects the combination with minimum ATT. We designed a secure comparing protocol by utilizing the garbled circuit, which enables the ORH server to execute the protocol with a crypto server without privacy leakage. Moreover, we apply the data packing technique, by which multiple data can be packed as one to reduce the communication and computation overhead. Through the theoretical analysis and evaluation results, we prove that <i>pShare</i> is a practical ride-sharing scheme that can find out the sharing riders with minimum ATT in acceptable accuracy while protecting users’ privacy. |
| first_indexed | 2024-03-10T01:58:03Z |
| format | Article |
| id | doaj.art-987022ae8d1b48508c53aea0971dae21 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T01:58:03Z |
| publishDate | 2022-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-987022ae8d1b48508c53aea0971dae212023-11-23T12:53:46ZengMDPI AGApplied Sciences2076-34172022-01-0112284210.3390/app12020842<i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring RouteJunxin Huang0Yuchuan Luo1Ming Xu2Bowen Hu3Jian Long4College of Computer Science, National University of Defense Technology, Changsha 410073, ChinaCollege of Computer Science, National University of Defense Technology, Changsha 410073, ChinaCollege of Computer Science, National University of Defense Technology, Changsha 410073, ChinaCollege of Computer Science, National University of Defense Technology, Changsha 410073, ChinaCollege of Computer Science, National University of Defense Technology, Changsha 410073, ChinaOnline ride-hailing (ORH) services allow people to enjoy on-demand transportation services through their mobile devices in a short responding time. Despite the great convenience, users need to submit their location information to the ORH service provider, which may incur unexpected privacy problems. In this paper, we mainly study the privacy and utility of the ride-sharing system, which enables multiple riders to share one driver. To solve the privacy problem and reduce the ride-sharing detouring waste, we propose a privacy-preserving ride-sharing system named <i>pShare</i>. To hide users’ precise locations from the service provider, we apply a zone-based travel time estimation approach to privately compute over sensitive data while cloaking each rider’s location in a zone area. To compute the matching results along with the least-detouring route, the service provider first computes the shortest path for each eligible rider combination, then compares the additional traveling time (ATT) of all combinations, and finally selects the combination with minimum ATT. We designed a secure comparing protocol by utilizing the garbled circuit, which enables the ORH server to execute the protocol with a crypto server without privacy leakage. Moreover, we apply the data packing technique, by which multiple data can be packed as one to reduce the communication and computation overhead. Through the theoretical analysis and evaluation results, we prove that <i>pShare</i> is a practical ride-sharing scheme that can find out the sharing riders with minimum ATT in acceptable accuracy while protecting users’ privacy.https://www.mdpi.com/2076-3417/12/2/842online ride-hailingride-sharing matchingprivacy-preservinglocation privacypath planning |
| spellingShingle | Junxin Huang Yuchuan Luo Ming Xu Bowen Hu Jian Long <i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route Applied Sciences online ride-hailing ride-sharing matching privacy-preserving location privacy path planning |
| title | <i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route |
| title_full | <i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route |
| title_fullStr | <i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route |
| title_full_unstemmed | <i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route |
| title_short | <i>pShare</i>: Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route |
| title_sort | i pshare i privacy preserving ride sharing system with minimum detouring route |
| topic | online ride-hailing ride-sharing matching privacy-preserving location privacy path planning |
| url | https://www.mdpi.com/2076-3417/12/2/842 |
| work_keys_str_mv | AT junxinhuang ipshareiprivacypreservingridesharingsystemwithminimumdetouringroute AT yuchuanluo ipshareiprivacypreservingridesharingsystemwithminimumdetouringroute AT mingxu ipshareiprivacypreservingridesharingsystemwithminimumdetouringroute AT bowenhu ipshareiprivacypreservingridesharingsystemwithminimumdetouringroute AT jianlong ipshareiprivacypreservingridesharingsystemwithminimumdetouringroute |