order between adversaries and type of resources given We have a game $G0$ for which an adversary $A$ has access to a certain amount of ressources. Let us suppose that the maximum advantage for the adversary to win this game is $Adv_{G0}$.

If we modify slightly the game $G0$ into the game $G1$ in such way that we give an additional information (useful or not) to this adversary.

Can we state that $Adv_{G0} \le Adv_{G_1}$ ?

If we consider indistinguishability games for encryption, the first one with CPA attack, the second one with CCA attack. Can we state that $Adv^{CPA} \le Adv^{CCA}$ ?
Can we state that $Adv_{G0} \le Adv_{G_1}$ ?


Absolutely.  Let us call $S0$ the strategy that $A$ can use in game $G0$ to achieve advantage $Adv_{G0}$; we notice that $A$ can also use strategy $S0$ to achieve that exact same advantage in $G1$, and hence we see that the maximum advantage he can achieve in $G1$ must be at least as large as in $G0$


  Can we state that $Adv^{CPA} \le Adv^{CCA}$ ?


No (unless we assume that, in the CCA case, the attacker is also allowed to submit chosen plaintexts as well).

To demonstrate this, construct an encryption method that is secure, except that if the plaintext was the specific message "Open Sesame", it outputs a ciphertext that is the encryption key.

In this case, $Adv^{CPA}$ is quite large (the attacker submits two plaintexts, one "Open Sesame" and one something else, and see if the key he got from the "Open Sesame" message encrypts the other message in the ciphertext he got).

However, there is no obvious way that the attacker can use chosen ciphertexts; he knows that if he submits a ciphertext that happens to be key, he'll get the plaintext "Open Sesame"; however that doesn't help him, as there are other ways to verify a guess on the key.

Hence, in this artificial example, we have $Adv^{CPA} &gt; Adv^{CCA}$