summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJeff Burdges <burdges@gnunet.org>2018-09-15 14:24:53 +0200
committerJeff Burdges <burdges@gnunet.org>2018-09-15 14:24:53 +0200
commit598c43f7d8743e62b881444bbfb7e8efc463ba2a (patch)
tree380b2c2ba1b60976d098862143bf2494d6af7424
parentefde510a63c28bf09079ad76d1bd05e32750a543 (diff)
downloadpapers-598c43f7d8743e62b881444bbfb7e8efc463ba2a.tar.gz
papers-598c43f7d8743e62b881444bbfb7e8efc463ba2a.tar.bz2
papers-598c43f7d8743e62b881444bbfb7e8efc463ba2a.zip
Missing notion of negligable. Or maybe this hsould be removed?
-rw-r--r--taler-fc19/paper.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/taler-fc19/paper.tex b/taler-fc19/paper.tex
index 85d37ca..cec9a7c 100644
--- a/taler-fc19/paper.tex
+++ b/taler-fc19/paper.tex
@@ -708,7 +708,7 @@ section.
\begin{definition}[Anonymity]
We say that an e-cash scheme satisfies \emph{anonymity} if the success
probability $\Prb{b \randsel \{0,1\}: \mathit{Exp}_{\cal A}^{anon}(1^\lambda,
- 1^\kappa, b) = 1}$ of the anonymity game is negligibly close to $1/$ for any
+ 1^\kappa, b) = 1}$ of the anonymity game is negligibly close to $2^{-\lambda}$ for any
polynomial time adversary~$\mathcal{A}$.
\end{definition}