rixxc/masterthesis
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Removed line numbers in figures

Browse Source
This commit is contained in:
Aaron Kaiser
2023-06-12 11:53:44 +02:00
parent 9ba0bc2ef3
commit 3df7ccbfe4
10 changed files with 82 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
thesis/sections/security_notions.tex
View File

@@ -36,7 +36,7 @@ A common security notion for digital signature schemes is the existential unforg
\State \Return $\exists i \in \{1,2,...,N\}: \verify(\pubkey_i, \m^*, \signature^*) \test 1 \wedge (\pubkey_i, \m^*) \notin M$
\end{algorithmic}
\vspace{2mm}
\begin{algorithmic}[1]
\begin{algorithmic}
\Statex \underline{\oracle \Osign($i \in \{1,2,...,n\}$, $\m \in \messagespace$)}
\State $\signature \randomassign \sign(\privkey_i, \m)$
\State $M \assign M \cup \{(\pubkey_i, \m)\}$
@@ -67,7 +67,7 @@ A common security notion for digital signature schemes is the existential unforg
\State \Return $\exists i \in \{1,2,...,N\}: \verify(\pubkey_i, \m^*, \signature^*) \test 1 \wedge (\pubkey_i, \m^*, \signature^*) \notin M$
\end{algorithmic}
\vspace{2mm}
\begin{algorithmic}[1]
\begin{algorithmic}
\Statex \underline{\oracle \Osign($i \in \{1,2,...,n\}$, $\m \in \messagespace$)}
\State $\signature \randomassign \sign(\privkey_i, \m)$
\State $M \assign M \cup \{(\pubkey_i, \m, \signature)\}$
@@ -91,7 +91,7 @@ The MU-UF-NMA security game is similar to the MU-EUF-CMA game. The only differen
\begin{figure}[h]
\hrule
\vspace{1mm}
\begin{algorithmic}[1]
\begin{algorithmic}
\State \underline{\game $\text{MU-UF-NMA}$}
\State \textbf{for} $i \in \{1,2,...,N\}$
\State \quad $(\pubkey_i, \privkey_i) \randomassign \keygen(1^\secparamter)$
@@ -118,7 +118,7 @@ This thesis proves the security of the EdDSA signature scheme under two assumpti
\begin{figure}[h]
\hrule
\vspace{1mm}
\begin{algorithmic}[1]
\begin{algorithmic}
\Statex \underline{\game Dlog}
\State $a \randomsample \field{L}$
\State $\groupelement{A} \assign a \groupelement{B}$
@@ -144,7 +144,7 @@ The one-more discrete logarithm assumption is stronger than the discrete logarit
\begin{figure}[h]
\hrule
\vspace{1mm}
\begin{algorithmic}[1]
\begin{algorithmic}
\Statex \underline{\game OM-Dlog}
\State \textbf{for} $i \in \{1,2,...,N\}$
\State \quad $a_i \randomsample \field{L}$