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

Add Dlog' ggm proof

Browse Source
This commit is contained in:
Aaron Kaiser
2023-05-09 10:01:01 +02:00
parent 8a7b0d4d75
commit 56f6c785bb
9 changed files with 280 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
thesis/sections/preliminaries.tex
View File

@@ -17,7 +17,7 @@ While modifying the games it has to be ensured that the advantage for an attacke
\begin{lemma}[Fundamental lemma of game-playing]
Let G and H be identical-until-bad games and let $\adversary{A}$ be an adversary. Then,
\[ Adv(G^{\adversary{A}}, H^{\adversary{A}}) \leq \Pr[bad] \]
\[ Adv(G^{\adversary{A}}, H^{\adversary{A}}) = |\prone{G^{\adversary{A}}} - \prone{H^{\adversary{A}}}| \leq \Pr[bad] \]
\end{lemma}
This means that the advantage to distinguish between two identical-until-bad games is bound by the probability of the bad flag being set. A proof for this lemma can be found in \cite{EC:BelRog06}.