What is homomorphic encryption?

The concept known as homomorphic encryption in which dials can be manipulated and worked without being decrypted, was first introduced to the scientific community in 1978 by Ronald Rivest, Leonard Adulan and Michael Derzos as private homomorphism. In 1982, the semantically safe homomorphic encryption scheme of Shafi Goldwasser and Silvio Michali were developed. In 2009, Craig Gentry showed that a completely homomorphic encryption scheme was possible. transformed into Ciphertext. Without the development of a homomorphic solution is to send and receive data virtually the only function that can be done with encrypted data. The greatest concern was the level of computer technology, which is necessary to process the encrypted requirement for encrypted data and Whether encryption scheme of this nature can be sufficiently safe for practical use.

with the arrival and constant extension of cloud computing is essential to come with liveTabled method of homomorphic encryption. Otherwise, the risk is too high to date the cloud provider to stay safe. If the Provider has access to data in their decrypted form in any way, the data can be very easy to jeopardize. Gentry has shown that it is a viable theory, although the amount of time that lasts, and the potential ease with which encryption can be violated, are concerned.

The

Gentry system outlines how to create an encryption scheme that allows you to safely stored data in a cloud environment where the data owner can use the computing power of the cloud provider to perform functions on permanently encrypted data. Makes the Tove three -stage process. The encryption scheme that is "bootstrapable" is constructed or consists of a somewhat homomorphic encryption scheme that can work with its own decryption circuit. Furthermore, an almost executable scheme of public key encryption is built using idealgrid. Finally, the schemes are adjusted to be more simplified, allowing them to be maintained while maintaining their depth.

This method creates a completely homomorphic encryption scheme, but remains relatively impractical. Homomorphic encryption has evolved as mostly secured against selected simple text attacks, but securing against chosen ciphers attacks remains a problem. In addition to the security problem, fully homomorphic schemes are so large and complex that the time factor has excluded their use in most applications. Somewhat homomorphic encryption systems for at least time factor have been developed, using only the most effective parts of completely homomorphic encryption.