Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 266

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Lattice-based FHE as secure as PKE

Brakerski, Zvika, Vaikuntanathan, Vinod·2014·Proceedings of the 5th conference on Innovations in theoretical computer science

Abstract

We show that (leveled) fully homomorphic encryption (FHE) can be based on the hardness of O(n1.5+ε)-approximation for lattice problems (such as GapSVP) under quantum reductions for any ε 〉 0 (or O(n2+ε)-approximation under classical reductions). This matches the best known hardness for "regular" (non-homomorphic) lattice based public-key encryption up to the ε factor. A number of previous methods had hit a roadblock at quasipolynomial approximation. (As usual, a circular security assumption can be used to achieve a non-leveled FHE scheme.)

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2554797.2554799

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 266

Metadata

Authors
Brakerski, Z., & Vaikuntanathan, V.
Venue
Proceedings of the 5th conference on Innovations in theoretical computer science
Publisher
ACM
Published
2014-01-12
Pages
1-12
OpenAlex
W2159486442
Cited by
266
References
1
FWCI
19.96
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: Lattice-based FHE as secure as PKE. https://app.cochat.ai/papers/10.1145/2554797.2554799
The paper
Brakerski, Z., & Vaikuntanathan, V. (2014). Lattice-based FHE as secure as PKE. Proceedings of the 5th conference on Innovations in theoretical computer science. https://doi.org/10.1145/2554797.2554799

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.