summaryrefslogtreecommitdiff
path: root/comparison/comparison.tex
diff options
context:
space:
mode:
Diffstat (limited to 'comparison/comparison.tex')
-rw-r--r--comparison/comparison.tex6
1 files changed, 3 insertions, 3 deletions
diff --git a/comparison/comparison.tex b/comparison/comparison.tex
index e1e650e..0c6b4f9 100644
--- a/comparison/comparison.tex
+++ b/comparison/comparison.tex
@@ -155,13 +155,13 @@ Taler
% TODO: Expand definition and cite the successor papers to Zerocash/BOLT
% that handle regulation?
\item \textbf{Trustless anonymity.}
- At present, divisible ecash schemes entrust anonymity properties
+ At present, divisible e-cash schemes entrust anonymity properties
to a trusted setup phase. Users cannot easily participate in this
trusted setup, so they must entrust some party with their anonymity,
and instantiating such schemes becomes difficult.
By comparison, blind signatures normally provide information theoretic security.
\item \textbf{Realistic exchange storage requirements.}
- Both compact and divisible ecash schemes require the exchange store
+ Both compact and divisible e-cash schemes require the exchange store
coins only as the smallest denomination to prevent double spending.
In practice, these schemes should be adjusted to store larger
denominations or else the exchange's storage requirements would
@@ -171,7 +171,7 @@ Taler
many coins with one single withdrawal, reducing overall bandwidth
for fixed denomination values, but not computation. %% VERIFY
Divisible e-cash schemes batch both withdrawal and deposit operations,
- providing greater bandwith reduction, and possibly computation
+ providing greater bandwidth reduction, and possibly computation
reduction. These savings are limited however by the exchange's
storage requirements, and divisible schemes depend upon trusted setup
for their anonymity properties.