August 9, 2011 10:56 AM Subscribe
posted by jeffburdges (17 comments total)
28 users marked this as a favorite
Described as 'cryptography's holy grail'
, Homomorphic Encryption/Computation
is a form of encryption where specific algebraic operations on the plaintext translate into different algebraic operations on the ciphertext, allowing the plaintext's owner to 'outsource'
computations to untrusted
There have been efficient 'partially' homomorphic cryptosystems that preserve either addition or multiplication, but not both, ever since RSA was discovered, the most well know being Diffie–Hellman key exchange
. A 'fully' homomorphic cryptosystems permitting both ring operations was first devised in 2009
using lattice-based cryptography
, but remained inefficient. Recent progress has centered upon finding good compromises of the two fully homomorphic systems that enable reasonable computations.
Applications include voting systems (pdf
), collision-resistant hash functions, private information retrieval
, watermarking, in-house security
funding, and obviously improving computational scalability through outsourcing computations on sensitive business data, conceivably already in limited use for algorithm trading. There might also be applications of public key homomorphic encryption to providing targeted advertisements without revealing personal information.