definition comment

1 files changed, 4 insertions, 3 deletions

diff --git a/games/games.tex b/games/games.tex
index 4e10f96..9bd889e 100644
--- a/games/games.tex
+++ b/games/games.tex
@@ -758,7 +758,7 @@ RSA-KTI cannot be hard by \cite[Theorem 12]{RSA-FDH-KTIvCTI}.
 \begin{definition}
 A {\em key exchange failure} consists of two key pairs
  $A = a G$ and $B = b G$ such that $b A \neq a B$.
-\comment{Find this in literature?  Is it related to contributory behavior?}
+\comment{TODO: Find this in literature?  Is it related to contributory behavior?}
 \end{definition}
 
 \begin{theorem}
@@ -903,11 +903,12 @@ $H(m,i)$ and the proof that it lives in the Merkle tree.
 
 \section{Standard Definitions}
 \begin{definition}[One-more forgery]
-For any integer $\ell$, an $(\ell, \ell + 1)$-
-forgery comes from a probabilistic polynomial time Turing machine $\mathcal{A}$ that can
+For any integer $\ell$, an $(\ell, \ell + 1)$-forgery comes from
+a probabilistic polynomial time Turing machine $\mathcal{A}$ that can
 compute, after $\ell$ interactions with the signer $\Sigma$, $\ell + 1$ signatures with nonnegligible
   probability. The ``one-more forgery'' is an $(\ell, \ell + 1)$-forgery for some
 integer $\ell$. 
+\comment{TODO: Turing machine?!?}
 \end{definition}
 
 Taken from \cite{pointcheval1996provably}.  This definition applies to blind signature schemes in general.