Evaluating 2-DNF Formulas on Ciphertexts

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 applications of the system:

• Type: Conference
• Year: 2005
• Where: TCC
• Authors: Dan Boneh, Eu-Jin Goh, Kobbi Nissim
• Keywords: Boolean Variables, Cryptography, Encryption, Key Encryption Scheme, TCC 2005