Enable javascript in your browser for better experience. Need to know to enable it? Go here.
radar blip
radar blip

Homomorphic encryption

Published : Apr 13, 2021
This blip is not on the current edition of the Radar. If it was on one of the last few editions, it is likely that it is still relevant. If the blip is older, it might no longer be relevant and our assessment might be different today. Unfortunately, we simply don't have the bandwidth to continuously review blips from previous editions of the Radar. Understand more
Apr 2021
Assess ?

Fully homomorphic encryption (HE) refers to a class of encryption methods that allow computations (such as search and arithmetic) to be performed directly on encrypted data. The result of such a computation remains in encrypted form, which at a later point can be decrypted and revealed. Although the HE problem was first proposed in 1978, a solution wasn't constructed until 2009. With advances in computing power and the availability of easy-to-use open-source libraries — including SEAL, Lattigo, HElib and partially homomorphic encryption in Python — HE is becoming feasible in real-world applications. The motivating scenarios include privacy-preserving use cases, where computation can be outsourced to an untrusted party, for example, running computation on encrypted data in the cloud, or enabling a third party to aggregate homomorphically encrypted intermediate federated machine learning results. Moreover, most HE schemes are considered to be secure against quantum computers, and efforts are underway to standardize HE. Despite its current limitations, namely performance and feasibility of the types of computations, HE is worth your attention.

Download the PDF



English | Español | Português | 中文

Sign up for the Technology Radar newsletter


Subscribe now

Visit our archive to read previous volumes