diff options
| author | Florian Dold <florian.dold@gmail.com> | 2017-11-10 17:16:18 +0100 |
|---|---|---|
| committer | Florian Dold <florian.dold@gmail.com> | 2017-11-10 17:16:18 +0100 |
| commit | 19033df207afa602f84896370294cb9c0ec1cb45 (patch) | |
| tree | 881bdb6cead8fdbec4a7baf9de0a81a0946c4330 /games | |
| parent | fcb9c679c66dc81a0964cf9fcd85bd89d42bf485 (diff) | |
| download | papers-19033df207afa602f84896370294cb9c0ec1cb45.tar.gz papers-19033df207afa602f84896370294cb9c0ec1cb45.tar.bz2 papers-19033df207afa602f84896370294cb9c0ec1cb45.zip | |
fix kappa in income transparency game
Diffstat (limited to 'games')
| -rw-r--r-- | games/games.tex | 5 |
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? |