The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
HEAX: An Architecture for Computing on Encrypted Data
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 improvements. HEAX leverages multiple levels of parallelism, ranging from ciphertext-level to fine-grained modular arithmetic level. Our first contribution is a new highly-parallelizable architecture for number-theoretic transform (NTT) which can be of independent interest as NTT is frequently used in many lattice-based cryptography systems. Building on top of NTT engine, we design a novel architecture for computation on homomorphically encrypted data. Our implementation on reconfigurable hardware demonstrates 164-268× performance improvement for a wide range of FHE parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“In 2009, a new class of cryptosystems, called Fully Homo-morphic Encryption (FHE) [33], was introduced that allows arbitrary computation on encrypted data .”
BackgroundHomomorphic Encryption for Arithmetic of Approximate Numbers
Cheon, J. H., Kim, A., Kim, M., & Song, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70694-8_15 · Cited by 2,522 · cited 2×
“2 FHE Parameters and Security Guarantees The security guarantees of HEAX directly derives from the CKKS scheme [17] since the functionality of the scheme is not altered.”
MethodCloud Computing: Issues and Challenges
Dillon, T., Wu, C., & Chang, E. (2010) · 2010 24th IEEE International Conference on Advanced Information Networking and Applications · doi:10.1109/aina.2010.187 · Cited by 1,369
Research works printed but not linked: 50
- Badawi Ahmad Al, 2018, Chan Fook Mun, and Khin Mi Mi Aung
- Albrecht Martin R., 2016, Advances in Cryptology -- CRYPTO
- 10.1109/ICASSP.2005.1416247 · DOI
- Badawi Ahmad Al, 2019, Bharadwaj Veeravalli, and Kurt Rohloff.
- 10.46586/tches.v2018.i2.70-95 · DOI
- Bajard Jean-Claude, 2016, SAC 2016: 23rd Annual International Workshop on Selected Areas in Cryptography (Lecture Notes in Computer Science), Roberto Avanzi and Howard M. Heys (Eds.), 10532
- Barrett Paul, Advances in Cryptology -- CRYPTO'86 (Lecture Notes in Computer Science), Andrew M
- 10.1007/978-3-642-45239-0_4 · DOI · Paper page
- 10.1145/2090236.2090262 · DOI · Paper page
- 10.1109/FOCS.2011.12 · DOI · Paper page
- Cao Xiaolin, 2013, Accelerating Fully Homomorphic Encryption over the Integers with Super-size Hardware Multiplier and Modular Reduction, IACR Cryptology ePrint Archive, 2013, 616
- 10.1007/978-3-662-44774-1_14 · DOI
- 10.1007/978-3-030-10970-7_16 · DOI · Paper page
- 10.1007/978-3-662-53887-6_1 · DOI · Paper page
- 10.1109/HPEC.2014.7040950 · DOI
- 10.1109/TETC.2016.2619669 · DOI
- Daemen Joan, The design of Rijndael: AES-the advanced encryption standard
- 10.1109/HPEC.2014.7041001 · DOI
- Dai Wei, Cryptography and Information Security in the Balkans, Enes Pasalic and Lars R
- Dathathri Roshan, 2018, Chet: Compiler and runtime for homomorphic evaluation of tensor programs. arXiv preprint arXiv:1810.00845 · arXiv
- 10.1007/978-3-662-48324-4_10 · DOI
- 10.1109/DSD.2013.108 · DOI
- Doröz Yarkn, 2014, Accelerating fully homomorphic encryption in hardware, IEEE Trans. Comput., 64, 1509
- 10.1016/j.micpro.2014.06.003 · DOI
- Gentry Craig, 2011, Annual international conference on the theory and applications of cryptographic techniques. Springer, 129--148
- Gilad-Bachrach Ran, 2016, International Conference on Machine Learning. 201--210
- Halevi Shai, Topics in Cryptology -- CT-RSA 2019 (Lecture Notes in Computer Science)
- Hashim Shakirah, 2018, Accelerating Integer Based Fully Homomorphic Encryption Using Frequency Domain Multiplication. In International Conference on Information and Communications Security. Springer, 161--176
- Heiser Jay, 2008, Assessing the security risks of cloud computing. Gartner report 27
- 10.1109/ReConFig.2015.7393335 · DOI
- 10.1145/3243734.3243837 · DOI · Paper page
- Glenn Gulak Alhassan, 2019, Homomorphic processing unit (HPU) for accelerating secure computations under homomorphic encryption, US Patent App., 10, 385
- 10.1109/TC.2015.2500576 · DOI
- Kim Andrey, 2018, Logistic regression model training based on the approximate homomorphic encryption. BMC Medical Genomics 11, 4 (11
- 10.1007/978-3-319-48965-0_8 · DOI · Paper page
- 10.1145/2213977.2214086 · DOI · Paper page
- 10.1145/3126558 · DOI
- 10.1109/SiPS.2014.6986063 · DOI
- 10.1109/TC.2016.2574340 · DOI
- Öztürk Erdinç, 2015, Accelerating Somewhat Homomorphic Evaluation using FPGAs, IACR Cryptology ePrint Archive, 2015, 294
- 10.1007/978-3-662-48324-4_8 · DOI
- Roy Sujoy Sinha, 2015, International Workshop on Cryptographic Hardware and Embedded Systems. Springer, 164--184
- Roy Sujoy Sinha, 2018, HEPCloud: An FPGA-based multicore processor for FV somewhat homomorphic function evaluation, IEEE Trans. Comput., 67, 1637
- Roy Sujoy Sinha, 2019, FPGA-Based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data. In 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 387--398
- 10.1016/j.jnca.2010.07.006 · DOI · Paper page
- Chen Zhilu, 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2800--2803
- 10.1109/HPEC.2012.6408660 · DOI
- 10.1109/TC.2013.154 · DOI
- 10.1109/ISCAS.2013.6572408 · DOI
- 10.1109/TVLSI.2013.2281786 · DOI
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Samardzic, N., Feldmann, A., Krastev, A., Devadas, S., Dreslinski, R., Peikert, C., & Sanchez, D. (2021) · MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3466752.3480070 · Cited by 294
The Future of FPGA Acceleration in Datacenters and the Cloud
Bobda, C., Mbongue, J. M., Chow, P., Ewais, M., Tarafdar, N., Vega, J. C., Eguro, K., Koch, D., Handagala, S., Leeser, M., et al. (2022) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3506713 · Cited by 158
Privacy-Preserving Deep Learning Based on Multiparty Secure Computation: A Survey
Zhang, Q., Xin, C., & Wu, H. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3058638 · Cited by 53
Metadata
- Authors
- Riazi, M. S., Laine, K., Pelton, B., & Dai, W.
- Venue
- Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems
- Publisher
- ACM
- Published
- 2020-03-09
- Pages
- 1295-1309
- OpenAlex
- W3012235108
- Cited by
- 243
- References
- 3
- FWCI
- 13.00
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: HEAX: An Architecture for Computing on Encrypted Data. https://app.cochat.ai/papers/10.1145/3373376.3378523
- The paper
- Riazi, M. S., Laine, K., Pelton, B., & Dai, W. (2020). HEAX: An Architecture for Computing on Encrypted Data. Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. https://doi.org/10.1145/3373376.3378523
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.