History of HE

The word “Homomorphic encryption” became popular in the field of cryptography as the third party data storage become popular. Rivest was the first researcher to give an idea to implement homomorphism in encryption. In 1978, after a little while developing a successful RSA security algorithm, Rivest introduced the idea of incorporating the homomorphic property in the encryption technique on his research paper, “On Data Banks and Privacy Homomorphism”, which focused on a sensitive bank-loan customer data.

Encryption is a well known technique for preserving the privacy of sensitive information. One of the basic, apparently inherent, limitations of this technique is that an information system working with encrypted data can at most store or retrieve the data for the user; any more complicated operations seem to require that the data be decrypted before being operated on. This limitation follows from the choice of encryption functions used, however, and although there are some truly inherent limitations on what can be accomplished, we shall see that it appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations. These special encryption functions we call “privacy homomorphisms” ; they form an interesting subset of arbitrary encryption schemes (called “privacy transformations”).