The DOI matches its Crossref record.
(Leveled) fully homomorphic encryption without bootstrapping
Abstract
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual contribution in our work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry's bootstrapping procedure.
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
No references could be resolved yet.
Research works printed but not linked: 18
- 10.1007/978-3-642-03356-8_35 · DOI · Paper page
- 10.1007/978-3-540-30576-7_18 · DOI · Paper page
- Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) lwe. Manuscript to appear in FOCS 2011 available at http://eprint.iacr.org/2011/344. Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) lwe. Manuscript to appear in FOCS 2011 available at http://eprint.iacr.org/2011/344. · DOI · Paper page
- Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-lwe and security for key dependent messages. Manuscript to appear in CRYPTO 2011. Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-lwe and security for key dependent messages. Manuscript to appear in CRYPTO 2011. · DOI · Paper page
- 10.1007/978-3-642-13190-5_2 · DOI · Paper page
- Gentry Craig, 2009, Stanford University
- 10.1145/1536414.1536440 · DOI · Paper page
- Craig Gentry and Shai Halevi. Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. Manuscript to appear in FOCS 2011 available at http://eprint.iacr.org/2011/279. Craig Gentry and Shai Halevi. Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. Manuscript to appear in FOCS 2011 available at http://eprint.iacr.org/2011/279. · DOI
- Gentry Craig, 2011, EUROCRYPT, 129, 10.1007/978-3-642-20465-4_9 · DOI · Paper page
- Yuval Ishai and Anat Paskin . Evaluating branching programs on encrypted data. In Salil P. Vadhan editor TCC volume 4392 of Lecture Notes in Computer Science pages 575 -- 594 . Springer 2007 . Yuval Ishai and Anat Paskin. Evaluating branching programs on encrypted data. In Salil P. Vadhan editor TCC volume 4392 of Lecture Notes in Computer Science pages 575--594. Springer 2007. · DOI · Paper page
- 10.1007/978-3-642-13190-5_1 · DOI · Paper page
- Carlos Aguilar Melchor Philippe Gaborit and Javier Herranz . Additively homomorphic encryption with -operand multiplications. In Tal Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 138 -- 154 . Springer 2010 . Carlos Aguilar Melchor Philippe Gaborit and Javier Herranz. Additively homomorphic encryption with -operand multiplications. In Tal Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 138--154. Springer 2010. · DOI
- 10.1145/1536414.1536461 · DOI · Paper page
- 10.1145/1060590.1060603 · DOI · Paper page
- 10.1109/CCC.2010.26 · DOI · Paper page
- Rivest Ron, 1978, Foundations of Secure Computation, 169
- 10.1007/978-3-642-13013-7_25 · DOI · Paper page
- Stehlé Damien, 2010, ASIACRYPT, 377, 10.1007/978-3-642-17373-8_22 · DOI · Paper page
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
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
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Metadata
- Authors
- Brakerski, Z., Gentry, C., & Vaikuntanathan, V.
- Venue
- Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
- Publisher
- ACM
- Published
- 2012-01-08
- Pages
- 309-325
- OpenAlex
- W2152926062
- Cited by
- 1,782
- References
- 0
- FWCI
- 89.37
- Type
- conference paper
- Language
- en
- Open access
- closed
- Funders
- Defense Advanced Research Projects Agency (FA8750-11-C-0096FA8750-11-2-0225)
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: (Leveled) fully homomorphic encryption without bootstrapping. https://app.cochat.ai/papers/10.1145/2090236.2090262
- The paper
- Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012). (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. https://doi.org/10.1145/2090236.2090262
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.
