Accelerating Fully Homomorphic Encryption by Bridging Modular and Bit-Level Arithmetic

@article{Chielle2022AcceleratingFH,
  title={Accelerating Fully Homomorphic Encryption by Bridging Modular and Bit-Level Arithmetic},
  author={Eduardo Chielle and Oleg Mazonka and Homer Gamil and Michail Maniatakos},
  journal={ArXiv},
  year={2022},
  volume={abs/2204.12201}
}
The dramatic increase of data breaches in modern computing plat-forms has emphasized that access control is not sufficient to protect sensitive user data. Recent advances in cryptography allow end-to-end processing of encrypted data without the need for decryption using Fully Homomorphic Encryption (FHE). Such computation however, is still orders of magnitude slower than direct (unen-crypted) computation. Depending on the underlying cryptographic scheme, FHE schemes can work natively either at… 

REDsec: Running Encrypted DNNs in Seconds

This work looks to optimize FHE-based private machine learning inference by leveraging ternary neural networks, whose weights are constrained to {-1,0,1}, have special properties that they exploit in this work to operate efficiently in the homomorphic domain.

REDsec: Running Encrypted Discretized Neural Networks in Seconds

This work introduces the REDsec framework that optimizes FHE-based private machine learning inference by leveraging ternary neural networks, and introduces novel features, including a new data re-use scheme that enables bidirectional bridging between the integer and binary domains for the first time in FHE.

References

SHOWING 1-10 OF 55 REFERENCES

Cryptoleq: A Heterogeneous Abstract Machine for Encrypted and Unencrypted Computation

This paper introduces Cryptoleq: an abstract machine based on the concept of one instruction set computer, capable of performing general-purpose computation on encrypted programs, and compares its performance against a popular fully homomorphic encryption library.

Bootstrapping for Approximate Homomorphic Encryption

This paper proposes a new technique to refresh low-level ciphertexts based on Gentry’s bootstrapping procedure and exploits a scaled sine function as an approximation of the modular reduction operation and presents an efficient evaluation strategy.

CoPHEE: Co-processor for Partially Homomorphic Encrypted Execution

This paper reports on a year-long effort to design, implement, fabricate, and validate CoPHEE: a novel co-processor design that mitigates data leakage risks using partially homomorphic encrypted execution.

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption

F1 is the first system to accelerate complete FHE programs, and outperforms state-of-the-art software implementations by gmean 5,400 × and by up to 17,000 ×, to counter most of FHE’s overheads and enable new applications, like real-time private deep learning in the cloud.

E3: A Framework for Compiling C++ Programs with Encrypted Operands

This work proposes a framework which allows optimal, in terms of performance, execution of standard C++ code with encrypted variables, and automatically generates protected types so the programmer can remain oblivious to the underlying encryption scheme.

(Leveled) fully homomorphic encryption without bootstrapping

A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).

Fully homomorphic encryption using ideal lattices

This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.

ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY

ALCHEMY is introduced, a modular and extensible system that simplifies and accelerates the use of FHE, and fast homomorphic evaluation of a pseudorandom function~(PRF) based on Ring-LWR, whose entire implementation is only a few dozen lines of simple DSL code.

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

A new method to homomorphically compute simple bit operations, and refresh (bootstrap) the resulting output, which runs on a personal computer in just about half a second, and is presented on the performance of the prototype implementation.

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

A new tensoring technique for LWE-based fully homomorphic encryption that uses the same modulus throughout the evaluation process no need for "modulus switching", and this modulus can take arbitrary form.
...