Fully Homomorphic Encryption
An encryption scheme that allows computation directly on encrypted data, producing an encrypted result without ever decrypting the inputs.
- glossary
Fully homomorphic encryption (FHE) is a cryptographic technique that lets a computer perform arithmetic directly on encrypted data and return an encrypted result that decrypts to the same answer as running the same operation on the plaintext—so the party doing the computing never sees the underlying values. Built on lattice-based mathematics, FHE schemes are considered resistant to attacks from future quantum computers, which is drawing interest for long-term data protection. On blockchains, FHE lets a smart contract move tokens or evaluate logic on encrypted balances without ever exposing the amounts involved, unlike a standard public ledger where every value is readable. It is the strongest privacy guarantee among current techniques because nothing is ever decrypted during processing, but it is also the most computationally expensive, which is why FHE-based chains currently apply it selectively rather than to every transaction. It complements other privacy primitives such as the zero-knowledge proof, secure multi-party computation, and the trusted execution environment, each offering a different balance of speed and trust. For tokenized assets, FHE points toward a future where ownership and transaction logic can be verified without any party—including the platform operator—seeing the underlying values, extending the same cryptographic security principles already protecting private keys.
Related keywords
- fhe
- confidential computing
- encrypted computation
- lattice cryptography
- Fully Homomorphic Encryption
- what is Fully Homomorphic Encryption
- Fully Homomorphic Encryption meaning
- Fully Homomorphic Encryption definition