{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T14:57:00Z","timestamp":1786373820303,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032353733","type":"print"},{"value":"9783032353740","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-35374-0_18","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:50:20Z","timestamp":1786369820000},"page":"558-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Batch Matrix Multiplication in\u00a0Ciphertexts"],"prefix":"10.1007","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minsik","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"18_CR1","unstructured":"OpenBLAS: An optimized BLAS library (2025). version 0.3.30 https:\/\/www.openblas.net\/"},{"issue":"3","key":"18_CR2","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. Cryptology 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptology"},{"key":"18_CR3","doi-asserted-by":"crossref","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: Annual International Cryptology Conference, pp. 387\u2013421. Springer (2024)","DOI":"10.1007\/978-3-031-68382-4_12"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bae, Y., Cheon, J.H., Hanrot, G., Park, J.H., Stehl\u00e9, D.: Fast homomorphic linear algebra with blas (2025). arXiv preprint arXiv:2503.16080","DOI":"10.1007\/s00145-026-09580-x"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bae, Y., Cheon, J.H., Kim, J., Park, J.H., Stehl\u00e9, D.: Hermes: efficient ring packing using MLWE ciphertexts and application to transciphering. In: Annual International Cryptology Conference, pp. 37\u201369. Springer (2023)","DOI":"10.1007\/978-3-031-38551-3_2"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Cha, H., Hwang, I., Min, S., Seo, J., Song, Y.: Matrigear: accelerating authenticated matrix triple generation with scalable prime fields via optimized he packing. In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 2453\u20132471. IEEE (2025)","DOI":"10.1109\/SP61157.2025.00174"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Chillotti, I., Song, Y.: Improved bootstrapping for approximate homomorphic encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 34\u201354. Springer (2019)","DOI":"10.1007\/978-3-030-17656-3_2"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient homomorphic conversion between (ring) LWE ciphertexts. In: International Conference on Applied Cryptography and Network Security, pp. 460\u2013479. Springer (2021)","DOI":"10.1007\/978-3-030-78372-3_18"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Yang, L., Wu, W., Liu, Y., Feng, Y.: Homomorphic matrix operations under bicyclic encoding. IEEE Trans. Inf. Forensics Secur. (2024)","DOI":"10.1109\/TIFS.2024.3490862"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 409\u2013437. Springer (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"18_CR11","unstructured":"Cheon, J.H., Kim, A., Yhee, D.: Multi-dimensional packing for heaan for approximate matrix arithmetics. Cryptology ePrint Archive (2018)"},{"key":"18_CR12","unstructured":"CryptoLab: HEaaN library (2022). https:\/\/heaan.it\/"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Froelicher, D., et al.: Scalable and privacy-preserving federated principal component analysis. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 1908\u20131925. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179350"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Gao, J., Gao, Y.: GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication. J. Supercomput. 80(18) (2024)","DOI":"10.1007\/s11227-024-06449-3"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Gao, Y., Quan, G., Homsi, S., Wen, W., Wang, L.: Secure and efficient general matrix multiplication on cloud using homomorphic encryption. J. Supercomput. 80(18) (2024)","DOI":"10.1007\/s11227-024-06428-8"},{"key":"18_CR16","unstructured":"Gentry, C., Lee, Y.: Fully homomorphic encryption for matrix arithmetic. IACR eprint (2025). http:\/\/eprint.iacr.org\/2012\/144"},{"key":"18_CR17","unstructured":"Halevi, S., Shoup, V.: Design and implementation of HElib: a homomorphic encryption library. IACR eprint (2020). https:\/\/eprint.iacr.org\/2020\/1481"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"57361","DOI":"10.1109\/ACCESS.2019.2913850","volume":"7","author":"K Han","year":"2019","unstructured":"Han, K., Hhan, M., Cheon, J.H.: Improved homomorphic discrete Fourier transforms and FHE bootstrapping. IEEE Access 7, 57361\u201357370 (2019)","journal-title":"IEEE Access"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"15718","DOI":"10.52202\/068431-1143","volume":"35","author":"M Hao","year":"2022","unstructured":"Hao, M., et al.: Iron: private inference on transformers. Adv. Neural. Inf. Process. Syst. 35, 15718\u201315731 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"18_CR20","unstructured":"Henzinger, A., Hong, M.M., Corrigan-Gibbs, H., Meiklejohn, S., Vaikuntanathan, V.: One server for the price of two: simple and fast $$\\{$$Single-Server$$\\}$$ private information retrieval. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 3889\u20133905 (2023)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Huang, Z., Hong, C., Weng, C., Lu, W.J., Qu, H.: More efficient secure matrix multiplication for unbalanced recommender systems. IEEE Trans. Dependable Secure Comput. 20(1), 551\u2013562 (2021)","DOI":"10.1109\/TDSC.2021.3139318"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Jang, J., et al.: Privacy-preserving deep sequential model with matrix homomorphic encryption. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, pp. 377\u2013391 (2022)","DOI":"10.1145\/3488932.3523253"},{"key":"18_CR23","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, pp. 1209\u20131222 (2018)","DOI":"10.1145\/3243734.3243837"},{"key":"18_CR24","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"},{"issue":"3","key":"18_CR25","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"18_CR26","doi-asserted-by":"crossref","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. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 36\u201368. Springer (2023)","DOI":"10.1007\/978-981-99-8736-8_2"},{"key":"18_CR27","first-page":"9459","volume":"33","author":"P Lewis","year":"2020","unstructured":"Lewis, P., et al.: Retrieval-augmented generation for knowledge-intensive NLP tasks. Adv. Neural. Inf. Process. Syst. 33, 9459\u20139474 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Li, B., Micciancio, D., Raykova, M., Schultz-Wu, M.: Hintless single-server private information retrieval. In: Annual International Cryptology Conference, pp. 183\u2013217. Springer (2024)","DOI":"10.1007\/978-3-031-68400-5_6"},{"key":"18_CR29","unstructured":"Lim, L., Kalagi, V., Agrawal, D., El Abbadi, A.: Tricycle: private transformer inference with tricyclic encodings. Cryptology ePrint Archive (2025)"},{"issue":"3","key":"18_CR30","first-page":"2059","volume":"16","author":"J Liu","year":"2022","unstructured":"Liu, J., Zhang, L.F.: Privacy-preserving and publicly verifiable matrix multiplication. IEEE Trans. Serv. Comput. 16(3), 2059\u20132071 (2022)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"18_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2023.103658","volume":"138","author":"X Ma","year":"2024","unstructured":"Ma, X., Ma, C., Jiang, Y., Ge, C.: Improved privacy-preserving PCA using optimized homomorphic matrix multiplication. Comput. Secur. 138, 103658 (2024)","journal-title":"Comput. Secur."},{"key":"18_CR32","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"},{"key":"18_CR33","unstructured":"Menon, S.J., Wu, D.J.: YPIR: High-throughput single-server pir with silent preprocessing. In: 33rd USENIX Security Symposium (USENIX Security 24), pp. 5985\u20136002 (2024)"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Pang, Q., Zhu, J., M\u00f6llering, H., Zheng, W., Schneider, T.: Bolt: privacy-preserving, accurate and efficient inference for transformers. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 4753\u20134771. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00130"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Park, J.H.: Ciphertext-ciphertext matrix multiplication: fast for large matrices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 153\u2013180. Springer (2025)","DOI":"10.1007\/978-3-031-91101-9_6"},{"issue":"6","key":"18_CR36","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/PROC.1968.6477","volume":"56","author":"CM Rader","year":"1968","unstructured":"Rader, C.M.: Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE 56(6), 1107\u20131108 (1968)","journal-title":"Proc. IEEE"},{"key":"18_CR37","unstructured":"Radford, A., Narasimhan, K., Salimans, T., Sutskever, I.: Improving language understanding by generative pre-training (2018)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Rizomiliotis, P., Triakosia, A.: On matrix multiplication with homomorphic encryption. In: Proceedings of the 2022 on Cloud Computing Security Workshop, pp. 53\u201361 (2022)","DOI":"10.1145\/3560810.3564267"},{"key":"18_CR39","unstructured":"The FLINT team: FLINT: Fast Library for Number Theory (2025). version 3.3.1, https:\/\/flintlib.org"},{"key":"18_CR40","unstructured":"Touvron, H., et al.: Llama: open and efficient foundation language models (2023). arXiv preprint arXiv:2302.13971"},{"key":"18_CR41","unstructured":"Touvron, H., et al.: Llama 2: Open foundation and fine-tuned chat models (2023). arXiv preprint arXiv:2307.09288"},{"key":"18_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: Secure transformer inference made non-interactive. Cryptology ePrint Archive (2024)","DOI":"10.14722\/ndss.2025.230868"},{"key":"18_CR43","unstructured":"Zheng, X., Li, H., Wang, D.: A new framework for fast homomorphic matrix multiplication. Cryptology ePrint Archive (2023)"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Zhu, L., Hua, Q.S., Chen, Y., Jin, H.: Secure outsourced matrix multiplication with fully homomorphic encryption. In: European Symposium on Research in Computer Security, pp. 249\u2013269. Springer (2023)","DOI":"10.1007\/978-3-031-50594-2_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35374-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:50:30Z","timestamp":1786369830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35374-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032353733","9783032353740"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35374-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"11 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}