Evaluating 2-DNF Formulas on Ciphertexts

@inproceedings{Boneh2005Evaluating2F,
  title={Evaluating 2-DNF Formulas on Ciphertexts},
  author={Dan Boneh and Eu-Jin Goh and Kobbi Nissim},
  booktitle={TCC},
  year={2005}
}
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1, . . . , xn. In other words, given the encryption of the bits x1, . . . , xn, anyone can create the encryption of ψ(x1, . . . , xn). More generally, we can evaluate quadratic multi-variate polynomials on ciphertexts provided the resulting value falls within a small set. We present a number of… CONTINUE READING
Highly Influential
This paper has highly influenced 123 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,315 citations. REVIEW CITATIONS
764 Citations
37 References
Similar Papers

Citations

Publications citing this paper.

1,315 Citations

050100150'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 1,315 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…