SRide: A Privacy-Preserving Ridesharing System
| Autor: | Kévin Huguenin, Marc-Olivier Killijian, Marie-José Huguet, Ulrich Aïvodji |
|---|---|
| Přispěvatelé: | Équipe Tolérance aux fautes et Sûreté de Fonctionnement informatique (LAAS-TSF), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Département d'informatique [Montréal], Université du Québec à Montréal = University of Québec in Montréal (UQAM), Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Faculté des Hautes Etudes Commerciales (HEC Lausanne) (HEC Lausanne), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Location data
Scheme (programming language) 050210 logistics & transportation 021110 strategic defence & security studies Matching (statistics) business.industry Computer science 05 social sciences 0211 other engineering and technologies 02 engineering and technology Service provider Privacy preserving Reduction (complexity) [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] User experience design 0502 economics and business business computer Protocol (object-oriented programming) Computer network computer.programming_language |
| Zdroj: | 11th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec) 11th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec), Jun 2018, Stockholm, Sweden. pp.40-50, ⟨10.1145/3212480.3212483⟩ Proceedings of the 11th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec), pp. 40-50 WISEC |
| Popis: | International audience; Ridesharing, in which drivers offer to share their rides, allows reduction of travel costs for both drivers and riders; such practice is increasingly popular. Modern ridesharing systems, enhanced with location-based features, have improved user experience by enabling drivers and riders to arrange a trip in near real time. However, the fine-grained nature of location data collected by the service providers and exchanged between users raises privacy issues that could disrupt the adoption of such systems. In this paper, we present SRide: a privacy-preserving protocol for ridesharing that addresses the matching problem for dynamic ridesharing systems. We design and implement a prototype of SRide that operates in four steps. First, it generalizes users spatiotemporal data of users. Next, it relies on a secure filtering protocol to compute feasible matches. Then, it uses an improved version of Priv-2SP-SPa privacy-preserving protocol to compute meeting points for ridesharing-to compute a ridesharing score for each feasible pair. Finally, it computes the optimal assignment of drivers and riders based on their ridesharing scores. We conduct an experimental trace-driven evaluation of the proposed scheme to demonstrate its practical feasibility. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|