{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:29:29Z","timestamp":1780633769168,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987351","type":"print"},{"value":"9789819987368","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8736-8_2","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T06:01:54Z","timestamp":1702792914000},"page":"36-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Rotation Key Reduction for\u00a0Client-Server Systems of\u00a0Deep Neural Network on\u00a0Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Joon-Woo","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eunsang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Young-Sik","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong-Seon","family":"No","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"2_CR1","unstructured":"Lattigo v3, April 2022. Online: https:\/\/github.com\/tuneinsight\/lattigo, ePFL-LDS, Tune Insight SA"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-030-77870-5_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"J-P Bossuat","year":"2021","unstructured":"Bossuat, J.-P., Mouchet, C., Troncoso-Pastoriza, J., Hubaux, J.-P.: Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 587\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_21"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bossuat, J.P., Troncoso-Pastoriza, J., Hubaux, J.P.: Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation. In: Ateniese, G., Venturi, D. (eds.) ACNS 2022, pp. 521\u2013541. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_26","DOI":"10.1007\/978-3-031-09234-3_26"},{"key":"2_CR4","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"},{"issue":"2","key":"2_CR5","first-page":"1","volume":"10","author":"GS \u00c7etin","year":"2017","unstructured":"\u00c7etin, G.S., Chen, H., Laine, K., Lauter, K., Rindal, P., Xia, Y.: Private queries on encrypted genomic data. BMC Med. Genomics 10(2), 1\u201314 (2017)","journal-title":"BMC Med. Genomics"},{"key":"2_CR6","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":"2_CR7","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":"2_CR8","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Cid, C., Jacobson Jr., M. (eds.) Proceedings of International Conference on Selected Areas in Cryptography (SAC). LNCS, vol. 11349, pp. 347\u2013368. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2019.2925425","volume":"7","author":"JH Cheon","year":"2019","unstructured":"Cheon, J.H., Hhan, M., Hong, S., Son, Y.: A hybrid of dual and meet-in-the-middle attack on sparse and ternary secret LWE. IEEE Access 7, 89497\u201389506 (2019)","journal-title":"IEEE Access"},{"key":"2_CR10","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":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-030-92078-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"J Cho","year":"2021","unstructured":"Cho, J., et al.: Transciphering framework for approximate homomorphic encryption. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 640\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_22"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stan. B 71(4), 233\u2013240 (1967)","journal-title":"J. Res. Natl. Bur. Stan. B"},{"key":"2_CR13","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptol. ePrint Arch. Technical report 2012\/144 (2012)"},{"key":"2_CR14","unstructured":"Gilad-Bachrach, R., Dowlin, N., Laine, K., Lauter, K., Naehrig, M., Wernsing, J.: CryptoNets: applying neural networks to encrypted data with high throughput and accuracy. In: Proceedings of International Conference on Machine Learning (ICML), pp. 201\u2013210. PMLR (2016)"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Ha, J., Kim, S., Lee, B., Lee, J., Son, M.: Rubato: noisy ciphers for approximate homomorphic encryption. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 581\u2013610. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_20","DOI":"10.1007\/978-3-031-06944-4_20"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"key":"2_CR17","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":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-40186-3_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"K Han","year":"2020","unstructured":"Han, K., Ki, D.: Better bootstrapping for approximate homomorphic encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 364\u2013390. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_16"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Jiang, X., Kim, M., Lauter, K., Song, Y.: Secure outsourced matrix computation and application to neural networks. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 1209\u20131222 (2018)","DOI":"10.1145\/3243734.3243837"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"114","DOI":"10.46586\/tches.v2021.i4.114-148","volume":"2021","author":"W Jung","year":"2021","unstructured":"Jung, W., Kim, S., Ahn, J.H., Cheon, J.H., Lee, Y.: Over 100x faster bootstrapping in fully homomorphic encryption through memory-centric optimization with GPUs. IACR Trans. Cryptographic Hardware Embed. Syst. 2021(4), 114\u2013148 (2021)","journal-title":"IACR Trans. Cryptographic Hardware Embed. Syst."},{"key":"2_CR21","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasan, A.: GAZELLE: a low latency framework for secure neural network inference. In: Proceedings of the 27th USENIX Security Symposium, pp. 1651\u20131669 (2018)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Kim, M., Lauter, K.: Private genome analysis through homomorphic encryption. In: BMC Medical Informatics and Decision Making, vol. 15, pp. 1\u201312. BioMed Central (2015)","DOI":"10.1186\/1472-6947-15-S5-S3"},{"issue":"7","key":"2_CR23","first-page":"1","volume":"13","author":"M Kim","year":"2020","unstructured":"Kim, M., Song, Y., Li, B., Micciancio, D.: Semi-parallel logistic regression for GWAS on encrypted data. BMC Med. Genomics 13(7), 1\u201313 (2020)","journal-title":"BMC Med. Genomics"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Kocabas, O., Soyata, T.: Towards privacy-preserving medical cloud computing using homomorphic encryption. In: Virtual and Mobile Healthcare: Breakthroughs in Research and Practice, pp. 93\u2013125. IGI Global (2020)","DOI":"10.4018\/978-1-5225-9863-3.ch005"},{"key":"2_CR25","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 (ICML), pp. 12403\u201312422. PMLR (2022)"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"30039","DOI":"10.1109\/ACCESS.2022.3159694","volume":"10","author":"JW Lee","year":"2022","unstructured":"Lee, J.W., et al.: Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10, 30039\u201330054 (2022)","journal-title":"IEEE Access"},{"key":"2_CR27","unstructured":"Lee, J.W., Lee, E., Kim, Y.S., No, J.S.: Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption. Cryptol. ePrint Arch., Technical report 2022\/532 (2022)"},{"key":"2_CR28","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":"2_CR29","doi-asserted-by":"crossref","unstructured":"Lee, Y., Lee, J.W., Kim, Y.S., Kang, H., No, J.S.: High-precision and low-complexity approximate homomorphic encryption by error variance minimization. In: EUROCRYPT 2022, pp. 551\u2013580. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-06944-4_19"},{"key":"2_CR30","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-57048-8_6","volume-title":"Tutorials on the Foundations of Cryptography","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: How to simulate it \u2013 a tutorial on the simulation proof technique. In: Tutorials on the Foundations of Cryptography. ISC, pp. 277\u2013346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.future.2022.03.033","volume":"134","author":"S Meftah","year":"2022","unstructured":"Meftah, S., Tan, B.H.M., Aung, K.M.M., Yuxiao, L., Jie, L., Veeravalli, B.: Towards high performance homomorphic encryption for inference tasks on CPU: an MPI approach. Future Gener. Comput. Syst. 134, 13\u201321 (2022)","journal-title":"Future Gener. Comput. Syst."},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Mono, J., Marcolla, C., Land, G., G\u00fcneysu, T., Aaraj, N.: Finding and evaluating parameters for BGV. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 2023. LNCS, vol. 14064, pp. 370\u2013394. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_16","DOI":"10.1007\/978-3-031-37679-5_16"},{"issue":"6","key":"2_CR33","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8736-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:15Z","timestamp":1765933335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8736-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987351","9789819987368"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8736-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","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":"Guangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"106","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":"0","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":"28% - 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":"12","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}