diff options
author | Jeff Burdges <burdges@gnunet.org> | 2018-04-21 18:46:24 +0200 |
---|---|---|
committer | Jeff Burdges <burdges@gnunet.org> | 2018-04-21 18:46:24 +0200 |
commit | 4f892c80407d985bbc600fe65184ac62e00c065f (patch) | |
tree | be9a5ce9da6dde15626b596197fc1d62be3ca46a /games | |
parent | b1f7f9a109d4d7b0e3761244e38d14c0016cd541 (diff) | |
download | papers-4f892c80407d985bbc600fe65184ac62e00c065f.tar.gz papers-4f892c80407d985bbc600fe65184ac62e00c065f.tar.bz2 papers-4f892c80407d985bbc600fe65184ac62e00c065f.zip |
typeo
Diffstat (limited to 'games')
-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 2c633f6..ba0ed58 100644 --- a/games/games.tex +++ b/games/games.tex @@ -775,7 +775,7 @@ We know $\cal A$ made at most $l$ withdrawal and refresh oracle queries to obtain the $l+1$ coins $C_1, \ldots, C_\ell$, so $\cal A$ made at most $m$ withdrawal and refresh oracle queries to obtain the $m+1$ RSA signatures %, aka inversions, - on the $Y_i := \testrm{FDH}_N(C_i)$ with $0 \le i \le m$. + on the $Y_i := \textrm{FDH}_N(C_i)$ with $0 \le i \le m$. % It follows that $\cal A$ has produced one-more forgery in the sense of \cite[Definition 11]{RSA-FDH-KTIvCTI} , |