HEAX: An Architecture for Computing on Encrypted Data
M. Sadegh Riazi, Kim Laine, Blake Pelton, Wei Dai

TL;DR
HEAX is a specialized hardware architecture designed to significantly accelerate Fully Homomorphic Encryption computations, enabling practical use of encrypted data processing with high performance improvements.
Contribution
The paper introduces a novel highly-parallelizable hardware architecture for FHE, including an innovative NTT engine and techniques for end-to-end pipelined design and memory reduction.
Findings
Achieves 164-268x performance improvement over existing solutions
Provides a highly-parallelizable NTT architecture for cryptography
Demonstrates practical hardware implementation for FHE
Abstract
With the rapid increase in cloud computing, concerns surrounding data privacy, security, and confidentiality also have been increased significantly. Not only cloud providers are susceptible to internal and external hacks, but also in some scenarios, data owners cannot outsource the computation due to privacy laws such as GDPR, HIPAA, or CCPA. Fully Homomorphic Encryption (FHE) is a groundbreaking invention in cryptography that, unlike traditional cryptosystems, enables computation on encrypted data without ever decrypting it. However, the most critical obstacle in deploying FHE at large-scale is the enormous computation overhead. In this paper, we present HEAX, a novel hardware architecture for FHE that achieves unprecedented performance improvement. HEAX leverages multiple levels of parallelism, ranging from ciphertext-level to fine-grained modular arithmetic level. Our first…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Coding theory and cryptography · Cryptographic Implementations and Security
