IDEA #9W2BAP System and Method for Private Key Fully Homomorphic Encryption and Private Search Between Rings.

Homomorphic Encryption is an encryption system in which the data can be operated on even while it is still encrypted. If any operation can be performed on the encrypted data then it is described as Fully Homomorphic Encryption. Fortunately this is now not only possible but is actually viable • In 2009 Craig Gentry introduced an FHE based on crystal lattices. However, despite IBM’s attempt to commercialize it, it was too slow for practical use • In 2015 two CUNY professors develop an algorithm for FHE that is at least 36,000 times faster than the Gentry algorithm for encryption and close to a million times faster for search. Advantages of FHE technology: 1. Data holder can store information in encrypted form, so even if storage provider has a security breach, intruders will not get ahold of the actual data 2. Storage provider never has access to the actual (unencrypted) data 3. Storage provider does not know search parameters when queried – private information retrieval In particular, this technology is a system for producing a public ring that is fully homomorphically encrypted. It is useful in private information retrieval, allowing to privately retrieve information from an encrypted database without the storage provider knowing what information was queried for.