From 23968a760efa6e03e8d47fbff108ec5aae010fe3 Mon Sep 17 00:00:00 2001
From: Dennis Brentjes <dennis@brentj.es>
Date: Tue, 26 Jun 2018 23:16:41 +0200
Subject: Small revision of the thesis.

---
 content/cmix.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'content/cmix.tex')

diff --git a/content/cmix.tex b/content/cmix.tex
index 3af780d..eac6840 100644
--- a/content/cmix.tex
+++ b/content/cmix.tex
@@ -37,7 +37,7 @@ A major downside of these classic mix network is the amount of public key operat
 
 
 \section{\cmix}
-
+\label{sec:cmix}
 \cmix is a new anonymity mix network\cite{cMix}. Just like any other mix network it aims to provide anonymity by hiding timing information of messages. This means hiding the difference in time between a message leaving the client and arriving at its destination.
 
 A \cmix network is a fixed network consisting of $N$ nodes. This means there is a fixed network order and all clients know which computer represents each node in the network. It uses ElGamal encryption. And it relies heavily on the homomorphic properties of ElGamal.
@@ -94,7 +94,7 @@ where:
 \item $R_i$ is the R vector of node $i$
 \end{itemize}
 
-Whenever the result reaches the first node again it uses its permutation function $\pi$ on the incoming vector of values and multiplies that result with the encryption of $S$. It sends its result to the next node which does the same. The last node gets the following result.
+Whenever the result reaches the first node again phase 2 of the precomputation starts. this is a mix phase. It uses its permutation function $\pi$ on the incoming vector of values and multiplies that result with the encryption of $S$. It sends its result to the next node which does the same. The last node gets the following result.
 
 \begin{align}
 &\mathcal{E}_E( \nonumber \\
@@ -114,7 +114,7 @@ where:
 \item $\pi_i$ is the permutation function of node $i$
 \end{itemize}
 
-The third part of the precomputation is decrypting this final value. Each node can perform part of the decryption with his private key part of $E$. in combination with the encryption specific random value which is used in ElGamal it is called the decryption share. When it multiplies the above value with the decryption share you remove your part of the encryption. So when passing your result to the next node each node can multiply it's decryption share with their input. After the last node performs this action the last nodes has the decrypted value of \eqref{form:EPiRS}. It stores this for use in the realtime phase.
+The third part of the precomputation, is about decrypting this final value. Each node can perform part of the decryption with his private key part of $E$. in combination with the encryption specific random value which is used in ElGamal it is called the decryption share. When it multiplies the above value with the decryption share you remove your part of the encryption. So when passing your result to the next node each node can multiply it's decryption share with their input. After the last node performs this action the last nodes has the decrypted value of equation \eqref{form:EPiRS}. It stores this for use in the realtime phase.
 
 \subsection{Realtime phase}
 \label{sec:realpre}
@@ -129,7 +129,7 @@ M_{out} = M_{in} \cdot K_{ci}^{-1} \cdot R_j
 \vspace{-1em}
 where:
 \begin{itemize}[label=]
-\item $M_{in}$ is one of the input messages $E$
+\item $M_{in}$ is one of the input messages
 \item $R_j$ the corresponding r of $M_{in}s$ position
 \item $K_{ci}$ Is the shared key of $M_{in}s$ position
 \end{itemize}
-- 
cgit v1.2.3-70-g09d2

