Unlocking the Potential of Fully Homomorphic Encryption

Gorantala, Shruthi; Springer, Rob; Gipson, Bryant

doi:10.1145/3572832

Cited by 13 publications

(8 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Throughout the evaluation, we mainly focus on comparing the effectiveness and performance of the proposed HEIR architecture. We mainly compare our HEIR framework with the state-of-the-art arithmetic-circuit and logic-circuit FHE compilers, i.e., EVA [23,62], HECO [58] and Transpiler [21].…”

Section: Discussionmentioning

confidence: 99%

“…Logic-Circuit FHE Compilers: Based on various optimizations in bootstrapping [18,66], FHE compilers over logic circuits start to emerge as alternatives for general program compilation. We see a line of works [8,21,22,52] that adopt circuit synthesis techniques to compile programs written in Verilog [22] or C [8,21] into equivalent homomorphic circuits over logic gates (or instructions over logic circuits in the case of [8]). Since programs can be easily transformed into Boolean circuits, some logic-circuit FHE compilers, e.g.…”

Section: B Related Workmentioning

confidence: 99%

“…Since programs can be easily transformed into Boolean circuits, some logic-circuit FHE compilers, e.g. Transpiler [21], are functionally complete and readily deployable. However, we point out that many existing logic FHE compilers are functionally incomplete as well.…”

Section: B Related Workmentioning

confidence: 99%

“…For instance, as shown in Table I, existing compilers such as EVA [23] and HECO [58], which mainly focus on optimizing arithmetic FHE, only supports operations on RLWE ciphertext and do not accommodate non-polynomial function evaluations. Similarly compilers like Transpiler [21] decompose all input data into Boolean representations and implement every arithmetic operation using logic circuit, which is clearly inefficient. To enable hybrid-circuit FHE, the compiler needs a unified IR infrastructure to correctly identify the lowering layers and perform key optimization passes.…”

Section: A Problem Formulation and Challengesmentioning

confidence: 99%

“…To avoid being restricted to polynomial functions, a different FHE compilation approach explores how logic synthesis and instruction set architecture (ISA) designs can be used to convert plaintext programs directly into executable programs over FHE ciphertexts [8,21,22]. Although logic FHE compilation can effectively handle programs that contain both polynomial and non-polynomial functions, the performance of homomorphic logic circuits can be unsatisfactory due to the lack of immediately deployable SIMD capability [21,22]. Besides, most existing FHE compilers leverage domain-specific language (DSL) to assist program compilation [23][24][25][26].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

HEIR: A Unified Representation for Cross-Scheme Compilation of Fully Homomorphic Computation

Bian,

Zhao,

Zhang

et al. 2024

Proceedings 2024 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

We propose a new compiler framework that automates code generation over multiple fully homomorphic encryption (FHE) schemes. While it was recently shown that algorithms combining multiple FHE schemes (e.g., CKKS and TFHE) achieve high execution efficiency and task utility at the same time, developing fast cross-scheme FHE algorithms for real-world applications generally require heavy hand-tuned optimizations by cryptographic experts, resulting in either high usability costs or low computational efficiency. To solve the usability and efficiency dilemma, we design and implement HEIR, a compiler framework based on multi-level intermediate representation (IR). To achieve cross-scheme compilation of efficient FHE circuits, we develop a two-stage code-lowering structure based on our custom IR dialects. First, the plaintext program along with the associated data types are converted into FHE-friendly dialects in the transformation stage. Then, in the optimization stage, we apply FHE-specific optimizations to lower the transformed dialect into our bottom-level FHE library operators. In the experiment, we implement the entire software stack for HEIR, and demonstrate that complex endto-end programs, such as homomorphic K-Means clustering and homomorphic data aggregation in databases, can easily be compiled to run 72-179× faster than the program generated by the state-of-the-art FHE compilers.

show abstract