diff options
| author | Jeff Burdges <burdges@gnunet.org> | 2018-09-19 18:36:17 -0400 |
|---|---|---|
| committer | Jeff Burdges <burdges@gnunet.org> | 2018-09-19 18:36:17 -0400 |
| commit | 5848fa08ed446a8fd3029b618a0f2b5dd0450a22 (patch) | |
| tree | ac203c45858e1d44165c96028ca2592504c9f896 | |
| parent | daf111ce8d9703bfe9599a93515b0b7a473d6757 (diff) | |
| download | papers-5848fa08ed446a8fd3029b618a0f2b5dd0450a22.tar.gz papers-5848fa08ed446a8fd3029b618a0f2b5dd0450a22.tar.bz2 papers-5848fa08ed446a8fd3029b618a0f2b5dd0450a22.zip | |
Attempt to explain not optimized
| -rw-r--r-- | taler-fc19/paper.tex | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/taler-fc19/paper.tex b/taler-fc19/paper.tex index 2b9f1bd..ef3368d 100644 --- a/taler-fc19/paper.tex +++ b/taler-fc19/paper.tex @@ -1293,8 +1293,11 @@ Our instantiation satisfies {weak income transparency}. where the expectation runs over
any probability space used by the adversary and challenger.
- We shall optimize our adversary in ways that maximize $p \over b + p$.
- %TODO: Explain. % We cannot actually produce this optimize adversary ourselves, but its existence suffices to prove the inequality, and restrict our analysis to them. This is not a reduction
+ We shall optimize our adversary in ways that maximize $p \over b + p$ by
+ proving the optimised adversary exists. We may then restrict our analysis
+ to these optimised adversaries, which suffices for our game result, but
+ note that reductions would not permit this trick.
+ %TODO: Improve??
As a reminder, if a refresh operation is initiated using a false commitment
that is detected by the exchange, then the new coin cannot be obtained, and
|