Data Encapsulation Mechanisms #
This file defines data encapsulation mechanisms (DEMs), their correctness notion, and the one-time IND-CPA game used by the KEM+DEM composition theorem.
Correctness experiment for a DEM under an externally supplied key.
Instances For
Perfect correctness for a DEM: every externally supplied key decrypts honest ciphertexts
correctly with probability 1.
Instances For
Two-phase one-time IND-CPA adversary for a DEM. The key is hidden, so the message-selection phase receives no public input.
- State : Type
- chooseMessages : OracleComp spec (M × M × self.State)
- distinguish : self.State → C → OracleComp spec Bool
Instances For
Fixed-branch one-time IND-CPA experiment for a DEM, matching the source proof-ladders
DEM_1CPA_Exp.run(b) presentation.
Instances For
Game-form one-time IND-CPA experiment for a DEM.
Instances For
One-time IND-CPA advantage for a DEM, defined canonically as the bias of the single game.
Instances For
The canonical one-time IND-CPA advantage is definitionally the bias of the single game.