Skip to content
The Future Explorerby Benjamin Talin
Enablertechnologicalemerging

Homomorphic Encryption

A way of locking data so that a computer can still do sums on it without ever unlocking it. The data goes in scrambled, the calculation runs on the scrambled version, and the answer comes out correct when the owner unscrambles it. A hospital could analyse another hospital's records without seeing them. The maths is proven; the catch is speed, as it still runs many times slower than normal computing.

Readiness

TRL5
SRL5
Gap0

Not scored. Watchlist entries do not enter any gradient. WKO Innovation Map 26/27 (2026)

Homomorphic encryption lets a computer perform useful work on data it cannot read. The data goes in encrypted, the computation runs on the ciphertext, and the result decrypts correctly at the other end - so a party can process information without ever holding it.

If that sounds like it dissolves a large class of privacy trade-offs, it does. A hospital could run analysis on another hospital's records. A government could query a dataset it is not permitted to see. The technique is proven and the mathematics is not in doubt.

The constraint is cost. Fully homomorphic operations run orders of magnitude slower than the same computation in the clear, and that overhead has fallen without collapsing. So the deployments are the ones where the privacy is worth the arithmetic - narrow, high-value, usually regulated - and the general case is still waiting on hardware acceleration.

Common misconception: that it is not ready. It is ready, and expensive, which is a different problem with a different solution.

Possibly related megatrends - unreviewed

Unreviewed. Derived from this technology's WKO cluster, not from a judgement about this technology. A starting point for review, not a claim.

Talin, B. (2026). Homomorphic Encryption. The Future Explorer, dataset v0.4.0 (2026-11-16). https://explorer.talin.digital/e/homomorphic-encryption/

Homomorphic Encryption - on the watchlist