Cryptography
Homomorphic Encryption
Also known as: FHE, Fully Homomorphic Encryption
Definition
An encryption scheme that allows computations to be performed directly on ciphertexts, producing encrypted results that match the operations on the underlying plaintexts.
Examples
- Microsoft SEAL implements BFV and CKKS for encrypted analytics on cloud data.
- Zama's TFHE-rs is used to evaluate machine-learning models directly on encrypted inputs.
Related terms
Encryption
The cryptographic transformation of plaintext into ciphertext using an algorithm and key so that only authorized parties can recover the original data.
Asymmetric Encryption
A cryptographic scheme that uses mathematically linked key pairs — a public key for encryption and a private key for decryption — to enable secure communication without prior secret sharing.
Public-Key Cryptography
A branch of cryptography that uses paired public and private keys to enable encryption, key exchange, digital signatures, and authentication without a pre-shared secret.
RSA Algorithm
A public-key algorithm by Rivest, Shamir and Adleman (1977) whose security rests on the difficulty of factoring the product of two large prime numbers.
Post-Quantum Cryptography
Classical cryptographic algorithms designed to remain secure against attacks by both classical and large-scale quantum computers.
Confidential Computing
Confidential Computing — definition coming soon.