Who Cited It

Evaluating 2-DNF Formulas on Ciphertexts

2005 · Lecture notes in computer science · 1,696 citations · 5 from inside this corpus

Dan Boneh, Eu-Jin Goh low, Kobbi Nissim

No abstract in the source record.

Evaluating 2-DNF Formulas on Ciphertexts (2005)Evaluating 2-DNF Formulas on …Handbook of applied cryptography (1997)Handbook of applied cryptogra…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…On observing nondeterminism and concurrency (1980)On observing nondeterminism a…How To Prove Yourself: Practical Solutions to Identification and Signature Problems (2007)How To Prove Yourself: Practi…Identity-Based Encryption from the Weil Pairing (2003)Identity-Based Encryption fro…Protocols for secure computations (1982)Protocols for secure computat…Foundations of Cryptography (2004)Foundations of CryptographyPrivate information retrieval (1998)Private information retrievalFoundations of Cryptography: Volume 2, Basic Applications (2004)Foundations of Cryptography: …Fully homomorphic encryption using ideal lattices (2009)Fully homomorphic encryption …(Leveled) fully homomorphic encryption without bootstrapping (2012)(Leveled) fully homomorphic e…Efficient Fully Homomorphic Encryption from (Standard) LWE (2011)Efficient Fully Homomorphic E…Conjunctive, Subset, and Range Queries on Encrypted Data (2007)Conjunctive, Subset, and Rang…(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

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
Handbook of applied cryptography199710,465
A public key cryptosystem and a signature scheme based on discrete logarithms19858,086
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes20077,277
On observing nondeterminism and concurrency19804,498
How To Prove Yourself: Practical Solutions to Identification and Signature Problems20073,925
Identity-Based Encryption from the Weil Pairing20033,570
Protocols for secure computations19822,727
Foundations of Cryptography20041,795
Private information retrieval19981,657
Foundations of Cryptography: Volume 2, Basic Applications20041,611

What cites it, inside the corpus

PaperYearCited
Fully homomorphic encryption using ideal lattices20096,701
(Leveled) fully homomorphic encryption without bootstrapping20121,777
Efficient Fully Homomorphic Encryption from (Standard) LWE20111,472
Conjunctive, Subset, and Range Queries on Encrypted Data20071,453
(Leveled) Fully Homomorphic Encryption without Bootstrapping20141,445

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data SecurityComputer Science
Coding theory and cryptographyComputer Science
Cryptographic Implementations and SecurityComputer Science

Is this record sound?

complete

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

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

sha256 7bc26169e93749d1…