The paper claims a compile-time vector encryption method for FHE using precomputed basis ciphertexts and a single randomized zero ciphertext, but the IND-CPA proof is invalid and the scheme is attackable when the randomizer is drawn from the plaintext modulus.
Fully homomorphic encryption using ideal lattices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CR 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Compile-Time Fully Homomorphic Encryption of Vectors: Eliminating Online Encryption via Algebraic Basis Synthesis
The paper claims a compile-time vector encryption method for FHE using precomputed basis ciphertexts and a single randomized zero ciphertext, but the IND-CPA proof is invalid and the scheme is attackable when the randomizer is drawn from the plaintext modulus.