Enhanced CKKS Bootstrapping with Generalized Polynomial Composites Approximation

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

3

초록

Bootstrapping in approximate homomorphic encryption involves evaluating the modular reduction function. Traditional methods decompose the modular reduction function into three components: scaled cosine, double-angle formula, and inverse sine. While these approaches offer a strong trade-off between computational cost and level consumption, they lack flexibility in parameterization. In this work, we propose a new method to decompose the modular reduction function with improved parameterization, generalizing prior trigonometric approaches. Numerical experiments demonstrate that our method achieves near-optimal approximation errors. Additionally, we introduce a technique that integrates the rescaling operation into matrix operations during bootstrapping, further reducing computational overhead.

키워드

Bootstrapping; CKKS; Cheon-Kim-Kim-Song; Homomorphic Encryption
제목
Enhanced CKKS Bootstrapping with Generalized Polynomial Composites Approximation
저자
Min, Seonhong; Lee, Joon-Woo; Song, Yongsoo
DOI
10.1145/3708821.3710824
발행일
2025-08
유형
Proceedings Paper
저널명
Proceedings of the ACM Conference on Computer and Communications Security
페이지
1 ~ 12

파일 다운로드

Thumbnail