{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:16:08Z","timestamp":1775258168577,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030031916","type":"print"},{"value":"9783030031923","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03192-3_3","type":"book-chapter","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:06:48Z","timestamp":1540508808000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Secure and Efficient kNN Classification Algorithm Using Encrypted Index Search and Yao\u2019s Garbled Circuit over Encrypted Databases"],"prefix":"10.1007","author":[{"given":"Hyeong-Jin","family":"Kim","sequence":"first","affiliation":[]},{"given":"Jae-Hwan","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Jae-Woo","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Vimercati, S., Foresti, S., Samarati, P.: Managing and accessing data in the cloud: privacy risks and approaches. In: CRiSIS, pp. 1\u20139 (2012)","DOI":"10.1109\/CRISIS.2012.6378956"},{"key":"3_CR2","unstructured":"Riley, J.W., Alfons, C., Fred\u00e4ng, E., Lind, P.: Nearest Neighbor Classifiers (2009)"},{"issue":"5","key":"3_CR3","first-page":"1261","volume":"27","author":"B Samanthula","year":"2015","unstructured":"Samanthula, B., Elmehdwi, Y., Jiang, W.: K-nearest neighbor classification over semantically secure encrypted relational data. TKDE 27(5), 1261\u20131273 (2015)","journal-title":"TKDE"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: ICDE, pp. 664\u2013675 (2014)","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"3_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: ICDE, pp. 601\u2013612 (2011)","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Xu, R., Takagi, T.: Secure k-NN computation on encrypted cloud data without sharing key with query users. In: Security in cloud computing, pp. 55\u201360 (2013)","DOI":"10.1145\/2484402.2484415"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Kim, H., Kim, H., Chang, J.: A kNN query processing algorithm using a tree index structure on the encrypted database. In: Big Data and Smart Computing (BigComp), pp. 93\u2013100 (2016)","DOI":"10.1109\/BIGCOMP.2016.7425806"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT, pp. 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Liu, A., Zhengy, K., Liz, L., Liu, G., Zhao, L., Zhou, X.: Efficient secure similarity computation on encrypted trajectory data. In: ICDE, pp. 66\u201377 (2015)","DOI":"10.1109\/ICDE.2015.7113273"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security, vol. 201, no. 1 (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45811-5_37","volume-title":"Information Security","author":"J Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer, J.: A provably secure additive and multiplicative privacy homomorphism*. In: Chan, A.H., Gligor, V. (eds.) ISC 2002. LNCS, vol. 2433, pp. 471\u2013483. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45811-5_37"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Samanthula, B.K., Chun, H., Jiang, W.: An efficient and probabilistic secure bit-decomposition. In: ASIACCS, pp. 541\u2013546 (2013)","DOI":"10.1145\/2484313.2484386"},{"key":"3_CR14","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann (2006)"},{"key":"3_CR15","unstructured":"http:\/\/archive.ics.uci.edu\/ml\/"}],"container-title":["Lecture Notes in Computer Science","Future Data and Security Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03192-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:53:08Z","timestamp":1775253188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03192-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030031916","9783030031923"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03192-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.hcmut.edu.vn\/fdse2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}