Encrypted Maximum
L4 · Application ComponentsDefinition
Encrypted maximum computes the maximum value in a collection of encrypted elements without revealing the individual inputs.
Given encrypted values
the result is an encrypted value
The maximum is an order-based selection: it depends only on the total ordering of the plaintext values, not on any arithmetic identity, so an implementation must realise comparison and selection homomorphically over the encrypted data.
Semantics
The operation is defined over encrypted data and preserves the confidentiality of the input values during computation.
After decryption, the output represents the maximum of the plaintext values encoded by the encrypted inputs. When the maximum value occurs more than once the returned value is unchanged; the kernel returns the value, not an index.
The kernel does not fix the plaintext type, collection size, cryptographic scheme, ciphertext representation, or exactness requirements. These are defined by individual specifications.
Parameters Defined by Specifications
A specification narrows the general encrypted-maximum operation into a concrete computational problem by defining, for example:
- the plaintext element domain and its ordering;
- the number of elements
N; - the input and output types;
- the encryption or execution context (scheme and parameters);
- the ciphertext representation;
- exact or approximate output semantics;
- any additional constraints required by the computation.
Applications
Encrypted maximum is a basic comparison and selection primitive in privacy-preserving analytics and machine learning. It underlies encrypted argmax, ranking, thresholding, sorting, top-k selection, pooling layers in private inference, and confidential reporting of extreme values.