Add sigmasig

chap-proofs.tex

@@ -233,7 +233,7 @@ Two examples of security game are given in Figure~\ref{fig:sec-game-examples}: t
   \caption{Some security games examples} \label{fig:sec-game-examples}
 \end{figure}
 
-\index{Reduction!Advantage}
+\index{Reduction!Advantage} \index{Encryption!IND-CPA}
 The \indcpa{} game is an \emph{indistinguishability} game. Meaning that the goal for the adversary $\mathcal A$ against this game is to distinguish between two messages from different distributions.
 To model this, for any adversary $\adv$, we define a notion of \emph{advantage} for the $\indcpa$ game as
 \[
@@ -255,6 +255,7 @@ The goal of the adversary is not to distinguish between two distributions, but t
 
 Those signature queries are provided by an oracle \oracle{sign}{sk,\cdot}, which on input $m$ returns the signature $\sigma = \Sigma.\mathsf{sign}(sk, m)$ and add $\sigma$ to $\ensemble{sign}$. The initialization of these sets and the behaviour of oracle may be omitted in the rest of this thesis for the sake of readability.
 
+\index{Signatures!EU-CMA}
 For EU-CMA, the advantage of an adversary $\adv$ is defined as
 \[
   \advantage{\textrm{EU-CMA}}{\adv}(\lambda)