Who Cited It

Fully homomorphic encryption using ideal lattices

2009 · 6,701 citations · 9 from inside this corpus

Craig Gentry

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.

Fully homomorphic encryption using ideal lattices (2009)Fully homomorphic encryption …A method for obtaining digital signatures and public-key cryptosystems (1978)A method for obtaining digita…A method for obtaining digital signatures and public-key cryptosystems (1983)A method for obtaining digita…A public key cryptosystem and a signature scheme based on discrete logarithms (1985)A public key cryptosystem and…Public-Key Cryptosystems Based on Composite Degree Residuosity Classes (2007)Public-Key Cryptosystems Base…Factoring polynomials with rational coefficients (1982)Factoring polynomials with ra…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…Evaluating 2-DNF Formulas on Ciphertexts (2005)Evaluating 2-DNF Formulas on …Divertible protocols and atomic proxy cryptography (1998)Divertible protocols and atom…Generating hard instances of lattice problems (extended abstract) (1996)Generating hard instances of …Advances and Open Problems in Federated Learning (2020)Advances and Open Problems in…Decentralizing Privacy: Using Blockchain to Protect Personal Data (2015)Decentralizing Privacy: Using…Homomorphic Encryption for Arithmetic of Approximate Numbers (2017)Homomorphic Encryption for Ar…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…Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa… (2013)Homomorphic Encryption from L…Efficient Fully Homomorphic Encryption from (Standard) LWE (2011)Efficient Fully Homomorphic E…(Leveled) Fully Homomorphic Encryption without Bootstrapping (2014)(Leveled) Fully Homomorphic E…
19 of 19 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
A method for obtaining digital signatures and public-key cryptosystems197813,242
A method for obtaining digital signatures and public-key cryptosystems198313,151
A public key cryptosystem and a signature scheme based on discrete logarithms19858,086
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes20077,277
Factoring polynomials with rational coefficients19824,041
On lattices, learning with errors, random linear codes, and cryptography20052,289
NTRU: A ring-based public key cryptosystem19981,894
Evaluating 2-DNF Formulas on Ciphertexts20051,696
Divertible protocols and atomic proxy cryptography19981,578
Generating hard instances of lattice problems (extended abstract)19961,378

What cites it, inside the corpus

PaperYearCited
Advances and Open Problems in Federated Learning20205,383
Decentralizing Privacy: Using Blockchain to Protect Personal Data20152,568
Homomorphic Encryption for Arithmetic of Approximate Numbers20172,336
Fully Homomorphic Encryption over the Integers20101,881
On Ideal Lattices and Learning with Errors over Rings20101,814
(Leveled) fully homomorphic encryption without bootstrapping20121,777
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…20131,493
Efficient Fully Homomorphic Encryption from (Standard) LWE20111,472
(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.

  • supports1 author record(s) attached.
  • supports60 reference(s) recorded.
  • neutralThe DOI carries no year to check against.
  • supportsA title is present.

Provenance

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

sha256 5cad55ac5d4d41e1…