Merge pull request #34 from AAU-Dat/Related-work

Related work

Author: ironmand123

report/src/sections/00-abstract.tex

@@ -1,6 +1,15 @@
 
 \begin{abstract}
-    This is the abstract~\cite{greenwade1993}.
+    Ethereum is one of the biggest proof-of-stake blockchains.
+    However, it is still vulnerable to attacks.
+    One such attack is made possible by Heimbach et al.~where an adversary could de-anonymize validators and then preform a denial-of-service attack on them.
+    To try and combat this attack, Ethereum has proposed the use of the Whisk protocol.
+    Whisk is a Single secret leader election protocol that uses a zero-knowledge proof called Curdleproofs that uses inner product arguments to proof the validity of a shuffle of validators.
+    This paper improves upon Curdleproofs' inner product arguments by introducing CAAUrdleproofs, which is a modified version of Curdleproofs with ideas from Springproofs as to allow for the use of any shuffle size.
+    We show that CAAUrdleproofs has similar proving and verifying times to Curdleproofs when the shuffle size is a power of two.
+    We also show that CAAUrdleproofs has a performance advantage for any shuffle size that is not a power of two, and that this advantage grows the lower the shuffle size is below a power of two.
+    After performing experiments, we also suggest a new shuffle size which is smaller than the current one used in Curdleproofs that would result in a smaller block overhead than the one created by the current Curdleproofs protocol.
+
 \end{abstract}
 
 \begin{IEEEkeywords}