summaryrefslogtreecommitdiff
path: root/content/introduction.tex
diff options
context:
space:
mode:
authorDennis Brentjes <dennis@brentj.es>2018-08-18 14:14:55 +0200
committerDennis Brentjes <dennis@brentj.es>2018-09-02 21:56:20 +0200
commit1e316c9a7437580f499453cdafbb0c7433a46b88 (patch)
tree918079a02069294d7043412280e95a003de464f0 /content/introduction.tex
parent23968a760efa6e03e8d47fbff108ec5aae010fe3 (diff)
downloadthesis-1e316c9a7437580f499453cdafbb0c7433a46b88.tar.gz
thesis-1e316c9a7437580f499453cdafbb0c7433a46b88.tar.bz2
thesis-1e316c9a7437580f499453cdafbb0c7433a46b88.zip
Processes review comments.
Diffstat (limited to 'content/introduction.tex')
-rw-r--r--content/introduction.tex10
1 files changed, 5 insertions, 5 deletions
diff --git a/content/introduction.tex b/content/introduction.tex
index 252a831..c2ebc15 100644
--- a/content/introduction.tex
+++ b/content/introduction.tex
@@ -1,11 +1,11 @@
\section{Introduction}
-Showing that one piece of software is faster than another is somewhat of an art. Trying to keep as many of the variables the same while varying the one you are interested in is not easy. Especially when the implementations are not of the same algorithm. This is the case for the \cmix mix network, where you can choose between doing ElGamal in either multiplicative groups or in elliptic curves. This makes benchmarking the fundamental performance differences between these two difficult and interesting. This paper and companion framework implementation focuses on providing a fair comparison by between the two, by providing a common interface that can implement the \cmix primitives and can be implemented in different cryptographic back-ends.
+Showing that one piece of software is faster than another is somewhat of an art. Trying to keep as many of the variables the same while varying the one you are interested in is not easy. Especially when the implementations are not of the same algorithm. This is the case for the \cmix mix network, where you can choose between doing \elgamal in either multiplicative groups or in elliptic curves. This makes benchmarking the fundamental performance differences between these two difficult and interesting. This paper and companion framework implementation focuses on facilitating a fair comparison between the two, by providing a common interface that can implement the \cmix primitives. Allowing 2 different cryptographic back-ends to be implemented.
-To start things of, and to see if there is an benefit in using ElGamal over elliptic curves we implemented an elliptic curve and multiplicative group back-end with the same underlying cryptographic primitive library that supported both.
+The goal of this research is to verify whether there is an benefit in using \elgamal over elliptic curves. This paper implements an elliptic curve and multiplicative group. And compares them back-end with the same underlying cryptographic primitive library that supported both.
-We will try to show how \cmix works and how it needs to be implemented to be safe against some of the known attacks. Touching on some of the implementation details of problems that needed to be solved and what kind of impact that has on the run time of the algorithms. We will also discuss how we timed the applications and gathered data. Keeping in mind the limitations of the platform used.
+We will try to show how \cmix works and how it needs to be implemented to be safe against some of the known attacks of which the mitigations will influence the delay of the individual \cmix phases. Explain some of the implementation details and problems that needed to be solved and what kind of impact it had on the run time of the algorithms, and elaborate how we timed the applications and gathered data keeping in mind the limitations of the platform used.
-Finally we hope to show that both these implementations of \cmix scale linearly in the amount of clients that participate in a run, and that elliptic curve implementations for \cmix could be an interesting alternative to multiplicative group with respect run time.
+Finally we will show that both of the \cmix implementations supplied by this research paper scale linearly in the amount of clients that participate in a run, and that elliptic curve implementations for \cmix are an interesting alternative to multiplicative group with espei.
-The paper is structured as follows. First we will talk about other anonymity networks in section \ref{sec:anon}. Section \ref{sec:cmix} will talk about the \cmix network and how it works and why it works with ElGamal. Followed by section \ref{sec:implementation}; which talks about some implementation specific things. Section \ref{sec:cmixaddtions} will talk about some flaws in the original \cmix protocol and discusses how to fix them. Then we talk about the results in section \ref{sec:results}, followed by the discussion of the results in section \ref{sec:discussion}. Final thought and further research ideas are in the conclusion section \ref{sec:conclusion}. \ No newline at end of file
+The paper is structured as follows. First we will talk about other anonymity networks and their current day use in \cref{sec:anon}. In \cref{sec:cmix} we will talk about the \cmix network, how it works and why it uses \elgamal. \Cref{sec:related} discusses related work. Followed by \cref{sec:implementation}; which talks about the benchmark implementation and some implementation details. \Cref{sec:cmixaddtions} will talk about some flaws in the original \cmix protocol and discusses how to fix them. Then we talk about the results in \cref{sec:results}, followed by the discussion of the results in \cref{sec:discussion}. Final thought and further research ideas are in the conclusion \cref{sec:conclusion}. \ No newline at end of file