THE GARDEN
Updated 11 Aug 2026
an attack game where the adversary is given the encryption of a uniformly random message and tries to recover the message exactly
advantage: MRadv[A,E]:=∣Pr[recovers m]−1/∣M∣∣\mathrm{MRadv}[A, \mathcal{E}] := |\Pr[\text{recovers } m] - 1/|M|| — how much better than blind guessing the adversary does
semantic security implies security against message recovery — proven via reduction: any efficient message-recovery adversary can be converted into an efficient semantic-security adversary
Semantic Security
Security Reduction
◌ Explore connections in Graph view
Paths through the garden