{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:31:47Z","timestamp":1765103507859,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":70,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551217","type":"print"},{"value":"9789819551224","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5122-4_10","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:51Z","timestamp":1765103331000},"page":"296-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Security and\u00a0Privacy of\u00a0CKKS-Based Homomorphic Evaluation Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3870-2096","authenticated-orcid":false,"given":"Intak","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1151-2453","authenticated-orcid":false,"given":"Seonhong","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9080-5272","authenticated-orcid":false,"given":"Jinyeong","family":"Seo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0496-9789","authenticated-orcid":false,"given":"Yongsoo","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., et al.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 308\u2013318 (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-031-58751-1_16","volume-title":"Advances in Cryptology - EUROCRYPT 2024","author":"MR Albrecht","year":"2024","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Gardham, D.: Crypto dark matter on the torus: Oblivious PRFs from shallow PRFs and TFHE. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 447\u2013476. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_16"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 962\u2013979. IEEE (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-030-56880-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Attema","year":"2020","unstructured":"Attema, T., Lyubashevsky, V., Seiler, G.: Practical product proofs for lattice commitments. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 470\u2013499. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_17"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-031-68382-4_12","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"Y Bae","year":"2024","unstructured":"Bae, Y., Cheon, J.H., Hanrot, G., Park, J.H., Stehl\u00e9, D.: Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14922, pp. 387\u2013421. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_12"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bae, Y., Kim, J., Stehl\u00e9, D., Suvanto, E.: Bootstrapping small integers with CKKS. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 330\u2013360 (2024)","DOI":"10.1007\/978-981-96-0875-1_11"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: simultaneously solving how and what. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_25"},{"key":"10_CR10","unstructured":"Bell, J., et al.: $$\\{$$ACORN$$\\}$$: input validation for secure aggregation. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 4805\u20134822 (2023)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Boemer, F., Costache, A., Cammarota, R., Wierzynski, C.: ngraph-he2: A high-throughput framework for neural network inference on encrypted data. In: Proceedings of the 7th ACM Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp. 45\u201356 (2019)","DOI":"10.1145\/3338469.3358944"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-75248-4_19","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"A Bois","year":"2021","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 528\u2013558. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_19"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-44223-1_14","volume-title":"Post-Quantum Cryptography","author":"C Boschini","year":"2020","unstructured":"Boschini, C., Camenisch, J., Ovsiankin, M., Spooner, N.: Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 247\u2013267. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_14"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","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.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309\u2013325 (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 315\u2013334. IEEE (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-56877-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"N Carlini","year":"2020","unstructured":"Carlini, N., Jagielski, M., Mironov, I.: Cryptanalytic extraction of neural\u00a0network models. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 189\u2013218. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_7"},{"key":"10_CR21","unstructured":"Carlini, N., Liu, C., Erlingsson, \u00da., Kos, J., Song, D.: The secret sharer: evaluating and testing unintended memorization in neural networks. In: 28th USENIX Security Symposium (USENIX Security 19), pp. 267\u2013284 (2019)"},{"key":"10_CR22","unstructured":"Carlini, N., et\u00a0al.: Extracting training data from large language models. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 2633\u20132650 (2021)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Chatel, S., Mouchet, C., Sahin, A.U., Pyrgelis, A., Troncoso, C., Hubaux, J.P.: Pelta-shielding multiparty-FHE against malicious adversaries. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 711\u2013725 (2023)","DOI":"10.1145\/3576915.3623139"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-68382-4_1","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"M Checri","year":"2024","unstructured":"Checri, M., Sirdey, R., Boudguiga, A., Bultel, J.P.: On the practical cpa$$^{D}$$ security of \u201cexact\u2019\u2019 and threshold FHE schemes and libraries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14922, pp. 3\u201333. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_1"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-17656-3_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"H Chen","year":"2019","unstructured":"Chen, H., Chillotti, I., Song, Y.: Improved bootstrapping for approximate homomorphic encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 34\u201354. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_2"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 395\u2013412 (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled psi from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1223\u20131237 (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Choe, H., Passel\u00e8gue, A., Stehl\u00e9, D., Suvanto, E.: Attacks against the IND-CPAD security of exact FHE schemes. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 2505\u20132519 (2024)","DOI":"10.1145\/3658644.3690341"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-78381-9_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-030-10970-7_16","volume-title":"Selected Areas in Cryptography - SAC 2018","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 347\u2013368. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","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.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-64834-3_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"JH Cheon","year":"2020","unstructured":"Cheon, J.H., Kim, D., Kim, D.: Efficient homomorphic comparison methods with optimal complexity. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 221\u2013256. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_8"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"issue":"1","key":"10_CR34","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)","journal-title":"J. Cryptol."},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Cho, W., Hanrot, G., Kim, T., Park, M., Stehl\u00e9, D.: Fast and accurate homomorphic softmax evaluation. In: ACM CCS (2024)","DOI":"10.1145\/3658644.3670369"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Cong, K., et al.: Labeled psi from homomorphic encryption with reduced computation and communication. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 1135\u20131150 (2021)","DOI":"10.1145\/3460120.3484760"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Dahl, M., et al.: Noah\u2019s ark: efficient threshold-FHE using noise flooding. In: Proceedings of the 11th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp. 35\u201346 (2023)","DOI":"10.1145\/3605759.3625259"},{"key":"10_CR38","unstructured":"Dwork, C., Feldman, V.: Privacy-preserving prediction. In: Conference on Learning Theory, pp. 1693\u20131702. PMLR (2018)"},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-030-64834-3_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MF Esgin","year":"2020","unstructured":"Esgin, M.F., Nguyen, N.K., Seiler, G.: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 259\u2013288. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_9"},{"key":"10_CR41","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"J Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 927\u2013938. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_75"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-45388-6_5","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"D Fiore","year":"2020","unstructured":"Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting verifiable computation on\u00a0encrypted data. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 124\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_5"},{"issue":"4","key":"10_CR44","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: snarks for ring arithmetic. J. Cryptol. 36(4), 41 (2023)","journal-title":"J. Cryptol."},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"10_CR46","unstructured":"Guo, Q., Nabokov, D., Suvanto, E., Johansson, T.: Key recovery attacks on approximate homomorphic encryption with non-worst-case noise flooding countermeasures. In: USENIX Security (2024)"},{"key":"10_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-662-46800-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"S Halevi","year":"2015","unstructured":"Halevi, S., Shoup, V.: Bootstrapping for HElib. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 641\u2013670. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_25"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-96884-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Halevi","year":"2018","unstructured":"Halevi, S., Shoup, V.: Faster homomorphic linear transformations in HElib. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 93\u2013120. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_4"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Hwang, I., Lee, H., Seo, J., Song, Y.: Practical zero-knowledge PIOP for maliciously secure multiparty homomorphic encryption. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (2025)","DOI":"10.1145\/3719027.3765229"},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-031-68403-6_13","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"I Hwang","year":"2024","unstructured":"Hwang, I., Seo, J., Song, Y.: Concretely efficient lattice-based polynomial commitment from standard assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 414\u2013448. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_13"},{"key":"10_CR51","doi-asserted-by":"crossref","unstructured":"Ju, J.H., et al.: Neujeans: private neural network inference with joint optimization of convolution and FHE bootstrapping. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4361\u20134375 (2024)","DOI":"10.1145\/3658644.3690375"},{"key":"10_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-031-38554-4_18","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"D Kim","year":"2023","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from hint-MLWE. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 549\u2013580. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18"},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"Kim, T., Kwak, H., Lee, D., Seo, J., Song, Y.: Asymptotically faster multi-key homomorphic encryption from homomorphic gadget decomposition. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 726\u2013740 (2023)","DOI":"10.1145\/3576915.3623176"},{"key":"10_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-031-54773-7_16","volume-title":"Applied Cryptography and Network Security - ACNS 2024","author":"H Kwak","year":"2024","unstructured":"Kwak, H., Lee, D., Song, Y., Wagh, S.: A general framework of homomorphic encryption for multiple parties with non-interactive key-aggregation. In: P\u00f6pper, C., Batina, L. (eds.) ACNS 2024. LNCS, vol. 14584, pp. 403\u2013430. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-54773-7_16"},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Lecuyer, M., Atlidakis, V., Geambasu, R., Hsu, D., Jana, S.: Certified robustness to adversarial examples with differential privacy. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 656\u2013672. IEEE (2019)","DOI":"10.1109\/SP.2019.00044"},{"key":"10_CR56","unstructured":"Lee, E., et al.: Low-complexity deep convolutional neural networks on fully homomorphic encryption using multiplexed parallel convolutions. In: International Conference on Machine Learning, pp. 12403\u201312422. PMLR (2022)"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-77870-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"J-W Lee","year":"2021","unstructured":"Lee, J.-W., Lee, E., Lee, Y., Kim, Y.-S., No, J.-S.: High-precision bootstrapping of\u00a0RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 618\u2013647. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_22"},{"key":"10_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-030-77870-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"B Li","year":"2021","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23"},{"key":"10_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-031-15802-5_20","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"B Li","year":"2022","unstructured":"Li, B., Micciancio, D., Schultz-Wu, M., Sorrell, J.: Securing approximate homomorphic encryption using differential privacy. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 560\u2013589. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_20"},{"key":"10_CR60","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1219\u20131234 (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"10_CR61","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Practical lattice-based zero-knowledge proofs for integer relations. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1051\u20131070 (2020)","DOI":"10.1145\/3372297.3417894"},{"key":"10_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"10_CR63","doi-asserted-by":"crossref","unstructured":"Menon, S.J., Wu, D.J.: Spiral: fast, high-rate single-server PIR via FHE composition. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 930\u2013947. IEEE (2022)","DOI":"10.1109\/SP46214.2022.9833700"},{"issue":"1","key":"10_CR64","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"10_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-031-57728-4_10","volume-title":"Public-Key Cryptography - PKC 2024","author":"D Micciancio","year":"2024","unstructured":"Micciancio, D., Vaikuntanathan, V.: SoK: learning with errors, circular security, and fully homomorphic encryption. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14604, pp. 291\u2013321. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57728-4_10"},{"key":"10_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_8"},{"issue":"5","key":"10_CR67","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"10_CR69","first-page":"2635","volume":"11","author":"S Shalev-Shwartz","year":"2010","unstructured":"Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Learnability, stability and uniform convergence. J. Mach. Learn. Res. 11, 2635\u20132670 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR70","doi-asserted-by":"crossref","unstructured":"Shokri, R., Stronati, M., Song, C., Shmatikov, V.: Membership inference attacks against machine learning models. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 3\u201318. IEEE (2017)","DOI":"10.1109\/SP.2017.41"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5122-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:56Z","timestamp":1765103336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5122-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551217","9789819551224"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5122-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","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":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}