{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:07:45Z","timestamp":1743016065465,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185787"},{"type":"electronic","value":"9783030185794"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-18579-4_17","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:05:36Z","timestamp":1556031936000},"page":"281-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Select the Best for Me: Privacy-Preserving Polynomial Evaluation Algorithm over Road Network"],"prefix":"10.1007","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[]},{"given":"Chengliang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-46803-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"D Boneh","year":"2015","unstructured":"Boneh, D., Lewi, K., Raykova, M., Sahai, A., Zhandry, M., Zimmerman, J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 563\u2013594. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_19"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: Proceedings of ICDE, pp. 664\u2013675 (2014)","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., Tan, K.L.: Private queries in location based services: anonymizers are not necessary. In: Proceedings of SIGMOD, pp. 121\u2013132 (2008)","DOI":"10.1145\/1376616.1376631"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ghinita, G., Kalnis, P., Skiadopoulos, S.: PRIVE: anonymous location-based queries in distributed mobile systems. In: Proceedings of WWW, pp. 371\u2013380 (2007)","DOI":"10.1145\/1242572.1242623"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Hu, H., Xu, J., Ren, C., Choi, B.: Processing private queries over untrusted data cloud through privacy homomorphism. In: Proceedings of ICDE, pp. 601\u2013612 (2011)","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"17_CR6","unstructured":"Kevin, L., David J., W.: Order-revealing encryption: new constructions, applications, and lower bounds. In: Proceedings of CCS, pp. 1167\u20131178 (2016)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-32049-6_19","volume-title":"Database Systems for Advanced Applications","author":"Shushu Liu","year":"2016","unstructured":"Liu, S., et al.: Efficient query processing with mutual privacy protection for location-based services. In: Proceedings of DASFAA, pp. 299\u2013313 (2016)"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"G Oded","year":"1986","unstructured":"Oded, G., Shafi, G., Silvio, M.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Palanisamy, B., Liu, L.: MobiMix: protecting location privacy with mix-zones over road networks. In: Proceedings of ICDE, pp. 494\u2013505 (2011)","DOI":"10.1109\/ICDE.2011.5767898"},{"issue":"1\u20132","key":"17_CR10","doi-asserted-by":"publisher","first-page":"619","DOI":"10.14778\/1920841.1920920","volume":"3","author":"S Papadopoulos","year":"2010","unstructured":"Papadopoulos, S., Bakiras, S., Papadias, D.: Nearest neighbor search with strong location privacy. VLDB Endow 3(1\u20132), 619\u2013629 (2010)","journal-title":"VLDB Endow"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TKDE.2013.87","volume":"26","author":"R Paulet","year":"2014","unstructured":"Paulet, R., Kaosar, M.G., Yi, X., Bertino, E.: Privacy-preserving and content-protecting location based queries. IEEE Trans. Knowl. Data Eng. 26(5), 1200\u20131210 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"17_CR13","doi-asserted-by":"publisher","first-page":"2334","DOI":"10.1109\/TIFS.2017.2705628","volume":"12","author":"W Song","year":"2017","unstructured":"Song, W., Wang, B., Wang, Q., Shi, C., Lou, W., Peng, Z.: Publicly verifiable computation of polynomials over outsourced data with multiple sources. IEEE Trans. Inf. Forensics Secur. 12(10), 2334\u20132347 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"17_CR14","unstructured":"Vincent, R., Joan, D.: Advanced encryption standard. In: Federal Information Processing Standards Publications, pp. 19\u201322 (2001)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Cheung, D.W.l., Kao, B., Mamoulis, N.: Secure kNN computation on encrypted databases. In: Proceedings of SIGMOD, pp. 139\u2013152 (2009)","DOI":"10.1145\/1559845.1559862"},{"key":"17_CR16","unstructured":"Yao, B., Li, F., Xiao, X.: Secure nearest neighbor revisited. In: Proceedings of ICDE, pp. 733\u2013744 (2013)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Yi, X., Paulet, R., Bertino, E., Varadharajan, V.: Practical k nearest neighbor queries with location privacy. In: Proceedings of ICDE, pp. 640\u2013651 (2014)","DOI":"10.1109\/ICDE.2014.6816688"},{"issue":"6","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1109\/TKDE.2016.2520473","volume":"28","author":"X Yi","year":"2016","unstructured":"Yi, X., Paulet, R., Bertino, E., Varadharajan, V.: Practical approximate k nearest neighbor queries with location and query privacy. IEEE Trans. Knowl. Data Eng. 28(6), 1546\u20131559 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TKDE.2010.222","volume":"24","author":"ML Yiu","year":"2012","unstructured":"Yiu, M.L., Assent, I., Jensen, C.S., Kalnis, P.: Outsourced similarity search on metric data assets. IEEE Trans. Knowl. Data Eng. 24(2), 338\u2013352 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR20","unstructured":"Zhou, C., Wang, T., Jiang, W., Tian, H.: Practical k nearest neighbor query scheme with two-party guarantees in road networks. In: Proceedings of TrustCom, pp. 1316\u20131321"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cose.2016.11.013","volume":"69","author":"L Zhou","year":"2017","unstructured":"Zhou, L., Zhu, Y., Castiglione, A.: Efficient k-NN query over encrypted data in cloud with limited key-disclosure and offline data owner. Comput. Secur. 69, 84\u201396 (2017)","journal-title":"Comput. Secur."},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2015.11.004","volume":"89","author":"Y Zhu","year":"2016","unstructured":"Zhu, Y., Huang, Z., Takagi, T.: Secure and controllable k-NN query over encrypted cloud data with key confidentiality. J. Parallel Distrib. Comput. 89, 1\u201312 (2016)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18579-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:50:42Z","timestamp":1710233442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18579-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185787","9783030185794"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18579-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","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":"92","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":"64","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":"18% - 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)"}},{"value":"13 demo papers, 6 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}