diff options
author | Jeff Burdges <burdges@gnunet.org> | 2018-04-22 00:32:11 +0200 |
---|---|---|
committer | Jeff Burdges <burdges@gnunet.org> | 2018-04-22 00:32:11 +0200 |
commit | 030d30dd978f4ec34f91c40c93627e104a29e438 (patch) | |
tree | 1effe1b6500d8ad6e9e6a99bf22e91d2d25ee11f | |
parent | 7a0422b23be731132ac9245a566c0a09ef075c42 (diff) | |
download | papers-030d30dd978f4ec34f91c40c93627e104a29e438.tar.gz papers-030d30dd978f4ec34f91c40c93627e104a29e438.tar.bz2 papers-030d30dd978f4ec34f91c40c93627e104a29e438.zip |
minor
-rw-r--r-- | games/games.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/games/games.tex b/games/games.tex index 3df3a95..f9fc687 100644 --- a/games/games.tex +++ b/games/games.tex @@ -786,7 +786,7 @@ It follows that $\cal A$ has produced one-more forgery in the sense We now create an adversary $\cal A^{\textrm{rsa-omf}}$ for the blind FDH-RSA signature one-more forgery game \cite[Definition 11]{RSA-FDH-KTIvCTI} -by assigning this adversary's target RSA key randomly to one of our $d$ denomination, +by assigning this challenger's target RSA key randomly to one of our $d$ denominations, and inventing random new RSA keys for the remaining $d-1$ denominations. As this assignment is random, $\cal A^{\textrm{rsa-omf}}$ wins the one-more forgery game with $1/d$th the rate $\cal A$ wins the Taler unforgeability game. |