Who Cited It

Efficient Fully Homomorphic Encryption from (Standard) LWE

2011 · 1,472 citations · 4 from inside this corpus

Zvika Brakerski, Vinod Vaikuntanathan

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

Efficient Fully Homomorphic Encryption from (Standard) LWE (2011)Efficient Fully Homomorphic E…Public-Key Cryptosystems Based on Composite Degree Residuosity Classes (2007)Public-Key Cryptosystems Base…Fully homomorphic encryption using ideal lattices (2009)Fully homomorphic encryption …Factoring polynomials with rational coefficients (1982)Factoring polynomials with ra…A fully homomorphic encryption scheme (2009)A fully homomorphic encryptio…On lattices, learning with errors, random linear codes, and cryptography (2005)On lattices, learning with er…NTRU: A ring-based public key cryptosystem (1998)NTRU: A ring-based public key…Fully Homomorphic Encryption over the Integers (2010)Fully Homomorphic Encryption …On Ideal Lattices and Learning with Errors over Rings (2010)On Ideal Lattices and Learnin…(Leveled) fully homomorphic encryption without bootstrapping (2012)(Leveled) fully homomorphic e…Evaluating 2-DNF Formulas on Ciphertexts (2005)Evaluating 2-DNF Formulas on …Private information retrieval (1998)Private information retrievalHomomorphic Encryption for Arithmetic of Approximate Numbers (2017)Homomorphic Encryption for Ar…(Leveled) fully homomorphic encryption without bootstrapping (2012)(Leveled) fully homomorphic e…Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa… (2013)Homomorphic Encryption from L…(Leveled) Fully Homomorphic Encryption without Bootstrapping (2014)(Leveled) Fully Homomorphic E…
15 of 15 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

PaperYearCited
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes20077,277
Fully homomorphic encryption using ideal lattices20096,701
Factoring polynomials with rational coefficients19824,041
A fully homomorphic encryption scheme20092,396
On lattices, learning with errors, random linear codes, and cryptography20052,289
NTRU: A ring-based public key cryptosystem19981,894
Fully Homomorphic Encryption over the Integers20101,881
On Ideal Lattices and Learning with Errors over Rings20101,814
(Leveled) fully homomorphic encryption without bootstrapping20121,777
Evaluating 2-DNF Formulas on Ciphertexts20051,696
Private information retrieval19981,657

What cites it, inside the corpus

PaperYearCited
Homomorphic Encryption for Arithmetic of Approximate Numbers20172,336
(Leveled) fully homomorphic encryption without bootstrapping20121,777
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…20131,493
(Leveled) Fully Homomorphic Encryption without Bootstrapping20141,445

Links

DOI · OpenAlex record

Topics

Cryptography and Data SecurityComputer Science
Complexity and Algorithms in GraphsComputer Science
Coding theory and cryptographyComputer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

  • supports2 author record(s) attached.
  • supports64 reference(s) recorded.
  • supportsThe DOI's year agrees with the publication year.
  • supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:58+00:00.

sha256 88a60cdbb94c6a13…