Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In the definition below, what exactly does it mean for the adversary (not even sure that's the correct term?) to equal one?

$$ \underset{K}{Pr} \left [A^{F_k(\cdot)} = 1 \right ] $$

Source (Page 22/35?)

enter image description here

share|improve this question
Asymptotic security definitions ARGHHH – CodesInChaos Feb 19 '13 at 17:15
up vote 3 down vote accepted

This represents the probability over all $K$ that $A$ given an oracle access to $F_K(\cdot)$ outputs 1. You usually compare that to the probability of A ouptputting 1 while having oracle access to a random function and the difference tells you how well $A$ does at telling $F_K$ from random

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.