Simpler and Faster BFV Bootstrapping for Arbitrary Plaintext Modulus from CKKS
Jaehyung Kim, Jinyeong Seo, Yongsoo Song
2024Year
16Citations
2Top-tier citations
Abstract
Bootstrapping is currently the only known method for constructing fully homomorphic encryptions. In the BFV scheme specifically, bootstrapping aims to reduce the error of a ciphertext while preserving the encrypted plaintext. The existing BFV bootstrapping methods follow the same pipeline, relying on the evaluation of a digit extraction polynomial to annihilate the error located in the least significant digits. However, due to its strong dependence on performance, bootstrapping could only utilize a limited form of plaintext modulus, such as a power of a small prime number.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers2
- Leveraging Discrete CKKS to Bootstrap in High PrecisionHyeongmin Choe, Jaehyung Kim, Damien Stehlé, Elias SuvantoCCS 2025
- Grafting: Decoupled Scale Factors and Modulus in RNS-CKKSJung Hee Cheon, Hyeongmin Choe, Minsik Kang, Jaehyung Kim et al.CCS 2025
Related papers
- Homomorphic Multiple Precision Multiplication for CKKS and Reduced Modulus ConsumptionJung Hee Cheon, Wonhee Cho, Jaehyung Kim, Damien StehléCCS 2023 · 13 citations
- On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic EncryptionRobin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik VercauterenEUROCRYPT 2023 · 25 citations
- HALO: Loop-aware Bootstrapping Management for Fully Homomorphic EncryptionSeonyoung Cheon, Yongwoo Lee, Hoyun Youm, Dongkwan Kim et al.ASPLOS 2025 · 3 citations
- Accelerating BGV Bootstrapping for Large p Using Null Polynomials over Shihe Ma, Tairong Huang, Anyu Wang, Xiaoyun WangEUROCRYPT 2024 · 16 citations
- META-BTS: Bootstrapping Precision Beyond the LimitYoungjin Bae, Jung Hee Cheon, Wonhee Cho, Jaehyung Kim et al.CCS 2022 · 36 citations
