taler/exchange
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix ref

Browse Source
This commit is contained in:
Christian Grothoff 2016-10-25 14:28:09 +02:00
parent 51c04bd7d6
commit eab6bf0f07
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
doc/paper/taler.tex
View File

@ -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