EVA Improved

Chowdhary, Sangeeta; Dai, Wei; Laine, Kim; Saarikivi, Olli

doi:10.1145/3474366.3486929

Cited by 11 publications

(4 citation statements)

References 19 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%

“…Remark on DSL: By explicitly defining domain-specific lexica, DSL-based FHE compiler frameworks [23,58,62] permit simpler compiler designs as FHE-specific operators can be directly embedded into the target program. However, coding over DSLs can be as challenging as that directly over FHE primitives [53], for choosing the correct domain-specific lexica still requires a deep understanding of fundamental FHE mechanics.…”

Section: B Related Workmentioning

confidence: 99%

“…The key advantage of directly employing Polygeist is that generic program optimizations can be decoupled with the subsequent FHE-specific transformations and optimizations. Consequently, different from existing FHE compilers like [62], we do not need to manually re-implement generic program optimizations such as common sub-expression elimination (CSE) and dead-code elimination and maximize the utilization of the existing tools.…”

Section: Heir Frameworkmentioning

confidence: 99%

“…The biggest challenge here is the parameter selection for different FHE schemes. At its current state, automatic parameter selection strategies in existing compilers [23,24,62] are designed for leveled homomorphic encryption schemes.…”

Section: ) Transformations and Optimizations In Heirmentioning

confidence: 99%

See 3 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