A Tensor Compiler with Automatic Data Packing for Simple and Efficient Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) enables computing on encrypted data, letting clients securely offload computation to untrusted servers. While enticing, FHE has two key challenges that limit its applicability: it has high performance overheads (10,000× over unencrypted computation) and it is extre...
Main Authors: | Krastev, Aleksandar, Samardzic, Nikola, Langowski, Simon, Devadas, Srinivas, Sanchez, Daniel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2024
|
Online Access: | https://hdl.handle.net/1721.1/155458 |
Similar Items
-
BitPacker: Enabling High Arithmetic Efficiency in Fully Homomorphic Encryption Accelerators
by: Samardzic, Nikola, et al.
Published: (2024) -
Improved packing for fully homomorphic encryption with reverse multiplication friendly embeddings
by: Sim, Jun Jie
Published: (2024) -
Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
by: Xu, Kexin, et al.
Published: (2023) -
A Verified Compiler for a Functional Tensor Language
by: Liu, Amanda, et al.
Published: (2024) -
Formal Privacy Proof of Data Encoding: The Possibility and Impossibility of Learnable Encryption
by: Xiao, Hanshen, et al.
Published: (2025)