Ciphertext- and Polynomial-Level Optimization for Fully Homomorphic Encryption
Abstract
Fully homomorphic encryption (FHE) schemes such as RNS-CKKS enable privacy-preserving services by allowing direct computation on encrypted data. While recent FHE compilers optimize FHE programs, they operate at the coarse-grained ciphertext level, where each ciphertext operation comprises a sequence of polynomial operations. At this granularity, the compilers miss optimization opportunities across ciphertext operations. This work presents Recifhe, a new multi-level compiler that supports not only ciphertext-level but also polynomial-level optimization. At the ciphertext level, Recifhe transforms a non-FHE input program into an FHE program by inserting ciphertext management operations and applies global optimizations. At the polynomial level, Recifhe eliminates redundant polynomial computations across ciphertext operations. Recifhe achieves a 1.25x speedup over ciphertext-level-only optimization.
Cite
@article{arxiv.2607.15750,
title = {Ciphertext- and Polynomial-Level Optimization for Fully Homomorphic Encryption},
author = {Seongho Kim and Heelim Choi and Jaemin Kim and Seonyoung Cheon and Dongkwan Kim and Jaeho Lee and Hoyun Youm and Dongyoon Lee and Hanjun Kim and Yongwoo Lee},
journal= {arXiv preprint arXiv:2607.15750},
year = {2026}
}