MétaCan
Menu
Back to cohort
Record W2248085730

Lattice-Based FHE as Secure as PKE.

2013· article· en· W2248085730 on OpenAlexfundno aff
Zvika Brakerski, Vinod Vaikuntanathan

Bibliographic record

VenueDSpace@MIT (Massachusetts Institute of Technology) · 2013
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaDefense Advanced Research Projects Agency
KeywordsHomomorphic encryptionLearning with errorsLattice problemLattice (music)Bounded functionMathematicsSecurity parameterDiscrete mathematicsPublic-key cryptographyEncryptionCryptographyAlgorithmComputer scienceMathematical analysisComputer securityPhysics
DOInot available

Abstract

fetched live from OpenAlex

We show that (leveled) fully homomorphic encryption (FHE) can be based on the hardness of Õ(n1.5+ɛ)-approximation for lattice problems (such as GapSVP) under quantum reductions for any ɛ> 0 (or Õ(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.) Our approach consists of three main ideas: Noise-bounded sequential evaluation of high fan-in operations; Circuit sequentialization using Barrington’s Theorem; and finally, successive dimension-modulus reduction.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.748
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.003
Science and technology studies0.0000.001
Scholarly communication0.0000.002
Open science0.0030.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.009
GPT teacher head0.233
Teacher spread0.225 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueDSpace@MIT (Massachusetts Institute of Technology)Same topicCryptography and Data SecurityFrench-language works237,207