Implementation and Analysis of Homomorphic Encryption Schemes
An encryption scheme is "Homomorphic" if it is possible to perform implicit operation on the plaintext by processing the ciphertext only. The scheme is said to be "Fully homomorphic'' when the authors can perform (a sequence of operations) both addition and multiplication, whereas, it is "Some what homomorphic'' if it supports a limited number of operations. They describe how Gentry's transformation can be applied on boot-strappable Somewhat Homomorphic Encryption (SHE) scheme to make it a Fully Homomorphic scheme (FHE) by squashing the decryption circuit i.e., evaluating with a low-degree polynomial.
Provided by: Academy & Industry Research Collaboration Center Topic: Mobility Date Added: Jun 2012 Format: PDF