{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:00:42Z","timestamp":1777964442388,"version":"3.51.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031828515","type":"print"},{"value":"9783031828522","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82852-2_1","type":"book-chapter","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T13:01:48Z","timestamp":1741784508000},"page":"3-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Revisiting Oblivious Top-$$k$$ Selection with\u00a0Applications to\u00a0Secure $$k$$-NN Classification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2636-4406","authenticated-orcid":false,"given":"Kelong","family":"Cong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4684-3532","authenticated-orcid":false,"given":"Robin","family":"Geelen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1093-7978","authenticated-orcid":false,"given":"Jiayi","family":"Kang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0557-3540","authenticated-orcid":false,"given":"Jeongeun","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). http:\/\/www.degruyter.com\/view\/j\/jmc.2015.9.issue-3\/jmc-2015-0016\/jmc-2015-0016.xml","DOI":"10.1515\/jmc-2015-0016"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/BF01267888","volume":"5","author":"VE Alekseev","year":"1969","unstructured":"Alekseev, V.E.: Sorting algorithms with minimum memory. Cybernetics 5(5), 642\u2013648 (1969)","journal-title":"Cybernetics"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-031-13945-1_11","volume-title":"Privacy in Statistical Databases: International Conference, PSD 2022, Paris, France, September 21\u201323, 2022, Proceedings","author":"Y Ameur","year":"2022","unstructured":"Ameur, Y., Aziz, R., Audigier, V., Bouzefrane, S.: Secure and\u00a0non-interactive k-NN classifier using symmetric fully homomorphic encryption. In: Domingo-Ferrer, J., Laurent, M. (eds.) Privacy in Statistical Databases: International Conference, PSD 2022, Paris, France, September 21\u201323, 2022, Proceedings, pp. 142\u2013154. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13945-1_11"},{"key":"1_CR4","unstructured":"Beirendonck, M.V., D\u2019Anvers, J.P., Verbauwhede, I.: FPT: a fixed-point accelerator for torus fully homomorphic encryption. Cryptology ePrint Archive, Report 2022\/1635 (2022). https:\/\/eprint.iacr.org\/2022\/1635"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Bertels, J., Beirendonck, M.V., Turan, F., Verbauwhede, I.: Hardware acceleration of FHEW. In: Jenihhin, M., Kub\u00e1tov\u00e1, H., Metens, N., Raik, J., Ahmed, F., Belohoubek, J. (eds.) 26th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2023, Tallinn, Estonia, May 3-5, 2023, pp. 57\u201360. IEEE (2023). https:\/\/doi.org\/10.1109\/DDECS57882.2023.10139347","DOI":"10.1109\/DDECS57882.2023.10139347"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO 2012, pp. 868\u2013886. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (Jan 2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"1_CR8","unstructured":"Chakraborty, O., Zuber, M.: Efficient and accurate homomorphic comparisons. Cryptology ePrint Archive, Report 2022\/622 (2022). https:\/\/eprint.iacr.org\/2022\/622"},{"key":"1_CR9","unstructured":"Chen, H., Chillotti, I., Dong, Y., Poburinnaya, O., Razenshteyn, I.P., Riazi, M.S.: SANNS: Scaling up secure approximate k-nearest neighbors search. In: Capkun, S., Roesner, F. (eds.) USENIX Security 2020, pp. 2111\u20132128. USENIX Association (Aug 2020)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-030-78372-3_18","volume-title":"Applied Cryptography and Network Security: 19th International Conference, ACNS 2021, Kamakura, Japan, June 21\u201324, 2021, Proceedings, Part I","author":"H Chen","year":"2021","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient homomorphic conversion between (Ring) LWE ciphertexts. In: Sako, K., Tippenhauer, N.O. (eds.) Applied Cryptography and Network Security: 19th International Conference, ACNS 2021, Kamakura, Japan, June 21\u201324, 2021, Proceedings, Part I, pp. 460\u2013479. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78372-3_18"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1243\u20131255. ACM Press (Oct\u00a0\/\u00a0Nov 2017). https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I","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.) Advances in Cryptology \u2013 ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I, pp. 409\u2013437. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: Fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"1_CR14","unstructured":"Cong, K., Das, D., Nicolas, G., Park, J.: Panacea: Non-interactive and stateless oblivious RAM. Cryptology ePrint Archive, Report 2023\/274 (2023). https:\/\/eprint.iacr.org\/2023\/274"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.L.: SortingHat: Efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 563\u2013577. ACM Press (Nov 2022). https:\/\/doi.org\/10.1145\/3548606.3560702","DOI":"10.1145\/3548606.3560702"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1135\u20131150. ACM Press (Nov 2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"1_CR17","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"1_CR18","unstructured":"Geelen, R., et al.: BASALISC: Flexible asynchronous hardware accelerator for fully homomorphic encryption. Cryptology ePrint Archive, Report 2022\/657 (2022). https:\/\/eprint.iacr.org\/2022\/657"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"246","DOI":"10.2478\/popets-2021-0046","volume":"2021","author":"I Iliashenko","year":"2021","unstructured":"Iliashenko, I., Zucca, V.: Faster homomorphic comparison operations for BGV and BFV. PoPETs 2021(3), 246\u2013264 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0046","journal-title":"PoPETs"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Jannach, D., Zanker, M., Felfernig, A., Friedrich, G.: Recommender systems: an introduction. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511763113"},{"key":"1_CR21","unstructured":"J\u00f3nsson, K.V., Kreitz, G., Uddin, M.: Secure multi-party sorting and applications. Cryptology ePrint Archive, Report 2011\/122 (2011). https:\/\/eprint.iacr.org\/2011\/122"},{"key":"1_CR22","unstructured":"Knuth, D.E.: The art of computer programming: Volume 3: Sorting and Searching. Addison-Wesley Professional (1998)"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Kramer, O.: K-Nearest Neighbors, pp. 13\u201323. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38652-7_2","DOI":"10.1007\/978-3-642-38652-7_2"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Liu, Z., Micciancio, D., Polyakov, Y.: Large-precision homomorphic sign evaluation using FHEW\/TFHE bootstrapping. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 130\u2013160. Springer, Heidelberg (Dec 2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_5","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1_CR26","unstructured":"Mitchell, M.: An introduction to genetic algorithms. MIT press (1998)"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-59013-0_5","volume-title":"Computer Security \u2013 ESORICS 2020: 25th European Symposium on Research in Computer Security, ESORICS 2020, Guildford, UK, September 14\u201318, 2020, Proceedings, Part II","author":"J Park","year":"2020","unstructured":"Park, J., Tibouchi, M.: SHECS-PIR: somewhat homomorphic encryption-based compact and scalable private information retrieval. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) Computer Security \u2013 ESORICS 2020: 25th European Symposium on Research in Computer Security, ESORICS 2020, Guildford, UK, September 14\u201318, 2020, Proceedings, Part II, pp. 86\u2013106. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_5"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (May 2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Samardzic, N., et al.: Craterlake: a hardware accelerator for efficient unbounded computation on encrypted data. In: Salapura, V., Zahran, M., Chong, F., Tang, L. (eds.) ISCA \u201922: The 49th Annual International Symposium on Computer Architecture, New York, New York, USA, June 18 - 22, 2022, pp. 173\u2013187. ACM (2022). https:\/\/doi.org\/10.1145\/3470496.3527393","DOI":"10.1145\/3470496.3527393"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Servan-Schreiber, S., Langowski, S., Devadas, S.: Private approximate nearest neighbor search with sublinear communication. In: 2022 IEEE Symposium on Security and Privacy, pp. 911\u2013929. IEEE Computer Society Press (May 2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833702","DOI":"10.1109\/SP46214.2022.9833702"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Shanbhag, A., Pirk, H., Madden, S.: Efficient top-k query processing on massively parallel hardware. In: Das, G., Jermaine, C.M., Bernstein, P.A. (eds.) Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018, pp. 1557\u20131570. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3183735","DOI":"10.1145\/3183713.3183735"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"42","DOI":"10.2478\/popets-2020-0045","volume":"2020","author":"H Shaul","year":"2020","unstructured":"Shaul, H., Feldman, D., Rus, D.: Secure k-ish nearest neighbors classifier. PoPETs 2020(3), 42\u201361 (2020). https:\/\/doi.org\/10.2478\/popets-2020-0045","journal-title":"Secure k-ish nearest neighbors classifier. PoPETs"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-49669-2_10","volume-title":"Data and Applications Security and Privacy XXXIV: 34th Annual IFIP WG 11.3 Conference, DBSec 2020, Regensburg, Germany, June 25\u201326, 2020, Proceedings","author":"A Tueno","year":"2020","unstructured":"Tueno, A., Boev, Y., Kerschbaum, F.: Non-interactive private decision tree evaluation. In: Singhal, A., Vaidya, J. (eds.) Data and Applications Security and Privacy XXXIV: 34th Annual IFIP WG 11.3 Conference, DBSec 2020, Regensburg, Germany, June 25\u201326, 2020, Proceedings, pp. 174\u2013194. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49669-2_10"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Wang, G., Luo, T., Goodrich, M.T., Du, W., Zhu, Z.: Bureaucratic protocols for secure two-party sorting, selection, and permuting. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, pp. 226\u2013237 (2010)","DOI":"10.1145\/1755688.1755716"},{"key":"1_CR35","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 the 2009 ACM SIGMOD International Conference on Management of Data, pp. 139\u2013152 (2009)","DOI":"10.1145\/1559845.1559862"},{"issue":"3","key":"1_CR36","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0209043","volume":"9","author":"ACC Yao","year":"1980","unstructured":"Yao, A.C.C.: Bounds on selection networks. SIAM J. Comput. 9(3), 566\u2013582 (1980)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1_CR37","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2478\/popets-2021-0020","volume":"2021","author":"M Zuber","year":"2021","unstructured":"Zuber, M., Sirdey, R.: Efficient homomorphic evaluation of k-NN classifiers. PoPETs 2021(2), 111\u2013129 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0020","journal-title":"PoPETs"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82852-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T13:02:02Z","timestamp":1741784522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82852-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031828515","9783031828522"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82852-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}