From eab6bf0f07a73e283be05ae95fcdc01001c83003 Mon Sep 17 00:00:00 2001 From: Christian Grothoff Date: Tue, 25 Oct 2016 14:28:09 +0200 Subject: [PATCH] fix ref --- doc/paper/taler.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/doc/paper/taler.tex b/doc/paper/taler.tex index 63019c222..9f8ee8239 100644 --- a/doc/paper/taler.tex +++ b/doc/paper/taler.tex @@ -477,7 +477,7 @@ key is only known to the owner of the coin. A coin derives its financial value from an RSA signature over a the full domain hash (FDH) of the coin's public key. An FDH is used so that ``one-more forgery'' is provably hard assuming the RSA known-target inversion -problem is hard~cite[Theorem 12]{RSA-HDF-KTIvCTI}. The exchange has +problem is hard~\cite[Theorem 12]{RSA-HDF-KTIvCTI}. The exchange has multiple RSA {\em denomination key} pairs available for blind-signing coins of different value. @@ -1099,7 +1099,7 @@ actually facilitates voluntary cooperation between the exchange and criminals~\cite{sander1999escrow} and where the state could deanonymize citizens. -\subsection{Offline Payments} +%\subsection{Offline Payments} Chaum's original proposals for anonymous digital cash avoided the need for online interactions with the exchange to detect double spending by @@ -1122,7 +1122,7 @@ coin after restoring from backup. %subjected to financial penalties by the state in relation to the %amount transferred by the traditional currency transfer. -\subsection{Cryptographic proof vs. evidence} +% \subsection{Cryptographic proof vs. evidence} In this paper we have use the term ``proof'' in many places as the protocol provides cryptographic proofs of which parties behave