{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:05:54Z","timestamp":1775912754624,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,18]]},"DOI":"10.1145\/3212480.3212483","type":"proceedings-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T16:38:41Z","timestamp":1530203921000},"page":"40-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["SRide"],"prefix":"10.1145","author":[{"given":"Ulrich Matchi","family":"A\u00efvodji","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al (UQAM), Montr\u00e9al, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u00e9vin","family":"Huguenin","sequence":"additional","affiliation":[{"name":"UNIL-HEC Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Jos\u00e9","family":"Huguet","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, INSA, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc-Olivier","family":"Killijian","sequence":"additional","affiliation":[{"name":"CRM\/UDeM and LATECE\/UQAM, CNRS, Montr\u00e9al, Qu\u00e9bec, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.05.028"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_20"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2016.09.017"},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Privacy-Preserving Interdomain Routing at Internet Scale","volume":"3","author":"Asharov Gilad","year":"2017","unstructured":"Gilad Asharov , Daniel Demmler , Michael Schapira , Thomas Schneider , Gil Segev , Scott Shenker , and Michael Zohner . 2017 . Privacy-Preserving Interdomain Routing at Internet Scale . Proceedings on Privacy Enhancing Technologies 3 (2017), 1 -- 21 . Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, and Michael Zohner. 2017. Privacy-Preserving Interdomain Routing at Internet Scale. Proceedings on Privacy Enhancing Technologies 3 (2017), 1--21.","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbusres.2013.10.001"},{"key":"e_1_3_2_1_6_1","volume-title":"13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). 12-p.","author":"Bit-Monnot Arthur","year":"2013","unstructured":"Arthur Bit-Monnot , Christian Artigues , Marie-Jos\u00e9 Huguet , and Marc-Olivier Killijian . 2013 . Carpooling: the 2 synchronization points shortest paths problem . In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). 12-p. Arthur Bit-Monnot, Christian Artigues, Marie-Jos\u00e9 Huguet, and Marc-Olivier Killijian. 2013. Carpooling: the 2 synchronization points shortest paths problem. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS). 12-p."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the national computer conference","volume":"48","author":"Robert George","unstructured":"George Robert Blakley et al. 1979. Safeguarding cryptographic keys . In Proceedings of the national computer conference , Vol. 48 . 313--317. George Robert Blakley et al. 1979. Safeguarding cryptographic keys. In Proceedings of the national computer conference, Vol. 48. 313--317."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2009.07.008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY-A Framework for Efficient Mixed-Protocol Secure Two-Party Computation.. In NDSS.  Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY-A Framework for Efficient Mixed-Protocol Secure Two-Party Computation.. In NDSS.","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/857076.857078"},{"key":"e_1_3_2_1_12_1","first-page":"144","article-title":"Somewhat Practical Fully Homomorphic Encryption","volume":"2012","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren . 2012 . Somewhat Practical Fully Homomorphic Encryption . IACR Cryptology ePrint Archive 2012 (2012), 144 . Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2012 (2012), 144.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_13_1","volume-title":"Advances in Cryptology-EUROCRYPT","author":"Freedman Michael J","year":"2004","unstructured":"Michael J Freedman , Kobbi Nissim , and Benny Pinkas . 2004. Efficient private matching and set intersection . In Advances in Cryptology-EUROCRYPT 2004 . Springer , 1--19. Michael J Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient private matching and set intersection. In Advances in Cryptology-EUROCRYPT 2004. Springer, 1--19."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2013.08.012"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.04.024"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2013.12.003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of the 26th USENIX Security Symposium. 1235--1252","author":"Pham Anh","year":"2017","unstructured":"Anh Pham , Italo Dacosta , Guillaume Endignoux , Juan Ram\u00f3n Troncoso-Pastoriza , K\u00e9vin Huguenin , and Jean-Pierre Hubaux . 2017 . ORide: A Privacy-Preserving yet Accountable Ride-Hailing Service . In Proc. of the 26th USENIX Security Symposium. 1235--1252 . Anh Pham, Italo Dacosta, Guillaume Endignoux, Juan Ram\u00f3n Troncoso-Pastoriza, K\u00e9vin Huguenin, and Jean-Pierre Hubaux. 2017. ORide: A Privacy-Preserving yet Accountable Ride-Hailing Service. In Proc. of the 26th USENIX Security Symposium. 1235--1252."},{"key":"e_1_3_2_1_20_1","volume-title":"PrivateRide: A Privacy-Preserving and Secure Ride-Hailing Service. PoPETs","author":"Pham Anh","year":"2017","unstructured":"Anh Pham , Italo Dacosta , Bastien Jacot-Guillarmod , K\u00e9vin Huguenin , and Jean-Pierre Hubaux . 2017. PrivateRide: A Privacy-Preserving and Secure Ride-Hailing Service. PoPETs ( 2017 ). To appear. Anh Pham, Italo Dacosta, Bastien Jacot-Guillarmod, K\u00e9vin Huguenin, and Jean-Pierre Hubaux. 2017. PrivateRide: A Privacy-Preserving and Secure Ride-Hailing Service. PoPETs (2017). To appear."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2016.10.017"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.07.025"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2016.04.010"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2013.07.010"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_28_1","volume-title":"Mitchell","author":"Wu David J.","year":"2016","unstructured":"David J. Wu , Joe Zimmerman , J\u00e9r\u00e9my Planul , and John C . Mitchell . 2016 . Privacy-Preserving Shortest Path Computation . arXiv preprint arXiv:1601.02281 (2016). David J. Wu, Joe Zimmerman, J\u00e9r\u00e9my Planul, and John C. Mitchell. 2016. Privacy-Preserving Shortest Path Computation. arXiv preprint arXiv:1601.02281 (2016)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2013.06.002"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-8564(98)00035-4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"WiSec '18: 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks","location":"Stockholm Sweden","acronym":"WiSec '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212480.3212483","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212480.3212483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:15Z","timestamp":1750287255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212480.3212483"}},"subtitle":["A Privacy-Preserving Ridesharing System"],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":31,"alternative-id":["10.1145\/3212480.3212483","10.1145\/3212480"],"URL":"https:\/\/doi.org\/10.1145\/3212480.3212483","relation":{},"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"2018-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}