From 7bdccf24787ec1e3a62a1b2c17588926992bf9bd Mon Sep 17 00:00:00 2001 From: Aaron Kaiser Date: Fri, 24 Feb 2023 12:04:00 +0100 Subject: [PATCH] Minor fix --- thesis/Abschlussarbeit.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/thesis/Abschlussarbeit.tex b/thesis/Abschlussarbeit.tex index 883993e..3fc4330 100644 --- a/thesis/Abschlussarbeit.tex +++ b/thesis/Abschlussarbeit.tex @@ -109,11 +109,11 @@ TODO \subsection{Security Notions} -\subsection{Digital Signature Scheme} +\subsubsection{Digital Signature Scheme} \subsubsection{\cma} -\cma is a security notion for digital signature schemes. In this game the attacker is given access to a \Osign oracle, which generates valid signatures for arbitrary messages. The attacker wins the game if he is able to provide a message signature pair which is valid and was not generated by the \Osign oracle. The security game is depicted in figure \ref{game:cma} +\cma is a security notion for digital signature schemes. In this game the attacker is given access to a \Osign oracle, which generates valid signatures for arbitrary messages. The attacker wins the game if he is able to provide a message signature pair which is valid and was not generated by the \Osign oracle. The security game is depicted in figure \ref{game:cma}. Let $SIG = (\keygen, \sign, \verify)$ be a digital signature scheme. $SIG$ is \cma secure if for all ppt adversaries $\adversary{A}$ the $\advantage{SIG,\adversary{A}}{\cma}(k)$ is negligible in k.