From 01eabaf000e6259b93832d311f882acfda15ffde Mon Sep 17 00:00:00 2001 From: Aaron Kaiser Date: Fri, 19 May 2023 09:31:28 +0200 Subject: [PATCH] Added citation to OMDL --- thesis/sections/security_notions.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/thesis/sections/security_notions.tex b/thesis/sections/security_notions.tex index af6c722..182be9b 100644 --- a/thesis/sections/security_notions.tex +++ b/thesis/sections/security_notions.tex @@ -135,7 +135,7 @@ This thesis proves the security of the EdDSA signature scheme under two assumpti The one-more discrete logarithm assumption is stronger than the discrete logarithm assumption. In this assumption the adversary is supplied with $N$ group elements and an oracle to obtain the discrete logarithm of up to $N-1$ group elements. The task of the adversary is to output the discrete logarithm for all supplied group elements. -\begin{definition}[One-More Discrete Logarithm Problem] +\begin{definition}[One-More Discrete Logarithm Problem \cite{JC:BNPS03}] Let $\group{G}$ be a cyclic group of order $L$ with a generator $\groupelement{B}$. Let the one-more discrete logarithm game be defined in figure \ref{game:om-dlog}. The advantage of an adversary $\adversary{A}$ is defined by its ability to win the one-more discrete logarithm game. \[ \advantage{\group{G}, \adversary{A}}{OM-Dlog} \assign \prone{\text{OM-Dlog}^{\adversary{A}}} \]