Homomorphic Encryption-homomorphic Encryption

homomorphic Encryption (homomorphic encryption) is a form of encryption that allows people to perform certain algebraic operations on ciphertext to get the result that is still encrypted, and the result of decrypting it is the same as the result of the same operation on the plaintext. In other words, this technology enables people to perform operations such as retrieval, comparison, and so on in encrypted data, to get the right results, without having to decrypt the data throughout the process. The point is to really fundamentally address the issue of confidentiality when delegating data and its operations to third parties, such as for a variety of [[cloud]] applications.

This has always been an important topic in cryptography, where people have only found some ways to do this. The September 2009 Cregg Kintry (Craig Gentry) paper ^{[1] Mathematically put forward the "all-in-one" approach, that is, the encrypted data can be carried out in the non-decryption process can be carried out in the plaintext of the operation, so that the technology has made a decisive breakthrough. People are on this basis to study the more perfect practical technology, which is of great value to the information technology industry.}

External links

• Homomorphic encryption in cryptology pointers
• The Homomorphic encryption Project
• The Open Source hcrypt Project
• American scientist article, September 2012
• Helib, open source homomorphic encryption Library

References

1. ^ Craig Gentry. Fully homomorphic encryption Using Ideal lattices. In the 41st ACM Symposium on Theory of Computing (STOC),.

homomorphic Encryptionis a small work related to cryptography. You can passedit or revise to enrich its content. Classification:

• Cryptographic Science

Homomorphic Encryption-homomorphic Encryption