{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:47:58Z","timestamp":1743094078856,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811088896"},{"type":"electronic","value":"9789811088902"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-10-8890-2_14","type":"book-chapter","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T07:54:25Z","timestamp":1522137265000},"page":"195-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Assured Large-Scale Navigation from Encrypted Approximate Shortest Path Recommendation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7023-7105","authenticated-orcid":false,"given":"Zhenkui","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,28]]},"reference":[{"key":"14_CR1","unstructured":"Real datasets for spatial databases: Road networks and points of interest. \n                  https:\/\/www.cs.utah.edu\/~lifeifei\/SpatialDataset.htm"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Barrier, J., Fousse, L., Killijian, M.-O.: XPIR: private information retrieval for everyone. In: Proceedings of PETS (2015)","DOI":"10.1515\/popets-2016-0010"},{"key":"14_CR3","unstructured":"Boneh, D., Mazieres, D., Popa, R.A.: Remote oblivious storage: making oblivious ram practical (2011)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Gollapudi, S., Najork, M., Panigrahy, R.: A sketch-based distance oracle for web-scale graphs. In: Proceedings of ACM WSDM, pp. 401\u2013410 (2010)","DOI":"10.1145\/1718487.1718537"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","volume-title":"Privacy Enhancing Technologies","author":"Z Erkin","year":"2009","unstructured":"Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 235\u2013253. Springer, Heidelberg (2009). \n                  https:\/\/doi.org\/10.1007\/978-3-642-03168-7_14"},{"key":"14_CR6","unstructured":"Gupta, T., Crooks, N., Mulhern, W., Setty, S.T., Alvisi, L., Walfish, M.: Scalable and private media consumption with popcorn. In: Proceedings of NSDI (2016)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kim, S., Kim, J., Koo, D., Kim, Y., Yoon, H., Shin, J.: Efficient privacy-preserving matrix factorization via fully homomorphic encryption. In Proceedings of ACM ASIACCS (2016)","DOI":"10.1145\/2897845.2897875"},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00779-008-0212-5","volume":"13","author":"J Krumm","year":"2009","unstructured":"Krumm, J.: A survey of computational location privacy. Pers. Ubiquit. Comput. 13(6), 391\u2013399 (2009)","journal-title":"Pers. Ubiquit. Comput."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Meng, X., Kamara, S., Nissim, K., Kollios, G.: Grecs: graph encryption for approximate shortest distance queries. In: Proceedings of ACM CCS (2015)","DOI":"10.1145\/2810103.2813672"},{"key":"14_CR10","unstructured":"Microsoft Trustworthy Computing. Location based services and privacy (2011). \n                  http:\/\/www.microsoft.com\/en-us\/download\/confirmation.aspx?id=3250"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Yiu, M.L.: Shortest path computation with no information leakage (2012)","DOI":"10.14778\/2212351.2212352"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., Boneh, D.: Privacy-preserving matrix factorization. In: Proceedings of ACM CCS (2013)","DOI":"10.1145\/2508859.2516751"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/T-AFFC.2012.33","volume":"4","author":"Y Rahulamathavan","year":"2013","unstructured":"Rahulamathavan, Y., Phan, R.C.-W., Chambers, J.A., Parish, D.J.: Facial expression recognition in the encrypted domain based on local fisher discriminant analysis. IEEE Trans. Affect. Comput. 4(1), 83\u201392 (2013)","journal-title":"IEEE Trans. Affect. Comput."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1536","DOI":"10.1109\/MWC.2012.6155874","volume":"19","author":"KG Shin","year":"2012","unstructured":"Shin, K.G., Ju, X., Chen, Z., Hu, X.: Privacy protection for users of location-based services. IEEE Wirel. Commun. 19(1), 1536\u20131284 (2012)","journal-title":"IEEE Wirel. Commun."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of ACM CCS, pp. 299\u2013310 (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-70972-7_5","volume-title":"Financial Cryptography and Data Security","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Ren, K., Du, M., Li, Q., Mohaisen, A.: SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 79\u201397. Springer, Cham (2017). \n                  https:\/\/doi.org\/10.1007\/978-3-319-70972-7_5"},{"key":"14_CR17","unstructured":"Williams, P., Sion, R.: Usable pir. In: Proceedings of NDSS (2008)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Wu, D.J., Zimmerman, J., Planul, J., Mitchell, J.C.: Privacy-preserving shortest path computation. arXiv preprint \n                  arXiv:1601.02281\n                  \n                 (2016)","DOI":"10.14722\/ndss.2016.23052"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.pmcj.2013.06.002","volume":"13","author":"Y Xi","year":"2014","unstructured":"Xi, Y., Schwiebert, L., Shi, W.: Privacy preserving shortest path routing with an application to navigation. Pervasive Mob. Comput. 13, 142\u2013149 (2014)","journal-title":"Pervasive Mob. Comput."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Xie, D., Li, G., Yao, B., Wei, X., Xiao, X., Gao, Y., Guo, M.: Practical private shortest path computation based on oblivious storage. In: Proceedings of IEEE ICDE, pp. 361\u2013372 (2016)","DOI":"10.1109\/ICDE.2016.7498254"}],"container-title":["Communications in Computer and Information Science","Mobile Ad-hoc and Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-8890-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:31:22Z","timestamp":1558395082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-8890-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811088896","9789811088902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-8890-2_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"28 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mobile Ad-Hoc and Sensor Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"msn2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/msn2017.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}