Merge branch 'master' of ssh://taler.net/papers

1 files changed, 8 insertions, 7 deletions

diff --git a/taler-fc19/paper.tex b/taler-fc19/paper.tex
index ef3368d..48c127b 100644
--- a/taler-fc19/paper.tex
+++ b/taler-fc19/paper.tex
@@ -612,7 +612,7 @@ Hence we ensure that:
   \item if a coin was refreshed, the customer ``owns'' the resulting coins,

     even if the operation was aborted, and

   \item if the customer withdraws, they can always obtain a coin whenever the

-    exchange accounted for a withdrawl, even when protocol executions are

+    exchange accounted for a withdrawal, even when protocol executions are

     intermittently aborted.

 \end{itemize}

 

@@ -1337,13 +1337,14 @@ Our instantiation satisfies {weak income transparency}.
     p_i &:= v\\

     b_i &= (\kappa - 1)v

   \end{align*}

-  and thus $\kappa p_i = b_i + p_i$.  Now

-  \begin{equation*}

+  The adversary will succeed in $1/\kappa$ runs ($p_i=v$) and looses in

+  $(\kappa-1)/\kappa$ runs ($p_i=0$). Hence:

+  \begin{align*}

     \Exp{{p \over b + p} \middle| F \neq \emptyset}

-	= |F| \sum_{R_i\in F} {p_i \over b_i + p_i} 

-    = |F| \sum_{R_i\in F} {p_i \ovver \kappa p_i}

-	= {1\over\kappa},

-  \end{equation*}

+        &= \frac{1}{|F|} \sum_{R_i\in F} {p_i \over b_i + p_i} \\

+        &= \frac{1}{\kappa |F|} \sum_{R_i\in F} {v \over 0 + v} + \frac{\kappa-1}{\kappa |F|} \sum_{R_i \in F} {0 \over v + 0} \\

+        &= {1\over\kappa},

+  \end{align*}

   which yields the equality (\ref{eq:income-transparency-proof}).

 

 As for $F = \emptyset$, the return value of the game must be $0$, we conclude