{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:12:33Z","timestamp":1763748753098,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031209734"},{"type":"electronic","value":"9783031209741"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20974-1_8","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T08:06:38Z","timestamp":1668067598000},"page":"167-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Passive Triangulation Attack on\u00a0ORide"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0222-322X","authenticated-orcid":false,"given":"Shyam","family":"Murthy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8426-0859","authenticated-orcid":false,"given":"Srinivas","family":"Vivek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02187904","volume":"3","author":"BS Baker","year":"1988","unstructured":"Baker, B.S., Grosse, E., Rafferty, C.S.: Nonobtuse triangulation of polygons. Discrete Comput. Geom. 3(2), 147\u2013168 (1988). https:\/\/doi.org\/10.1007\/BF02187904","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s00454-008-9087-5","volume":"41","author":"M Bucher-Karlsson","year":"2008","unstructured":"Bucher-Karlsson, M.: On minimal triangulations of products of convex polygons. Discrete Comput. Geom. 41(2), 328\u2013347 (2008). https:\/\/doi.org\/10.1007\/s00454-008-9087-5","journal-title":"Discrete Comput. Geom."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part I. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"8_CR4","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012). http:\/\/eprint.iacr.org\/2012\/144"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Hartley, R.I., Sturm, P.: Triangulation. Comput. Vis. Image Underst. 68(2), 146\u2013157 (1997). https:\/\/doi.org\/10.1006\/cviu.1997.0547. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1077314297905476","DOI":"10.1006\/cviu.1997.0547"},{"key":"8_CR6","unstructured":"Hurriyet Daily News: Istanbul taxi drivers hunt down, beat up Uber drivers as tensions rise (2018). https:\/\/www.hurriyetdailynews.com\/istanbul-taxi-drivers-hunt-down-beat-up-uber-drivers-as-tensions-rise-128443. Accessed 11 June 2020"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02187846","volume":"7","author":"DG Kirkpatrick","year":"1992","unstructured":"Kirkpatrick, D.G., Klawe, M.M., Tarjan, R.E.: Polygon triangulation inO(n log logn) time with simple data structures. Discrete Comput. Geom. 7(4), 329\u2013346 (1992). https:\/\/doi.org\/10.1007\/BF02187846","journal-title":"Discrete Comput. Geom."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-030-99277-4_2","volume-title":"Selected Areas in Cryptography","author":"D Kumaraswamy","year":"2022","unstructured":"Kumaraswamy, D., Murthy, S., Vivek, S.: Revisiting driver anonymity in ORide. In: AlTawy, R., H\u00fclsing, A. (eds.) SAC 2021. LNCS, vol. 13203, pp. 25\u201346. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_2"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-92518-5_21","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2021","author":"D Kumaraswamy","year":"2021","unstructured":"Kumaraswamy, D., Vivek, S.: Cryptanalysis of\u00a0the\u00a0privacy-preserving ride-hailing service TRACE. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143, pp. 462\u2013484. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_21"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Mohr, R., Quan, L., Veillon, F.: Relative 3d reconstruction using multiple uncalibrated images. I. J. Robotic Res. 14, 619\u2013632 (12 1995). https:\/\/doi.org\/10.1177\/027836499501400607","DOI":"10.1177\/027836499501400607"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-38631-2_34","volume-title":"Network and System Security","author":"M Nabeel","year":"2013","unstructured":"Nabeel, M., Appel, S., Bertino, E., Buchmann, A.: Privacy preserving context aware publish subscribe systems. In: Lopez, J., Huang, X., Sandhu, R. (eds.) NSS 2013. LNCS, vol. 7873, pp. 465\u2013478. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38631-2_34"},{"key":"8_CR12","unstructured":"Pham, A., Dacosta, I., Endignoux, G., Troncoso-Pastoriza, J.R., Huguenin, K., Hubaux, J.: ORide: a privacy-preserving yet accountable ride-hailing service. In: Kirda, E., Ristenpart, T. (eds.) 26th USENIX Security Symposium, USENIX Security 2017, Vancouver, BC, Canada, 16\u201318 August 2017, pp. 1235\u20131252. USENIX Association (2017)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","volume":"1","author":"R Siedel","year":"1991","unstructured":"Siedel, R.: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl. 1, 51\u201364 (1991)","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR14","unstructured":"Stein, W., et al.: Sage Mathematics Software (Version 8.6). The Sage Development Team (2019). http:\/\/www.sagemath.org"},{"key":"8_CR15","unstructured":"TechCrunch+: Ride-hailing app Careem reveals data breach affecting 14 million people (2018). https:\/\/techcrunch.com\/2018\/04\/23\/careem-data-breach\/. Accessed 01 May 2022"},{"key":"8_CR16","unstructured":"thejournal.ie: West Dublin gang using hailing apps to target older taxi drivers (2019). https:\/\/www.thejournal.ie\/west-dublin-taxi-robbery-4420178-Jan2019\/. Accessed 11 June 2020"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Vivek, S.: Attacks on a privacy-preserving publish-subscribe system and a ride-hailing service. CoRR (2021). https:\/\/arxiv.org\/abs\/2105.04351","DOI":"10.1007\/978-3-030-92641-0_4"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Vivek, S.: Attacks on a privacy-preserving publish-subscribe system and a ride-hailing service 13129, 59\u201371 (2021). https:\/\/doi.org\/10.1007\/978-3-030-92641-0_4","DOI":"10.1007\/978-3-030-92641-0_4"},{"issue":"11","key":"8_CR19","doi-asserted-by":"publisher","first-page":"11084","DOI":"10.1109\/TVT.2018.2868869","volume":"67","author":"F Wang","year":"2018","unstructured":"Wang, F., et al.: Efficient and privacy-preserving dynamic spatial query scheme for ride-hailing services. IEEE Trans. Veh. Technol. 67(11), 11084\u201311097 (2018)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"8_CR20","unstructured":"Wikipedia contributors: Universal Transverse Mercator coordinate system (2020). https:\/\/en.wikipedia.org\/wiki\/Universal_Transverse_Mercator_coordinate_system. Accessed 27 April 2020"},{"issue":"11","key":"8_CR21","doi-asserted-by":"publisher","first-page":"10418","DOI":"10.1109\/TVT.2019.2941761","volume":"68","author":"H Yu","year":"2019","unstructured":"Yu, H., Shu, J., Jia, X., Zhang, H., Yu, X.: lpRide: lightweight and privacy-preserving ride matching over road networks in online ride hailing systems. IEEE Trans. Veh. Technol. 68(11), 10418\u201310428 (2019)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Zuo, C., Pellegrino, G., Lin, Z.: Geo-locating drivers: a study of sensitive data leakage in ride-hailing services. In: 26th Annual Network and Distributed System Security Symposium, NDSS 2019, San Diego, California, USA, 24\u201327 February 2019. The Internet Society (2019). https:\/\/www.ndss-symposium.org\/ndss-paper\/geo-locating-drivers-a-study-of-sensitive-data-leakage-in-ride-hailing-services\/","DOI":"10.14722\/ndss.2019.23052"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20974-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:03:45Z","timestamp":1672344225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20974-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031209734","9783031209741"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20974-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cans2022.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}