Who Cited It

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

2013 · Lecture notes in computer science · 1,493 citations · 1 from inside this corpus

Craig Gentry, Amit Sahai, Brent Waters

No abstract in the source record.

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa… (2013)Homomorphic Encryption from L…Fully homomorphic encryption using ideal lattices (2009)Fully homomorphic encryption …Identity-Based Cryptosystems and Signature Schemes (2007)Identity-Based Cryptosystems …Attribute-based encryption for fine-grained access control of encrypted data (2006)Attribute-based encryption fo…Fuzzy Identity-Based Encryption (2005)Fuzzy Identity-Based Encrypti…Factoring polynomials with rational coefficients (1982)Factoring polynomials with ra…Identity-Based Encryption from the Weil Pairing (2003)Identity-Based Encryption fro…On lattices, learning with errors, random linear codes, and cryptography (2005)On lattices, learning with er…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…Efficient Fully Homomorphic Encryption from (Standard) LWE (2011)Efficient Fully Homomorphic E…Generating hard instances of lattice problems (extended abstract) (1996)Generating hard instances of …Homomorphic Encryption for Arithmetic of Approximate Numbers (2017)Homomorphic Encryption for Ar…
13 of 13 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

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

What this paper cites, inside the corpus

PaperYearCited
Fully homomorphic encryption using ideal lattices20096,701
Identity-Based Cryptosystems and Signature Schemes20076,675
Attribute-based encryption for fine-grained access control of encrypted data20065,029
Fuzzy Identity-Based Encryption20054,464
Factoring polynomials with rational coefficients19824,041
Identity-Based Encryption from the Weil Pairing20033,570
On lattices, learning with errors, random linear codes, and cryptography20052,289
Fully Homomorphic Encryption over the Integers20101,881
On Ideal Lattices and Learning with Errors over Rings20101,814
(Leveled) fully homomorphic encryption without bootstrapping20121,777
Efficient Fully Homomorphic Encryption from (Standard) LWE20111,472
Generating hard instances of lattice problems (extended abstract)19961,378

What cites it, inside the corpus

PaperYearCited
Homomorphic Encryption for Arithmetic of Approximate Numbers20172,336

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data SecurityComputer Science
Complexity and Algorithms in GraphsComputer Science
Privacy-Preserving Technologies in DataComputer Science

Is this record sound?

complete

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

  • supports3 author record(s) attached.
  • supports48 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:58+00:00.

sha256 88a60cdbb94c6a13…