Ended proof sections

thesis/sections/mu_security_of_eddsa/omdl'_implies_mu-gamez.tex

@@ -82,6 +82,8 @@ This section shows that \somdl implies MU-\igame using the algebraic group model
 \end{figure}
 
 \begin{proof}
+	\item Now the individual game-hops are analyzed and the probability, that an adversary can distinguish between two games, is upper bounded.
+	
 	\item \paragraph{\underline{$G_0$:}} Let $G_0$ be defined in figure \ref{fig:omdl'_implies_mu-igame} by excluding all boxes. Clearly, $G_0$ is the MU-\igame. By definition,
 	
 	\[ \advantage{\group{G},\adversary{A}}{\text{MU-\igame}}(\secparamter) = \Pr[\text{MU-\igame}^{\adversary{A}} \Rightarrow 1] = \Pr[G_0^{\adversary{A}} \Rightarrow 1]. \]