crypto.graphics
PRF (Pseudo-Random Function Family) Security Game
F is the candidate PRF.
| b = 0 | b = 1 | Adversary | ||
| k = rand(Keys) | R = rand(Functions) | |||
| m | ← | m ∈ Inputs | ||
| c = F(k, m) | c = R(m) | → | c | |
| bguess ∈ {0, 1} | ||||
| bguess ↓ |
||||
F is the candidate PRF.
| b = 0 | b = 1 | Adversary | ||
| k = rand(Keys) | R = rand(Functions) | |||
| m | ← | m ∈ Inputs | ||
| c = F(k, m) | c = R(m) | → | c | |
| bguess ∈ {0, 1} | ||||
| bguess ↓ |
||||