A form of encryption with an additional evaluation capability: computing over encrypted data without access to the secret key, leaving the result encrypted.
It can be viewed as an extension of public-key cryptography, since ciphertexts can be manipulated algebraically to produce encrypted results.
Craig Gentry, using lattice-based cryptography, described the first plausible construction of a fully homomorphic encryption scheme in 2009.