commit 17216dde8cf5cdec0f19da7ba31786240e4e2905
parent d6abf35a10e1a6812a98b88c9aa8201dc4637d35
Author: Casaburi Johannes <johannes.casaburi@students.bfh.ch>
Date: Mon, 3 Jun 2024 15:14:29 +0200
small changes doc
Diffstat:
5 files changed, 10 insertions(+), 11 deletions(-)
diff --git a/doc/thesis/chapters/background/blindsign.tex b/doc/thesis/chapters/background/blindsign.tex
@@ -1,15 +1,14 @@
-\section{Cryptography Preliminaries}
-The project is based on existing cryptography. The most important cryptographic elements are described in this section. All cryptographic elements used by the Donau are from GNU Taler libraries.
+\section{Blind Signatures}
+The project is based on existing cryptography. One important cryptographic scheme used in the Donau is the blind signature scheme. It is an extension of digital signatures which provides privacy by allowing a user to obtain a signature for a message, without revealing the contents of the message to the signer. All cryptographic elements used by the Donau where privided by the GNU Taler libraries.
-\subsection{Blinded Signature Schemes}
This section only provides an overview of blinded signatures. Detailed information about blinded signature can be found at \url{https://taler.net/papers/cs-thesis.pdf}. Blinded signatures are the key elements to reach privacy for the donor (see chapter xx). With blinded signatures a blinded unrecognizable message was signed. Only the creator of the blinded message is able to unblind the signature and therefore to receive a valid signature for the unblinded message. The Donau system uses blinded signatures to bind the identity to a donation receipt while hiding the identity of the donor. As a result of the property of blindness, the blind signer Donau is not able to link the cleartext message with the made blind signature or the blind with the unblind signature \cite[p.12]{cryptoeprint:2019/877}. There are multiple blind signature schemes. The Donau distinguishes the following two equivalent blind signature schemes:
-\subsubsection{RSA Blind Signature Scheme}
+\subsection{RSA}
Concrete the RSA-FDH blind signatures are used. Before blinding, to eliminate certain attacks, a Full-Domain Hash on the message is applied. Full-Domain means the hash has the same size as the RSA modulus. The blind signature scheme is similar to the normal RSA signatur scheme. In addition to the normal scheme, the message is blinded with an private and random value. Practically the length of the modulus and therefore for the key size, signature size and the security level is variable. The scheme only has one round trip.\cite{nigelcrypto:2016}
-\subsubsection{Clause Blind Schnorr Signature Scheme}
+\subsection{Clause Schnorr (CS)}
The Clause Schnorr Signature Scheme differs from the RSA scheme. Initially the blinder needs two random values from the signer party. One random value from the signer and two random private values are required to blind the message once. This process is repeated and the two blinded messages are sent to the signer, who randomly selects a blinded message for blinding. Two blinded messages are needed to prevent an certain type of attack. In comparision to the RSA scheme, the Clause Schnorr Scheme needs an additional round trip to get the inital nonces from the signer. However, the individual crypto operations are so much faster than the operations from the RSA scheme that the additional round trip is no longer significant. See the measurements for this [p.107-121] \cite{DemHeuz2022}. Because clause schnorr signatures are based on elliptic curves, smaller keys can be used. GNU Taler supports one fixed 256 bit key size, which provides an security level of 128 bits.
-\subsubsection{EdDSA Signatures}
+\subsection{EdDSA Signatures}
For normal, not blinded, signatures, the Donau uses EdDSA signatures. The Edwards-curve Digital Signature Algorithm or for short EdDSA is a scheme for digital signatures based on the twisted Edwards elliptic curves and the Schnorr signature scheme. EdDSA signatures using the curve Curve25519 are also called Ed25519. The Donau only uses Ed25519. Whether Curve25519 or the Edwards-curve, the scheme is very efficient and secure.\cite{BernsteinEd25519}
diff --git a/doc/thesis/chapters/background/taler.tex b/doc/thesis/chapters/background/taler.tex
@@ -2,8 +2,7 @@
GNU Taler is an open protocol for electronic payment system using blind signatures to protect the privacy of the customer.
One key component of the GNU Taler payment system is the exchange which is responsible for exchanging existing money into electronic money. Customers can retrieve funds from the exchange to make anonymous payments. The merchant is not anonymous and thus can not hide the income. This helps to avoid tax evasion and money laundering \cite{taler}.
-%...
-In GNU Taler, the value of a coin are represented as a denomination, which contains the unit of currency and the face value of the given coin. Each denomination contains a cryptographic public key used by the exchange to verify the denomination.
-
-%...maybe not in background but intro
+GNU Taler uses denominations to represent the values of a coins. A denomination contains the unit of currency and the face value of a given coin. Each denomination contains a cryptographic public key used by the exchange to verify the denomination.
+%...maybe not in background but intro?
The Donau is based on the exchange and requires some of its parts to function. The concept of the denomination was adapted into the donation units, which are used to represent the face value of a donation.
+
diff --git a/doc/thesis/chapters/intro/abstract.tex b/doc/thesis/chapters/intro/abstract.tex
@@ -2,7 +2,7 @@
This project describes the design of a privacy-preserving donation
system. The central entity in the design is the donation authority
(Donau) which was implemented in free software in the context of the
-GNU Taler project. While implemented primarily for GNU TAler, the
+GNU Taler project. While implemented primarily for GNU Taler, the
system could in principle work with other payment systems.
%mention donation fraud
diff --git a/doc/thesis/chapters/intro/acknowledgements.tex b/doc/thesis/chapters/intro/acknowledgements.tex
@@ -4,3 +4,4 @@ A special thank to Michiel Leenaars from the NLnet foundation who had the initia
We would also like to thank our expert Daniel Voisard for his feedback during the project.
Further we would also like to thank Christian Blättler for his contributions to GNUnet, on which our project relies on.
We would like to mention that we have used DeepL for word translations.
+%tax auth zurich
diff --git a/doc/thesis/thesis.pdf b/doc/thesis/thesis.pdf
Binary files differ.
