rewrote multi-user proofs

thesis/sections/security_of_eddsa/gamez_implies_uf-nma.tex

@@ -122,7 +122,7 @@ This section shows that \igame implies the UF-NMA security of the EdDSA signatur
 
 	Therefore, $S$ is a valid solution for the \igame game.
 	
-	\item The runtime of adversary $\adversary{B}$ is clearly ppt, since it just outputs the solution of adversary $\adversary{A}$, and in the random oracle it either calls the \ioracle oracle or samples a value uniformly at random.
+	\item The runtime of adversary $\adversary{B}$ is roughly the same as the runtime of adversary $\adversary{A}$, since it just outputs the solution of $\adversary{A}$, and in the random oracle it either calls the \ioracle oracle or samples a value uniformly at random.
 	
 	\item This proves theorem \ref{theorem:adv_igame}.
 \end{proof}