Homomorphic encryption
Homomorphic encryption is encryption that permits specified computations on ciphertexts whose decrypted results correspond to computations on the underlying plaintexts.
First-Party Data Activation
Encryption that permits specified computations on ciphertexts whose decrypted results correspond to computations on the original plaintexts.
- How it is used
- Positions encrypted-data computation as an option for deriving marketing insights while limiting access to sensitive raw data.
- How deep it goes
- Defines computation without decryption and identifies validation and indexing, but stops short of implementation details or full-scale encrypted analysis.
- Examples
- Names Microsoft SEAL as a solution and validation and indexing as specific operations, without a worked deployment.
- What you can do after
- Evaluate/understand it as a privacy option for a specified encrypted-data operation without assuming it supports full-scale analysis.
Read how First-Party Data Activation explains homomorphic encryption →
Real-World Cryptography
Homomorphic encryption is encryption that permits specified computations on ciphertexts whose decrypted results correspond to computations on the underlying plaintexts.
- How it is used
- Enables cloud services to compute on private data without exposing the underlying plaintext.
- How deep it goes
- Explains scheme types, noise growth, bootstrapping, RSA’s limitation, and a simplified learning-with-errors construction without implementation detail.
- Examples
- Uses RSA multiplication, encrypted spam detection, private genetic research, and encrypted database queries as concrete examples.
- What you can do after
- Evaluate/understand when encrypted computation fits a privacy-preserving cloud use case and when performance limits favor a weaker scheme.
Read how Real-World Cryptography explains homomorphic encryption →
Related concepts
- encryptionkind of · Encryption is the cryptographic transformation of readable data into ciphertext to conceal its contents, reversible through decryption with appropriate information.
- learning with errorsuses · Learning with errors is a computational problem of recovering a secret vector from linear equations whose results are perturbed by small random errors, typically modulo a large number.
- scatter matrix plotuses · A scatter matrix plot is a grid of scatterplots showing pairwise relationships among multiple numerical variables, usually with univariate distributions or related summaries on the diagonal.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.