{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:34:57Z","timestamp":1767321297748,"version":"3.48.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","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-10536-3_24","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:24Z","timestamp":1767321144000},"page":"647-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Downlink (T)FHE Ciphertexts Compression"],"prefix":"10.1007","author":[{"given":"Antonina","family":"Bondarchuk","sequence":"first","affiliation":[]},{"given":"Olive","family":"Chakraborty","sequence":"additional","affiliation":[]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[]},{"given":"Renaud","family":"Sirdey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Representing hard lattices with $$o(n \\log n)$$ bits. In: STOC, pp. 94\u2013103 (2005)","DOI":"10.1145\/1060590.1060604"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: EUROCRYPT, pp. 430\u2013454 (2015)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., et\u00a0al.: Feistel structures for MPC, and more. In: ESORICS, pp. 151\u2013171 (2019)","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: CRYPTO, pp. 297\u2013314 (2014)","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Costache, A., Guimar\u00e3es, A., Soria-Vazquez, E.: HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical. In: ASIACRYPT, pp. 302\u2013334 (2024)","DOI":"10.1007\/978-981-96-0935-2_10"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Bae, Y., et\u00a0al.: HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering. In: CRYPTO, pp. 37\u201369 (2023)","DOI":"10.1007\/978-3-031-38551-3_2"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Bendoukha, A., Boudguiga, A., Sirdey, R.: Revisiting stream-cipher-based homomorphic transciphering in the TFHE era. In: FPS. pp. 19\u201333 (2021)","DOI":"10.1007\/978-3-031-08147-7_2"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Bendoukha, A., Clet, P., Boudguiga, A., Sirdey, R.: Optimized stream-cipher-based transciphering by means of functional-bootstrapping. In: DBSec, pp. 91\u2013109 (2023)","DOI":"10.1007\/978-3-031-37586-6_6"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Boura, C., et\u00a0al.: CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes. J. Math. Cryptol., 316\u2013338 (2020)","DOI":"10.1515\/jmc-2019-0026"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: CRYPTO, pp. 868\u2013886 (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: PKC, pp. 1\u201313 (2013)","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325 (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: ITCS, pp. 1\u201312 (2014)","DOI":"10.1145\/2554797.2554799"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., et\u00a0al.: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles. In: TCC, pp. 407\u2013437 (2019)","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., et\u00a0al.: Constant ciphertext-rate non-committing encryption from standard assumptions. In: TCC, pp. 58\u201387 (2020)","DOI":"10.1007\/978-3-030-64375-1_3"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Bresson, E., et\u00a0al.: A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In: ASIACRYPT, pp. 37\u201354 (2003)","DOI":"10.1007\/978-3-540-40061-5_3"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Canteaut, A., et\u00a0al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol., 885\u2013916 (2018)","DOI":"10.1007\/s00145-017-9273-9"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Checri, M., Sirdey, R., Boudguiga, A., Bultel, J.P.: On the practical CPAD security of \u201cexact\u201d and threshold FHE schemes. In: CRYPTO, pp. 3\u201333 (2024)","DOI":"10.1007\/978-3-031-68382-4_1"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Chen, H., Chillotti, I., Ren, L.: Onion ring ORAM: efficient constant bandwidth oblivious RAM from (leveled) TFHE. In: CCS, pp. 345\u2013360 (2019)","DOI":"10.1145\/3319535.3354226"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient homomorphic conversion between (ring) LWE ciphertexts. In: ACNS, pp. 460\u2013479 (2021)","DOI":"10.1007\/978-3-030-78372-3_18"},{"key":"24_CR22","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: CCS, pp. 2505\u20132519 (2024)","DOI":"10.1145\/3658644.3690341"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT, pp. 409\u2013437 (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"24_CR24","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption library, August 2016. https:\/\/tfhe.github.io\/tfhe\/"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Chillotti, I., et\u00a0al.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: ASIACRYPT, pp. 3\u201333 (2016)","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Clet, P.E., Boudguiga, A., Sirdey, R., Zuber, M.: ComBo: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain. In: AFRICACRYPT, pp. 317\u2013343 (2023)","DOI":"10.1007\/978-3-031-37679-5_14"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: EUROCRYPT, pp. 45\u201364 (2002)","DOI":"10.1007\/3-540-46035-7_4"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Groth, J., Salomonsen, G.: The theory and implementation of an electronic voting system. In: Secure Electronic Voting, pp. 77\u201398 (2003)","DOI":"10.1007\/978-1-4615-0239-5_6"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., et\u00a0al.: Pasta: a case for hybrid homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst., 30\u201373 (2023)","DOI":"10.46586\/tches.v2023.i3.30-73"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"D\u00e5mgard, I., Jurik, M., Nielsen, J.B.: A generalization of Paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Sec., 371\u2013385 (2010)","DOI":"10.1007\/s10207-010-0119-9"},{"key":"24_CR31","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. In: IACR Cryptol. ePrint Arch., Paper 2012\/144 (2012)"},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO, pp. 75\u201392 (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., M\u00e9aux, P., Ricosset, T.: Transciphering, using FiLIP and TFHE for an efficient delegation of computation. In: INDOCRYPT, pp. 39\u201361 (2020)","DOI":"10.1007\/978-3-030-65277-7_3"},{"key":"24_CR34","unstructured":"Huang, Z., Lu, W., Hong, C., Ding, J.: Cheetah: lean and fast secure two-party deep neural network inference. In: USENIX, pp. 809\u2013826 (2022)"},{"key":"24_CR35","unstructured":"Mahdavi, R.A., Diaa, A., Kerschbaum, F.: HE is all you need: compressing FHE ciphertexts using additive HE (2024). https:\/\/arxiv.org\/abs\/2303.09043"},{"key":"24_CR36","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: EUROCRYPT, pp. 311\u2013343 (2016)","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"24_CR37","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., et\u00a0al.: Improved filter permutators for efficient FHE: better instances and implementations. In: INDOCRYPT, pp. 68\u201391 (2019)","DOI":"10.1007\/978-3-030-35423-7_4"},{"key":"24_CR38","doi-asserted-by":"crossref","unstructured":"Menezes, A.: Elliptic Curve Public Key Cryptosystems, vol. 234. Springer, New York (1993)","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"24_CR39","doi-asserted-by":"crossref","unstructured":"Mukherjee, P., Wichs, D.: Two round multiparty computation via multi-key FHE. In: EUROCRYPT, pp. 735\u2013763 (2016)","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"24_CR40","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K.E., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: CCSW, pp. 113\u2013124 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"24_CR41","doi-asserted-by":"crossref","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of Paillier: homomorphic secret sharing and public-key silent OT. In: EUROCRYPT, pp. 678\u2013708 (2021)","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"24_CR42","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT, pp. 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"24_CR43","doi-asserted-by":"crossref","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: CRYPTO, pp. 554\u2013571 (2008)","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"24_CR44","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"24_CR45","doi-asserted-by":"crossref","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: CRYPTO, pp. 687\u2013717 (2021)","DOI":"10.1007\/978-3-030-84252-9_23"},{"key":"24_CR46","doi-asserted-by":"crossref","unstructured":"Trama, D., Clet, P.E., Boudguiga, A., Sirdey, R.: Designing a general-purpose 8-bit (T)FHE processor abstraction. Tr. Cr. Hardw. Emb. Syst., 535\u2013578 (2025)","DOI":"10.46586\/tches.v2025.i2.535-578"},{"key":"24_CR47","doi-asserted-by":"crossref","unstructured":"Trama, D., Clet, P., Boudguiga, A., Sirdey, R.: A homomorphic AES evaluation in less than 30 seconds by means of TFHE. In: WAHC, pp. 79\u201390 (2023)","DOI":"10.1145\/3605759.3625260"},{"key":"24_CR48","unstructured":"Xu, T., Li, M., Wang, R.: Hequant: Marrying homomorphic encryption and quantization for communication-efficient private inference. CoRR (2024)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:27Z","timestamp":1767321147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_24","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":"2 January 2026","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":"Toronto, ON","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}