Meeting points in ridesharing: A privacy-preserving approach

被引:68
作者
Aivodji, Ulrich Matchi [1 ]
Gambs, Sebastien [2 ]
Huguet, Marie-Jose [3 ]
Killijian, Marc-Olivier [1 ]
机构
[1] Univ Toulouse, CNRS, LAAS CNRS, Toulouse, France
[2] Univ Quebec, Montreal, PQ, Canada
[3] Univ Toulouse, CNRS, INSA, LAAS CNRS, Toulouse, France
关键词
Dynamic ridesharing; Privacy enhancing technologies; Multimodal shortest path; Secure multiparty computation; Private set intersection; LOCATION PRIVACY; TRAJECTORY DATA;
D O I
10.1016/j.trc.2016.09.017
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Nowadays, problems of congestion in urban areas due to the massive usage of cars, last-minute travel needs and progress in information and communication technologies have fostered the rise of new transportation modes such as ridesharing. In a ridesharing service, a car owner shares empty seats of his car with other travelers. Recent ridesharing approaches help to identify interesting meeting points to improve the efficiency of the ridesharing service (i.e., the best pick-up and drop-off points so that the travel cost is competitive for both driver and rider). In particular, ridesharing services, such as Blablacar or Carma, have become a good mobility alternative for users in their daily life. However, this success has come at the cost of user privacy. Indeed in current's ridesharing services, users are not in control of their own data and have to trust the ridesharing operators with the management of their data. In this paper, we aim at developing a privacy-preserving service to compute meeting points in ridesharing, such that each user remains in control of his location data. More precisely, we propose a decentralized architecture that provides strong security and privacy guarantees without sacrificing the usability of ridesharing services. In particular, our approach protects the privacy of location data of users. Following the privacy-by-design principle, we have integrated existing privacy enhancing technologies and multimodal shortest path algorithms to privately compute mutually interesting meeting points for both drivers and riders in ridesharing. In addition, we have built a prototype implementation of the proposed approach. The experiments, conducted on a real transportation network, have demonstrated that it is possible to reach a trade-off in which both the privacy and utility levels are satisfactory. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:239 / 253
页数:15
相关论文
共 50 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]  
Aguilar-Melchor Carlos, 2016, RSA C CRYPT TRACK
[3]  
Aissat K, 2014, 2014 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN VEHICLES AND TRANSPORTATION SYSTEMS (CIVTS), P36, DOI 10.1109/CIVTS.2014.7009475
[4]  
[Anonymous], J PRIVACY CONFIDENTI
[5]  
[Anonymous], 2012, P 2012 ACM C COMP CO, DOI DOI 10.1145/2382196.2382261
[6]  
Armstrong MP, 1999, STAT MED, V18, P497, DOI 10.1002/(SICI)1097-0258(19990315)18:5<497::AID-SIM45>3.3.CO
[7]  
2-R
[8]  
Artigues Christian, 2012, P 1 EUR WORKSH APPRO
[9]   Formal-language-constrained path problems [J].
Barrett, C ;
Jacob, R ;
Marathe, M .
SIAM JOURNAL ON COMPUTING, 2000, 30 (03) :809-837
[10]   Location privacy in pervasive computing [J].
Beresford, AR ;
Stajano, F .
IEEE PERVASIVE COMPUTING, 2003, 2 (01) :46-55