Compile-Time Fully Homomorphic Encryption of Vectors: Eliminating Online Encryption via Algebraic Basis Synthesis

TL;DR

This paper introduces a compile-time ciphertext synthesis method for fully homomorphic encryption that eliminates online encryption, reduces memory overhead, and maintains security and compatibility with standard FHE operations.

Contribution

It presents a novel compile-time ciphertext synthesis framework that simplifies FHE operations by removing online encryption and reducing memory usage while ensuring security.

Findings

Eliminates online encryption in FHE systems

Reduces memory overhead by using a single zero ciphertext

Maintains security and compatibility with standard FHE features

Abstract

We propose a framework for compile-time ciphertext synthesis in fully homomorphic encryption (FHE) systems, where ciphertexts are constructed from precomputed encrypted basis vectors combined with a runtime-scaled encryption of zero. This design eliminates online encryption and instead relies solely on ciphertext-level additions and scalar multiplications, enabling efficient data ingestion and algebraic reuse. We formalize the method as a randomized $\mathbb{Z}_t$-module morphism and prove that it satisfies IND-CPA security under standard assumptions. The proof uses a hybrid game reduction, showing that adversarial advantage in distinguishing synthesized ciphertexts is negligible if the underlying FHE scheme is IND-CPA secure. Unlike prior designs that require a pool of random encryptions of zero, our construction achieves equivalent security using a single zero ciphertext multiplied by a fresh scalar at runtime, reducing memory overhead while preserving ciphertext randomness. The resulting primitive supports efficient integration with standard FHE APIs and maintains compatibility with batching, rotation, and aggregation, making it well-suited for encrypted databases, streaming pipelines, and secure compiler backends.