related work

Author: ironmand123

report/src/main.tex

@@ -18,12 +18,13 @@
     \input{sections/01-introduction}
     \input{sections/02-related-work}
     \input{sections/03-background}
-    \input{sections/04-experimental-protocol}
-    \input{sections/05-results}
-    \input{sections/06-discussion}
-    \input{sections/07-conclusion}
-    \input{sections/08-future-works}
-    \input{sections/09-acknowledgements}
+    \input{sections/04-approach}
+    \input{sections/05-experimental-protocol}
+    \input{sections/06-results}
+    \input{sections/07-discussion}
+    \input{sections/08-conclusion}
+    \input{sections/09-future-works}
+    \input{sections/10-acknowledgements}
 
     \clearpage
     %\printglossary[type=\acronymtype]

report/src/sections/04-Approach.tex

@@ -1,15 +1,36 @@
-%! Author = olive
-%! Date = 28/04/2025
+\section{approach}\label{sec:approach}
 
-% Preamble
-\documentclass[11pt]{article}
 
-% Packages
-\usepackage{amsmath}
+\subsection{Shuffle security}\label{sec:approach-shuffle-security}
+The shuffle method proposed by Larsen et al.~\cite{cryptoeprint:2022/560} that was used in curdleproofs is based on the idea of shuffling a list of proposers over a set of slots.
+The shuffle itself however is not too complex.
+A formal definition of the shuffle is given in~\autoref{fig:shuffle}.
 
-% Document
-\begin{document}
+\begin{figure}[ht]\label{fig:shuffle}
 
+    \begin{framed}
+        \[
+            \Pi(c_1, \ldots, c_n)
+        \]
+        \rule{\linewidth}{0.4pt}
+
+        \noindent
+        \textbf{for} $t \in [T]$ \textbf{:}
+        \begin{itemize}
+            \item[$S_t$] picks random $\{i_1, \ldots, i_k\} \subset [n]$
+            \item[$S_t$] computes $(\tilde{c}_{i_1}, \ldots, \tilde{c}_{i_k}) \leftarrow \text{Shuffle}(c_{i_1}, \ldots, c_{i_k})$
+            \item[$S_t$] publishes $(\tilde{c}_{i_1}, \ldots, \tilde{c}_{i_k})$
+        \end{itemize}
+    \end{framed}
+    \caption{Distributed shuffling protocol.}
+\end{figure}
+
+Here the set $(c_1, \ldots, c_n)$ is a set of ciphertexts that are shuffled over $T$ slots.
+
+\subsection{Springproofs}\label{sec:approach-springproofs}
+
+
+
+\subsection{implementation}\label{sec:approach-implementation}
 
 
-\end{document}

report/src/setup/preamble.tex

@@ -13,6 +13,9 @@
 \usepackage{booktabs}
 \usepackage{graphicx}
 \usepackage{tikz}
+\usepackage{algorithm}
+\usepackage{algorithmic}
+\usepackage{algpseudocode}
 \usetikzlibrary{arrows.meta,arrows}