summaryrefslogtreecommitdiff
path: root/games
diff options
context:
space:
mode:
Diffstat (limited to 'games')
-rw-r--r--games/games.tex5
1 files changed, 4 insertions, 1 deletions
diff --git a/games/games.tex b/games/games.tex
index 46abb59..82825cc 100644
--- a/games/games.tex
+++ b/games/games.tex
@@ -210,11 +210,14 @@ Intuition: Adversary wins if money is in exclusive control of corrupted players
\item wallets of all non-corrupted users are augmented with their transitive closure via the \algo{Link} protocol
\item all coins from wallets of non-corrupted users are marked as spent
\item let $V_r$ be the number of valid non-spent coins in $(C_1, \dots, C_\ell)$ and $V_w$ the number of coins withdrawn by corrupted users
- \item adversary wins if $\kappa V_r > V_w$.
+ \item adversary wins if $V_r > V_w$.
\end{enumerate}
Income transparency implies unforgeability.
+Note that we want to show in the end that the probability of winning one Income Transparency game is at most $1/\kappa$.
+This is why $\kappa$ does not appear directly in the proof.
+
\subsection{Others?}
Let adversary distinguish between freshly withdrawn coin and coin obtained via refresh protocol. Why?