{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:02:48Z","timestamp":1780588968200,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["RS-2025-02217656"],"award-info":[{"award-number":["RS-2025-02217656"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1145\/3779208.3785268","type":"proceedings-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:21:58Z","timestamp":1780586518000},"page":"1387-1398","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Lightweight CKKS: On Client Cost Efficiency"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7085-2220","authenticated-orcid":false,"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, Republic of Korea and CryptoLab Inc., Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2125-5043","authenticated-orcid":false,"given":"Minsik","family":"Kang","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5401-8949","authenticated-orcid":false,"given":"Jai Hyun","family":"Park","sequence":"additional","affiliation":[{"name":"CryptoLab Inc., Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2024. Lattigo v6. Online: https:\/\/github.com\/tuneinsight\/lattigo. EPFL-LDS Tune Insight SA."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560827.3563379"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58723-8_4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Jean-Philippe Bossuat Rosario Cammarota Ilaria Chillotti Benjamin R Curtis Wei Dai Huijing Gong Erin Hales Duhyeong Kim Bryan Kumara Changmin Lee et al. 2024. Security guidelines for implementing homomorphic encryption. Available at http:\/\/eprint.iacr.org\/2024\/463.","DOI":"10.62056\/anxra69p1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77870-5_21"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Z. Brakerski. 2012. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In CRYPTO. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"I. Chillotti N. Gama M. Georgieva and M. Izabach\u00e8ne. 2017. Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE. In ASIACRYPT. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_14","DOI":"10.1007\/978-3-319-70694-8_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Jean-S\u00e9bastien Coron Avradip Mandal David Naccache and Mehdi Tibouchi. 2011. Fully homomorphic encryption over the integers with shorter public keys. In CRYPTO. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_28","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"e_1_3_2_1_13_1","unstructured":"CryptoLab. 2022. HEaaN Library. Available at https:\/\/heaan.it\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338469.3358940"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"e_1_3_2_1_16_1","unstructured":"J. Fan and F. Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Available at http:\/\/eprint.iacr.org\/2012\/144."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-130480"},{"key":"e_1_3_2_1_18_1","unstructured":"Shai Halevi and Victor Shoup. 2020. Design and implementation of HElib: a homomorphic encryption library. Available at https:\/\/github.com\/homenc\/HElib."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-40186-3_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_1_21_1","volume-title":"International Conference on Machine Learning. PMLR, 12403\u201312422","author":"Lee Eunsang","year":"2022","unstructured":"Eunsang Lee, Joon-Woo Lee, Junghyun Lee, Young-Sik Kim, Yongjune Kim, Jong-Seon No, and Woosuk Choi. 2022. Low-complexity deep convolutional neural networks on fully homomorphic encryption using multiplexed parallel convolutions. In International Conference on Machine Learning. PMLR, 12403\u201312422. https:\/\/proceedings.mlr.press\/v162\/lee22e.html"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8736-8_2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky C. Peikert and O. Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2025.i4.763-794"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37679-5_16"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"D. Stehl\u00e9 R. Steinfeld K. Tanaka and K. Xagawa. 2009. Efficient Public Key Encryption Based on Ideal Lattices. In ASIACRYPT. https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36","DOI":"10.1007\/978-3-642-10366-7_36"}],"event":{"name":"ASIA CCS '26: ACM Asia Conference on Computer and Communications Security","location":"Bangalore India","acronym":"ASIA CCS '26","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3779208.3785268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:29:28Z","timestamp":1780586968000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3779208.3785268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":26,"alternative-id":["10.1145\/3779208.3785268","10.1145\/3779208"],"URL":"https:\/\/doi.org\/10.1145\/3779208.3785268","relation":{},"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"2026-06-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}