Added todo

report.tex

@@ -129,6 +129,7 @@ h_i =
 \end{cases}
 $$
 \adv{B} then sets $\alpha = y_0 \cdot a^{n+1}$. $PK$ is then defined as the scheme dictates where the only oddity is $e(g,g)^\alpha$, which can be computed as $e(g^a,g^{a^{n}})^{y_0}$ due to the definition of $\alpha$. $PK$ is sent to \adv{A}.
+% TODO: Finish this proof
 
 \section{Implementation of Schemes}
 \subsection{Identity-Based Encryption}