Merge branch 'main' of https://github.com/AAU-Dat/P10-Curdleproofs

Author: Maltesius

.github/workflows/compile_pdf.yml

@@ -26,9 +26,9 @@ jobs:
     steps:
       # Checks-out your repository under $GITHUB_WORKSPACE, so your job can access it
       - name: Checkout repository
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
       - name: Setup Python
-        uses: actions/setup-python@v4
+        uses: actions/setup-python@v5
         with:
           python-version: '3.10'
 

.github/workflows/qodana-code-quality.yaml

@@ -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}

main.pdf

@@ -1,4 +1,23 @@
 
 
 \section{Conclusion}\label{sec:conclusion}
-This is the conclusion
+After looking into the \glspl{zk} \glspl{ssle} protocol Whisk and the Curdleproofs protocol, we found that there was still was room for improvement in the Curdleproofs protocol.
+We saw the strict requirement of the shuffle size being a power of two as a limitation, and we wanted to remove this limitation to try to reduce the block overhead related to the protocol.
+
+To do this, we looked at Springproofs which allows for \glspl{ipa} to be of any size.
+Through combining the Curdleproofs protocol with the flexiblility of Springproofs, we made the CAAUrdleproofs protocol.
+The implementation of the CAAUrdleproofs protocol, is a modified version of the Curdleproofs protocol that allows for any shuffle size.
+
+Through our experiments, we found that the CAAUrdleproofs protocol has similar proving and verifying times to the Curdleproofs protocol when the shuffle size is a power of two.
+But for any shuffle size that is not a power of two, the CAAUrdleproofs protocol has a performance advantage. 
+An advantage that is bigger the more below a power of two the shuffle size is.
+
+Since CAAUrdleproofs enables the use of any shuffle size, it can be used to reduce the block overhead related to the protocol without having to compromise the security of the protocol.
+
+We have shown the security through an experiment inspired by~\cite{cryptoeprint:2022/560}.
+Here we found that the shuffle size could be reduced to 80 and still be secure, also considering the domain in which the protocol is intended.
+Using this, we see a block overhead of just 72.33\% the size compared to Curdleproof.
+ 
+
+Hence, we have shown CAAUrdleproofs to be an optimized modification of Curdleproofs, as it allows for more flexibility in the choice of shuffle size. 
+The optimization is based on reduction in size of the block overhead and faster proving and verifying times.

report/src/sections/00-abstract.tex

@@ -3,5 +3,8 @@
 \section{Acknowledgements}\label{sec:acknowledgements}
 We want to express our sincere gratitude to Daniele Dell'Aglio and Michele Albano for their supervision and guidance throughout this thesis.
 
+We also want to thank the authors of Springproofs~\cite{zhang2024springproofs} for supplying their code used which we used for reference when building CAAUrdleproofs in this thesis.
+Also we thank the authors of Larsen et al.~\cite{cryptoeprint:2022/560} for being of great help by providing answers to our questions regarding their paper on shuffle security.
+
 We also acknowledge the usage of AI tools such as ChatGPT, GitHub Copilot, and Grammarly.
 These have been used for clarification and implementation purposes.