The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
OpenFHE: Open-Source Fully Homomorphic Encryption Library
Open accessAbstract
Fully Homomorphic Encryption (FHE) is a powerful cryptographic primitive that enables performing computations over encrypted data without having access to the secret key. We introduce OpenFHE, a new open-source FHE software library that incorporates selected design ideas from prior FHE projects, such as PALISADE, HElib, and HEAAN, and includes several new design concepts and ideas. The main new design features can be summarized as follows: (1) we assume from the very beginning that all implemented FHE schemes will support bootstrapping and scheme switching; (2) OpenFHE supports multiple hardware acceleration backends using a standard Hardware Abstraction Layer (HAL); (3) OpenFHE includes both user-friendly modes, where all maintenance operations, such as modulus switching, key switching, and bootstrapping, are automatically invoked by the library, and compiler-friendly modes, where an external compiler makes these decisions. This paper focuses on high-level description of OpenFHE design, and the reader is pointed to external OpenFHE references for a more detailed/technical description of the software library.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Homomorphic 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
Self-citation(Leveled) Fully Homomorphic Encryption without Bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2633600 · Cited by 1,430
Self-citationFully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Brakerski, Z. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_50 · Cited by 1,252
Somewhat Practical Fully Homomorphic Encryption.
Fan, J., & Vercauteren, F. (2012) · Cited by 1,189
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
Self-citationFaster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_1 · Cited by 684
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
Self-citationBootstrapping for Approximate Homomorphic Encryption
Cheon, J. H., Han, K., Kim, A., Kim, M., & Song, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78381-9_14 · Cited by 373
Self-citationF1: 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
Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys
Bossuat, J.-P., Mouchet, C., Troncoso-Pastoriza, J., & Hubaux, J.-P. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-77870-5_21 · Cited by 176
Cited by
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
Lakhan, A., Groenli, T.-M., Wu, H., Younas, M., & Ghinea, G. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2024.3493452 · Cited by 8
Metadata
- Authors
- Al Badawi, A., Bates, J., Bergamaschi, F., Cousins, D. B., Erabelli, S., Genise, N., Halevi, S., Hunt, H., Kim, A., Lee, Y., Liu, Z., Micciancio, D., Quah, I., Polyakov, Y., R.V., S., Rohloff, K., Saylor, J., Suponitsky, D., Triplett, M., Vaikuntanathan, V., & Zucca, V.
- Venue
- Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography
- Publisher
- ACM
- Published
- 2022-11-07
- Pages
- 53-63
- OpenAlex
- W4307823778
- Cited by
- 281
- References
- 25
- FWCI
- 30.55
- Type
- conference paper
- Language
- en
- Open access
- green
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: OpenFHE: Open-Source Fully Homomorphic Encryption Library. https://app.cochat.ai/papers/10.1145/3560827.3563379
- The paper
- Al Badawi, A., Bates, J., Bergamaschi, F., Cousins, D. B., Erabelli, S., Genise, N., Halevi, S., Hunt, H., Kim, A., Lee, Y., Liu, Z., Micciancio, D., Quah, I., Polyakov, Y., R.V., S., Rohloff, K., Saylor, J., Suponitsky, D., Triplett, M., . . . Zucca, V. (2022). OpenFHE: Open-Source Fully Homomorphic Encryption Library. Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography. https://doi.org/10.1145/3560827.3563379
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.
