{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:44:30Z","timestamp":1746297870055,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031230196"},{"type":"electronic","value":"9783031230202"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-23020-2_36","type":"book-chapter","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T07:03:04Z","timestamp":1670310184000},"page":"633-648","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Driver Locations Harvesting Attack on\u00a0pRide"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0222-322X","authenticated-orcid":false,"given":"Shyam","family":"Murthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8426-0859","authenticated-orcid":false,"given":"Srinivas","family":"Vivek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"36_CR1","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012). http:\/\/eprint.iacr.org\/2012\/144"},{"key":"36_CR2","unstructured":"Google: Google Maps Platform (2019). https:\/\/developers.google.com\/maps\/documentation\/roads\/intro\/. Accessed 01 Aug 2022"},{"key":"36_CR3","unstructured":"Google: Google Maps Platform, client libraries for google maps web services (2019). https:\/\/developers.google.com\/maps\/web-services\/client-library. Accessed 01 Aug 2022"},{"issue":"8","key":"36_CR4","doi-asserted-by":"publisher","first-page":"7413","DOI":"10.1109\/TVT.2021.3090042","volume":"70","author":"J Huang","year":"2021","unstructured":"Huang, J., Luo, Y., Fu, S., Xu, M., Hu, B.: pRide: privacy-preserving online ride hailing matching system with prediction. IEEE Trans. Veh. Technol. 70(8), 7413\u20137425 (2021). https:\/\/doi.org\/10.1109\/TVT.2021.3090042","journal-title":"IEEE Trans. Veh. Technol."},{"key":"36_CR5","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":"36_CR6","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"},{"issue":"7","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1109\/TIFS.2018.2885282","volume":"14","author":"Y Luo","year":"2019","unstructured":"Luo, Y., Jia, X., Fu, S., Xu, M.: pRide: privacy-preserving ride matching over road networks for online ride-hailing service. IEEE Trans. Inf. Forensics Secur. 14(7), 1791\u20131802 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"36_CR8","unstructured":"Mordor Intelligence: Ride-Hailing Market - Growth, Trends, Covid-19 Impact, And Forecasts (2022\u20132027) (2020). https:\/\/www.mordorintelligence.com\/industry-reports\/ride-hailing-market. Accessed 23 July 2022"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-35199-1_14","volume-title":"Cryptography and Coding","author":"S Murthy","year":"2019","unstructured":"Murthy, S., Vivek, S.: Cryptanalysis of a protocol for efficient sorting on SHE encrypted data. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 278\u2013294. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_14"},{"key":"36_CR10","doi-asserted-by":"publisher","unstructured":"Murthy, S., Vivek, S.: Passive triangulation attack on oRide (2022). https:\/\/doi.org\/10.48550\/ARXIV.2208.12216. https:\/\/arxiv.org\/abs\/2208.12216","DOI":"10.48550\/ARXIV.2208.12216"},{"key":"36_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":"36_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":"36_CR13","doi-asserted-by":"crossref","unstructured":"Pham, A., et al.: PrivateRide: a privacy-enhanced ride-hailing service. PoPETs 2017(2), 38\u201356 (2017). https:\/\/doi.org\/10.1515\/popets-2017-0015","DOI":"10.1515\/popets-2017-0015"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. In: Voisard, A., Chen, S. (eds.) ACM-GIS 2002, Proceedings of the Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA (near Washington, DC), USA, USA, 8\u20139 November 2002, pp. 94\u201310. ACM (2002)","DOI":"10.1145\/585147.585167"},{"key":"36_CR15","unstructured":"Shi, X., Chen, Z., Wang, H., Yeung, D.Y., Wong, W.K., Woo, W.C.: Convolutional LSTM network: a machine learning approach for precipitation nowcasting. In: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1, NIPS 2015, pp. 802\u2013810. MIT Press, Cambridge (2015)"},{"key":"36_CR16","unstructured":"Stein, W., et\u00a0al.: Sage Mathematics Software (Version 8.6). The Sage Development Team (2019). http:\/\/www.sagemath.org"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-92641-0_4","volume-title":"Cryptography and Coding","author":"S Vivek","year":"2021","unstructured":"Vivek, S.: Attacks on a privacy-preserving publish-subscribe system and a ride-hailing service. In: Paterson, M.B. (ed.) IMACC 2021. LNCS, vol. 13129, pp. 59\u201371. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92641-0_4"},{"issue":"11","key":"36_CR18","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":"36_CR19","unstructured":"Wikipedia contributors: Universal Transverse Mercator coordinate system (2020). https:\/\/en.wikipedia.org\/wiki\/Universal_Transverse_Mercator_coordinate_system. Accessed 01 Aug 2022"},{"key":"36_CR20","unstructured":"Wikipedia contributors: Coprime Integers (2022). https:\/\/en.wikipedia.org\/wiki\/Coprime_integers. Accessed 09 Aug 2022"},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1109\/TIFS.2021.3065832","volume":"16","author":"H Xie","year":"2021","unstructured":"Xie, H., Guo, Y., Jia, X.: A privacy-preserving online ride-hailing system without involving a third trusted server. IEEE Trans. Inf. Forensics Secur. 16, 3068\u20133081 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"11","key":"36_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23020-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T07:19:08Z","timestamp":1670311148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23020-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230196","9783031230202"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23020-2_36","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":"7 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network and System Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denarau Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fiji","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":"9 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/nss2022\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","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":"23","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":"18","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":"28% - 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","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)"}}]}}