N. Agatz, A. L. Erera, W. P. Martin, X. Savelsbergh, and . Wang, Dynamic ridesharing: A simulation study in metro Atlanta, Procedia-Social and Behavioral Sciences, vol.17, p.28, 2011.

N. Agatz, A. Erera, M. Savelsbergh, and X. Wang, Optimization for dynamic ride-sharing: A review, European Journal of Operational Research, vol.223, pp.295-303, 2012.

C. Aguilar-melchor, J. Barrier, S. Guelton, A. Guinet, M. Killijian et al., NFLlib: NTT-based Fast Lattice Library, RSA Conference Cryptographers' Track, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01242273

K. Aissat and A. Oulamara, Dynamic ridesharing with intermediate locations, Computational Intelligence in Vehicles and Transportation Systems (CIVTS), p.27, 2014.

A. Ulrich-matchi, Privacy Enhancing Technologies for Ridesharing, Student Forum of the 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2016.

S. Ulrich-matchi-aïvodji, M. Gambs, M. Huguet, and . Killijian, Meeting points in ridesharing: A privacy-preserving approach, Transportation Research Part C: Emerging Technologies, vol.72, pp.239-253, 2016.

S. Ulrich-matchi-aïvodji, M. Gambs, M. Huguet, and . Killijian, Privacy-preserving carpooling, Odysseus 2015-6th International Workshop on Freight Transportation and Logistics (Odysseus), 2015.

K. Ulrich-matchi-aïvodji, M. Huguenin, M. Huguet, and . Killijian, SRide: A Privacy-Preserving Ridesharing System, Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies (IMWUT)

C. Artigues, Y. Deswarte, J. Guiochet, M. Huguet, M. Killijian et al., AMORES: An Architecture for Mobiquitous Resilient Systems, Proceedings of the 1st European Workshop on AppRoaches to MObiquiTous Resilience. ARMOR '12, vol.7, p.37, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00736020

G. Asharov, D. Demmler, M. Schapira, T. Schneider, G. Segev et al., Privacy-Preserving Interdomain Routing at Internet Scale, Proceedings on Privacy Enhancing Technologies, vol.3, p.80, 2017.

K. Axel, Location-based services: fundamentals and operation, 2005.

L. Backstrom, C. Dwork, and J. Kleinberg, Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography, Proceedings of the 16th international conference on World Wide Web, p.11, 2007.

R. Baldacci, V. Maniezzo, and A. Mingozzi, An exact method for the car pooling problem based on lagrangean column generation, Operations Research, vol.52, issue.3, p.28, 2004.

M. Barbaro, T. Zeller, and S. Hansell, A face is exposed for AOL searcher no. 4417749, New York Times, vol.9, p.11, 2006.

C. Barrett, R. Jacob, and M. Marathe, Formal-language-constrained path problems, SIAM Journal on Computing, vol.30, pp.809-837, 2000.

R. Belk, You are what you can access: Sharing and collaborative consumption online, Journal of Business Research, vol.67, p.1, 2014.

R. Bellman, On a routing problem, Quarterly of applied mathematics, vol.16, p.23, 1958.

A. R. Beresford and F. Stajano, Location privacy in pervasive computing, Pervasive Computing, vol.2, p.17, 2003.

R. Alastair, F. Beresford, and . Stajano, Location privacy in pervasive computing, IEEE Pervasive computing, vol.2, issue.1, pp.46-55, 2003.

I. Bilogrevic, M. Jadliwala, V. Joneja, K. Kalkan, J. Hubaux et al., Privacy-preserving optimal meeting location determination on mobile devices, Information Forensics and Security, IEEE Transactions on 9, vol.7, pp.1141-1156, 2014.

A. Bit-monnot, C. Artigues, M. Huguet, and M. Killijian, Carpooling: the 2 synchronization points shortest paths problem, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), p.12, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00843628

G. Robert-blakley, Safeguarding cryptographic keys, Proceedings of the national computer conference, vol.48, p.17, 1979.

D. Vincent, J. Blondel, R. Guillaume, E. Lambiotte, and . Lefebvre, Fast unfolding of communities in large networks, Journal of statistical mechanics: theory and experiment, vol.10, p.96, 2008.

K. Bonawitz, V. Ivanov, B. Kreuter, A. Marcedone, S. H-brendan-mcmahan et al., Practical Secure Aggregation for Privacy Preserving Machine Learning, IACR Cryptology ePrint Archive 2017, p.114, 2017.

L. Burnett, A. L. Barlow-stewart, H. Proos, and . Aizenberg, The" GeneTrustee": a universal identification system that ensures privacy and confidentiality for human genetic databases, In: Journal of Law and Medicine, vol.10, issue.7, pp.506-513, 2003.

R. Wolfler-calvo, F. De-luigi, P. Haastrup, and V. Maniezzo, A distributed geographic information system for the daily car pooling problem, Computers & Operations Research, vol.31, p.29, 2004.

B. Caulfield, Estimating the environmental benefits of ride-sharing: A case study of Dublin, Transportation Research Part D: Transport and Environment, vol.14, p.1, 2009.

A. Cavoukian, Privacy by design, IEEE Technology and Society Magazine, vol.31, p.13, 2012.

A. Cavoukian, Privacy by design... take the challenge. Information and Privacy Commissioner of Ontario (Canada), vol.45, p.13, 2009.

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, Private information retrieval, Journal of the ACM (JACM), vol.45, pp.965-981, 1998.

, Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2016.

C. D. Cottrill, Approaches to privacy preservation in intelligent transportation systems and vehicle-infrastructure integration initiative, Transportation Research Record, vol.2129, p.14, 2009.

J. Covert, Uber says it got hacked over nine months ago, p.1

, Data usage statistics, p.62

G. Emiliano-de-cristofaro and . Tsudik, Practical private set intersection protocols with linear complexity, Financial Cryptography and Data Security, pp.143-159, 2010.

Y. Montjoye, L. Radaelli, and V. K. Singh, Unique in the shopping mall: On the reidentifiability of credit card metadata, Science, vol.347, p.11, 2015.

Y. Montjoye, A. César, M. Hidalgo, V. Verleysen, and . Blondel, Unique in the crowd: The privacy bounds of human mobility, Scientific reports, vol.3, p.11, 2013.

D. Demmler, T. Schneider, and M. Zohner, ABY-A Framework for Efficient Mixed-Protocol Secure Two-Party Computation, NDSS. 2015 (cit. on pp. 59, vol.80

M. Deng, K. Wuyts, R. Scandariato, B. Preneel, and W. Joosen, A privacy threat analysis framework: supporting the elicitation and fulfillment of privacy requirements, Requirements Engineering, vol.16, pp.3-32, 2011.

W. Edsger and . Dijkstra, A note on two problems in connexion with graphs, Numerische mathematik 1.1 (1959), p.23

R. Dingledine, N. Mathewson, and P. Syverson, Tor: The second-generation onion router, Naval Research Lab Washington DC, p.67, 2004.

C. Dong, L. Chen, and Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, pp.789-800, 2013.

F. Drews and D. Luxen, Multi-hop ride sharing, Sixth annual symposium on combinatorial search, p.28, 2013.

C. Dwork, Differential Privacy, Automata, Languages and Programming: 33rd International Colloquium, ICALP, pp.1-12, 2006.

C. Dwork, F. Mcsherry, K. Nissim, and A. Smith, Calibrating noise to sensitivity in private data analysis, TCC, vol.3876, pp.265-284, 2006.

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE transactions on information theory, vol.31, p.17, 1985.

P. Eugster, P. A. Felber, R. Guerraoui, and A. Kermarrec, The many faces of publish/subscribe, ACM Computing Surveys (CSUR), vol.35, p.85, 2003.

J. Fan and F. Vercauteren, Somewhat Practical Fully Homomorphic Encryption, In: IACR Cryptology ePrint Archive, vol.2012, p.77, 2012.

R. W. Floyd, Algorithm 97: shortest path, Communications of the ACM, vol.5, p.24, 1962.

K. Michael-j-freedman, B. Nissim, and . Pinkas, Efficient private matching and set intersection, Advances in Cryptology-EUROCRYPT, pp.1-19, 2004.

B. Fung, K. Wang, R. Chen, and P. Yu, Privacy-preserving data publishing: A survey of recent developments, ACM Computing Surveys (CSUR), vol.42, p.10, 2010.

M. Furuhata, M. Dessouky, F. Ordóñez, M. Brunet, X. Wang et al., Ridesharing: The state-of-the-art and future directions, Transportation Research Part B: Methodological, vol.57, pp.28-46, 2013.

S. Gambs, M. Killijian, and M. Cortez, Show Me How You Move and I Will Tell You Who You Are, Transactions on Data Privacy, vol.4, p.1, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00556833

S. Gambs, M. Killijian, and M. Cortez, Show Me How You Move and I Will Tell You Who You Are, Transactions on Data Privacy, vol.4, p.115, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00556833

R. Geisberger, P. Sanders, D. Schultes, and C. Vetter, Exact routing in large road networks using contraction hierarchies, Transportation Science, vol.46, issue.3, p.24, 2012.

R. Geisberger, D. Luxen, S. Neubauer, P. Sanders, and L. Volker, Fast detour computation for ride sharing, p.28, 2009.

C. Gentry, Fully homomorphic encryption using ideal lattices, In: STOC, vol.9, p.17, 2009.

M. Ghasemzadeh, C. M. Benjamin, R. Fung, A. Chen, and . Awasthi, Anonymizing trajectory data for passenger flow analysis, Transportation Research Part C: Emerging Technologies, vol.39, p.84, 2014.

, Uber Allegedly Stalked Users For Party-Goers Viewing Pleasure, pp.2016-2027

B. Goethals, S. Laur, H. Lipmaa, and T. Mielikäinen, On private scalar product computation for privacy-preserving data mining, In: ICISC, vol.3506, p.17, 2004.

V. Andrew, C. Goldberg, and . Harrelson, Computing the shortest path: A search meets graph theory, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, p.24, 2005.

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp.218-229, 1987.

P. Gruebele, Interactive system for real time dynamic multi-hop carpooling, Global Transport Knowledge Partnership, p.28, 2008.

M. Gruteser and D. Grunwald, Anonymous usage of location-based services through spatial and temporal cloaking, Proceedings of the 1st international conference on Mobile systems, applications and services, p.16, 2003.

P. Hallgren, C. Orlandi, and A. Sabelfeld, PrivatePool: Privacy-Preserving Ridesharing, Computer Security Foundations Symposium (CSF, p.85, 2017.

N. J. Peter-e-hart, B. Nilsson, and . Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE transactions on Systems Science and Cybernetics, vol.4, p.24, 1968.

C. Hazay and Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, Theory of Cryptography, pp.155-175, 2008.

C. Hazay and Y. Lindell, Efficient secure two-party protocols: Techniques and constructions, p.11, 2010.

W. Herbawi and M. Weber, Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing, In: EvoCOP, vol.11, p.28, 2011.

W. Herbawi and M. Weber, The ridematching problem with time windows in dynamic ridesharing: A model and a genetic algorithm, Evolutionary Computation (CEC), p.29, 2012.

M. Herrmann, A. Rial, C. Diaz, and B. Preneel, Practical privacypreserving location-sharing based services with aggregate statistics, Proceedings of the 2014 ACM conference on Security and privacy in wireless & mobile networks, p.39, 2014.

G. Hinterwälder, T. Christian, F. Zenger, A. Baldimtsi, C. Lysyanskaya et al., Efficient e-cash in practice: NFC-based payments for public transportation systems, International Symposium on Privacy Enhancing Technologies Symposium, p.84, 2013.

B. Hoh, M. Gruteser, H. Xiong, and A. Alrabady, Enhancing security and privacy in traffic-monitoring systems, IEEE Pervasive Computing, vol.5, issue.4, p.12, 2006.

S. Jarecki and X. Liu, Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection, Theory of Cryptography, pp.577-594, 2009.

H. Kido, Y. Yanagisawa, and T. Satoh, Protection of location privacy using dummies for location-based services, Data Engineering Workshops, 2005. 21st International Conference on. IEEE. 2005, p.15

L. Kissner and D. Song, Privacy-preserving set operations, Advances in Cryptology-CRYPTO 2005, pp.241-257, 2005.

N. Li, T. Li, and S. Venkatasubramanian, t-closeness: Privacy beyond k-anonymity and l-diversity, IEEE 23rd International Conference on, p.15, 2007.

V. Lyubashevsky, C. Peikert, and O. Regev, On ideal lattices and learning with errors over rings, Annual International Conference on the Theory and Applications of Cryptographic Techniques, p.50, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00921792

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, l-diversity: Privacy beyond k-anonymity, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.1, p.15, 2007.

F. Mcsherry and K. Talwar, Mechanism design via differential privacy, Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium, pp.94-103, 2007.

Y. De-montjoye, A. César, M. Hidalgo, V. Verleysen, and . Blondel, Unique in the crowd: The privacy bounds of human mobility, In: Scientific reports, vol.3, p.115, 2013.

G. Nannicini, D. Delling, D. Schultes, and L. Liberti, Bidirectional A* search on time-dependent road networks, Networks 59, vol.2, p.26, 2012.

, Nantes, vol.80, p.58

M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation, Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp.245-254, 1999.

A. Narayanan and V. Shmatikov, How to break anonymity of the netflix prize dataset, p.11, 2006.

T. Jesper-buus-nielsen, R. Schneider, and . Trifiletti, Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO, In: IACR Cryptology ePrint Archive, vol.2016, p.63, 2016.

P. Jesper-buus-nielsen, C. Sebastian-nordholt, S. Orlandi, and . Burra, A New Approach to Practical Active-Secure Two-Party Computation, In: CRYPTO, vol.7417, p.63, 2012.

, NIST Special Publication 800-122: Personally Identifiable Information

M. Cortez, Inference attacks on geolocated data
URL : https://hal.archives-ouvertes.fr/tel-00926957

P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, Eurocrypt, vol.99, p.17, 1999.

A. Pham, I. Dacosta, G. Endignoux, J. R. Troncoso-pastoriza, K. Huguenin et al., ORide: A Privacy-Preserving yet Accountable Ride-Hailing Service, Proc. of the 26th USENIX Security Symposium, p.86, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01521550

A. Pham, I. Dacosta, B. Jacot-guillarmod, K. Huguenin, and J. Hubaux, PrivateRide: A Privacy-Preserving and Secure Ride-Hailing Service, vol.86, p.PoPETs, 2017.

I. Pohl, Bi-directional and heuristic search in path problems, p.24, 1969.

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Efficient models for timetable information in public transportation systems, Journal of Experimental Algorithmics (JEA), vol.12, p.26, 2008.

D. Quercia, N. Lathia, F. Calabrese, G. D. Lorenzo, and J. Crowcroft, Recommending social events from mobile phone location data, IEEE 10th International Conference on. IEEE. 2010, p.37, 2010.

. Michael-o-rabin, How To Exchange Secrets with Oblivious Transfer, In: IACR Cryptology ePrint Archive, p.18, 2005.

, Rennes, pp.2017-2025

A. Ronald-l-rivest, L. Shamir, and . Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, p.17, 1978.

R. Sakai and J. Furukawa, Identity-Based Broadcast Encryption, p.39, 2007.

D. Sánchez, S. Martínez, and J. Domingo-ferrer, Co-utile P2P ridesharing via decentralization and reputation management, Transportation Research Part C: Emerging Technologies, vol.73, pp.147-166, 2016.

P. Sanders and D. Schultes, Engineering highway hierarchies, In: ESA, vol.6, p.24, 2006.

P. Sanders and D. Schultes, Robust, Almost Constant Time Shortest-Path Queries in Road Networks, The Shortest Path Problem, p.25, 2006.

G. Scano, M. Huguet, and S. U. Ngueveu, Adaptations of k-shortest path algorithms for transportation networks, Industrial Engineering and Systems Management (IESM), 2015 International Conference on. IEEE. 2015, p.112
URL : https://hal.archives-ouvertes.fr/hal-01207475

T. Schneider and M. Zohner, GMW vs. Yao? Efficient secure two-party computation with low depth circuits, International Conference on Financial Cryptography and Data Security, vol.80, p.57, 2013.

A. Shamir, How to share a secret, Communications of the ACM, vol.22, p.17, 1979.

R. Shokri, Quantifying and protecting location privacy, In: it-Information Technology, vol.57, p.39, 2015.

R. Shokri, G. Theodorakopoulos, J. Boudec, and J. Hubaux, Quantifying location privacy, Security and privacy (sp), 2011 ieee symposium on, pp.247-262, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01266229

M. Stiglic, N. Agatz, M. Savelsbergh, and M. Gradisar, Making dynamic ride-sharing work: The impact of driver and rider flexibility, Transportation Research Part E: Logistics and Transportation Review, vol.91, p.1, 2016.

M. Stiglic, N. Agatz, M. Savelsbergh, and M. Gradisar, The benefits of meeting points in ride-sharing systems, Transportation Research Part B: Methodological, vol.82, pp.36-53, 2015.

A. Subramanya, A. Raj, J. A. Bilmes, and D. Fox, Recognizing activities and spatial context using wearable sensors, p.13, 2012.

J. Sun, R. Zhang, and Y. Zhang, Privacy-preserving spatiotemporal matching, INFOCOM, 2013 Proceedings IEEE, p.39, 2013.

Z. Sun, . Bin-zan, J. Xuegang, M. Ban, and . Gruteser, Privacy protection method for fine-grained urban traffic modeling using mobile sensors, Transportation Research Part B: Methodological, vol.56, p.84, 2013.

L. Sweeney, Achieving k-anonymity privacy protection using generalization and suppression, International Journal of Uncertainty, Fuzziness and KnowledgeBased Systems, vol.10, p.15, 2002.

L. Sweeney, k-anonymity: A model for protecting privacy, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.10, pp.557-570, 2002.

L. Sweeney, Simple demographics often identify people uniquely, vol.671, p.11, 2000.

W. Tong, J. Hua, and S. Zhong, A Jointly Differentially Private Scheduling Protocol for Ridesharing Services, IEEE Transactions on Information Forensics and Security, p.85, 2017.

. Gw-van-blarkom, J. Borking, and . Olk, Handbook of privacy and privacyenhancing technologies, Privacy Incorporated Software Agent (PISA) Consortium, The Hague, p.14, 2003.

S. Varone and K. Aissat, Routing with public transport and ride-sharing, Sixth International Workshop on Freight Transportation and Logistics (Odysseus). 2015 (cit. on pp, vol.37, p.27

E. Weise and J. Guynn, Uber tracking raises privacy concerns, p.1, 2014.

M. Wernke, P. Skvortsov, F. Dürr, and K. Rothermel, A classification of location privacy attacks and approaches, Personal and Ubiquitous Computing, vol.18, p.12, 2014.

. Alan-f-westin, Privacy and freedom, Washington and Lee Law Review, vol.25, issue.7, p.166, 1968.

D. J. Wu, J. Zimmerman, J. Planul, and J. C. Mitchell, Privacy-Preserving Shortest Path Computation, vol.114, p.85, 2016.

Y. Xi, L. Schwiebert, and W. Shi, Privacy preserving shortest path routing with an application to navigation, Pervasive and Mobile Computing, vol.13, pp.142-149, 2014.

H. Yang and H. Huang, Carpooling and congestion pricing in a multilane highway with high-occupancy-vehicle lanes, Transportation Research Part A: Policy and Practice, vol.33, p.1, 1999.

A. Yao, How to generate and exchange secrets, Foundations of Computer Science, pp.162-167, 1986.

Z. Zhu and G. Cao, Applaus: A privacy-preserving location proof updating system for location-based services, INFOCOM, 2011 Proceedings IEEE, p.63, 2011.