From 6ebf7792c66b13dad54cfb515d4a54160cab621a Mon Sep 17 00:00:00 2001
From: Jeffrey Burdges <burdges@gnunet.org>
Date: Mon, 21 Aug 2017 15:16:16 +0200
Subject: Remove duplicate Robust anonymity column

---
 comparison/comparison.tex | 50 +++++++++++++++++++++++------------------------
 1 file changed, 25 insertions(+), 25 deletions(-)

diff --git a/comparison/comparison.tex b/comparison/comparison.tex
index 9c201d3..88db20d 100644
--- a/comparison/comparison.tex
+++ b/comparison/comparison.tex
@@ -32,7 +32,7 @@
 \newcommand\Y{\ding{51}} % {\checkmark}
 \newcommand\N{\ding{55}}
 
-\begin{tabular}{r|cccccccccccccc}
+\begin{tabular}{r|ccccccccccccc}
 &
 \rot{Instant enforcement} &
 \rot{Robust anonymity} &
@@ -48,7 +48,6 @@
 \rot{Cryptographic Batching} &
 \rot{Change} &
 %
-\rot{Robust anonymity} &
 \rot{Receipts} &
 \rot{Endorsed} &
 \rot{Refunds}
@@ -58,63 +57,63 @@ Taler
 &  \N &  S & \Y
 % &  $\log n$ & $\log n$ 
 &  \Y & \Y & \N & ON
-&  \Y & \Y & \Y & Anon
+&  \Y & \Y & Anon
 \\
 Digicash \cite{chaum1983,schoenmakers1997security}
-&  \Y &  ? & \Y?
+&  \Y & \Y & \Y
 &  \N &  S & \N
 % &  $\log n$ & $\log n$ 
-&  \Y & \Y & \N & ??
-&  \Y? & \N & \N & ?
+&  \Y & \Y & \N & \N
+&  \N & \N & ?
 \\
 Tracz \cite{tracz2001} % HINDE
-&  \Y? & \Y & \Y?
+&  \Y & \Y & %?
 &  \N  &  S & \N
 % &  $\log n$ & $\log n$ 
-&  \Y & \Y? & \N & ??
-&  \Y? & \N? & \N? & ? 
+&  \Y & \Y & \N & ON
+&  \N? & \N? & ? 
 \\
 Offline Chaum \cite{chaum1990}
-&  \N &  ? & \Y?
+&  \N & \N & %?
 &  \N &  S & \N
 % &  $\log n$ & $\log n$ 
-&  \Y & \N? & \N? & OFF
-&  \Y? & \N? & \N? & ?
+&  \Y & \N & OFF
+&  \N? & \N? & ?
 \\
 Compact ECash \cite{camenisch2005}
-&  \N &  ? & \Y?
+&  \N & \N & %?
 &  \N &  S & \N
 % &  $\log n$ & $\log n$ 
-&  \Y? & \N & W & OFF
-&  \N & \N? & \N? & \N?
+&  \Y & \N & W & OFF  % We're guessing trustless anonymity because not trusted setup
+&  \N? & \N? & \N?
 \\
 Martens \cite{maertens2015}
-&  \N &  ? & \Y?
+&  \N & \N & %?
 &  \N &  S & \N
 % &  $\log n$ & $\log n$ 
-&  \Y? & \N & W & OFF
-&  \N & \N? & \N? & \N?
+&  \Y & \N & W & OFF % We're guessing trustless anonymity because not trusted setup
+&  \N? & \N? & \N?
 \\
 Divisible ECash \cite{canard2015scalable}
-&  \N &  ? & \Y?
+&  \N & \N & %?
 &  \N &  S & \N
 % &  $\log n$ & $\log n$ 
 &  \N & \N & W & OFF
-&  \N & \N? & \N? & \N?
+&  \N? & \N? & \N?
 \\
 Compact Taler
 &  \Y & \Y & \Y
 &  \N &  S & \Y
 % &  $\log n$ & $\log n$ 
 &  \Y & \Y & W & ON
-&  \Y & \Y & \Y & Anon
+&  \Y & \Y & Anon
 \\
 Divisible Taler
 &  \Y & \Y & \Y
 &  \N &  S & \Y
 % &  $\log n$ & $\log n$ 
 &  \N & \Y & WD & ON
-&  \Y & \Y & \Y & Anon
+&  \Y & \Y & Anon
 \\ \hline
 \end{tabular}
 
@@ -163,9 +162,6 @@ Divisible Taler
     only uses big-O for batched withdrawal/deposit.
   \item \textbf{Change/Divisibility.}
     Which mechanism is used for divisibility?  (None/OFFline/ONline).
-  \item \textbf{Robustness under network failures.} 
-    Protocol aborts, including network failures, cannot compromise any party's
-    financial security or the customer's anonymity.
   \item \textbf{Receipts for spending.}
     The customer either can prove that they payed for
     a contract, or they can get their (unlinkable) money back.
@@ -200,6 +196,10 @@ Divisible Taler
 These are discussion items that do not necessarily need to appear in the table.
 
 \begin{itemize}
+  \item \textbf{Robustness under network failures.} 
+    Protocol aborts, including network failures, cannot compromise any party's
+    financial security or the customer's anonymity.
+
   \item \textbf{Security proofs}. % {Cryptographic assumptions.}
     Do some security proofs require the random oracle model (ROM)?
     At present, any schemes with security proofs in the standard model
-- 
cgit v1.2.3