summaryrefslogtreecommitdiff
path: root/games/games.tex
diff options
context:
space:
mode:
Diffstat (limited to 'games/games.tex')
-rw-r--r--games/games.tex9
1 files changed, 5 insertions, 4 deletions
diff --git a/games/games.tex b/games/games.tex
index f63e5dd..c2d2b41 100644
--- a/games/games.tex
+++ b/games/games.tex
@@ -429,11 +429,12 @@ Let \oraSet{Fair} stand for access to the oracles
\item Return 0 if either $U$ was corrupted or \ora{Share} was called with any of $C_0, \dots, C_n$.
\item For each $C \in \{C_0, \dots, C_n\}$, do the following:
\begin{enumerate}[label*=\arabic*.]
- \item Let $v$ denote the risiducal value of $C$ expected by $U$, meaning
- the value not consumed by constracts in $contractHashes[U]$ or
- coins refreshed from $C$ in $C_0,\ldots, C_n$.
+ \item Let $v$ denote the residual value of $C$ expected by $U$, meaning
+ the value not consumed by contracts in $contractHashes[U]$ or
+ refreshed into coins in $C_0,\ldots, C_n$.
+ Let $v'$ be the closest under-approximation to $v$ reachable by denominations in $\V{pkE}$.
\item $R \leftarrow \algo{Refresh}(\prt{B}(skE, pkE), \prt{U}(U, C))$. \\
- $R$ yields either new coins totalling $v$, or error responces favoring the adversary.
+ $R$ yields either new coins totaling $v'$, or error responses favoring the adversary.
\item Return 1 if $R$ indicates $C$ was spent on some contract $h \notin contractHashes[U]$ not known to $C$.
\item Return 1 if $R$ indicates existing refreshes (failed or succeeded) into coins not in $C_0, \dots, C_n$.
\comment{Discuss failed or succeeded}