diff options
| -rw-r--r-- | taler-fc19/paper.tex | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/taler-fc19/paper.tex b/taler-fc19/paper.tex index 18a9b08..30024a6 100644 --- a/taler-fc19/paper.tex +++ b/taler-fc19/paper.tex @@ -1084,7 +1084,6 @@ with the generic instantiation. \begin{theorem}
Our instantiation satisfies anonymity.
\end{theorem}
-% TODO: PRF suffices
\begin{proof}
We give a proof via a sequence of games $\mathbb{G}_0(b), \mathbb{G}_1(b),
@@ -1164,9 +1163,8 @@ with the generic instantiation. We observe in $\mathbb{G}_2$ that as $x_\gamma$ is uniform random and not
learned by the adversary, the generation of $(\V{skCoin}_\gamma,
\V{pkCoin}_\gamma)$ and the execution of the blinding protocol is equivalent (under the PRF assumption)
- to using the non-determinized algorithms
+ to using the randomized algorithms
$\algo{KeyGen}_{CSK}$ and $\algo{Blind}_{BS}$.
- % TODO: PRF suffices
By the blindness of the $\textsc{BlindSign}$ scheme, the adversary is not
able to distinguish blinded values from randomness. Thus, the adversary is
|