[taler-anastasis] branch master updated (bfc57d0 -> b84bb6d)

[gnunet]

This is an automated email from the git hooks/post-receive script.

dennis-neufeld pushed a change to branch master
in repository anastasis.

    from bfc57d0  moved glossary
     new b4c170c  consistence upper/lower case
     new b84bb6d  consistence upper/lower case

The 2 revisions listed above as "new" are entirely new to this
repository and will be described in separate emails.  The revisions
listed as "add" were already present in the repository and have only
been added to this reference.


Summary of changes:
 doc/thesis/implementation.tex |  2 +-
 doc/thesis/related_work.tex   | 16 ++++++++--------
 2 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/doc/thesis/implementation.tex b/doc/thesis/implementation.tex
index d5c4a0d..25bd10f 100644
--- a/doc/thesis/implementation.tex
+++ b/doc/thesis/implementation.tex
@@ -176,7 +176,7 @@ provide for example the PIN sent to them via SMS with the 
same request
 as before (GET /truth/\$TRUTH\_PUB?resonse=\$RESPONSE).
 
 
-\subsection{Client Application Command Line Interface (CLI)}
+\subsection{Client application command line interface (CLI)}
 
 There are two client applications which interact with the user. First
 the Anastasis {\em splitter} and second the Anastasis {\em
diff --git a/doc/thesis/related_work.tex b/doc/thesis/related_work.tex
index bbf71ca..7564b7d 100644
--- a/doc/thesis/related_work.tex
+++ b/doc/thesis/related_work.tex
@@ -143,9 +143,9 @@ the players is called \textit{dealer}.
 In Anastasis the user is the trusted dealer who splits the secret and
 also reconstructs it.
 
-\subsubsection{Shamir's Secret Sharing} \label{sec:rel:shamir}
+\subsubsection{Shamir's secret sharing} \label{sec:rel:shamir}
 
-The algorithm ``Shamir's Secret Sharing'' is probably the most well
+The algorithm ``Shamir's secret sharing'' is probably the most well
 known secret sharing scheme. It ``divide[s] data D into n pieces in
 such a way that D is easily reconstructible from any k pieces, but
 even complete knowledge of $k - 1$ pieces reveals absolutely no
@@ -162,7 +162,7 @@ some inconsistent shares to the others. Also, in some 
scenarios the
 dealer cannot be trusted with the knowledge of the original core
 secret.
 
-Additionally, Shamir's Secret Sharing is inflexible because it is a
+Additionally, Shamir's secret sharing is inflexible because it is a
 simple $k$-out-of-$n$ threshold scheme.  While this makes the scheme
 reasonably efficient even for big values of $n$, efficiency with
 respect to a large number of escrow providers and authorization
@@ -176,7 +176,7 @@ $k$-out-of-$n$. Each user of Anastasis is also able to 
decide which
 combinations of \textit{players}, which in case of Anastasis are the 
 escrow providers, shall be permitted.
 
-\subsubsection{Verifiable Secret Sharing}
+\subsubsection{Verifiable secret sharing}
 
 Verifiability can be achieved by using so called commitment schemes
 like the Pederson commitment. It allows ``to distribute a secret to n
@@ -186,16 +186,16 @@ persons''~\cite{pedersen_sharing_0}. In his paper ``A 
Practical Scheme
 for Non-interactive Verifiable Secret
 Sharing''~\cite{feldman_sharing}, Paul Feldman combines the two
 schemes Shamir Secret Sharing and Pederson commitment. His algorithm
-for verifiable secret sharing, short VSS, allows each recipient to
-verify the correctness of his share. But like in the Shamir Secret
-Sharing scheme, the dealer in the Verifiable Secret Sharing scheme
+for verifiable secret sharing (VSS), allows each recipient to
+verify the correctness of their share. But like in the Shamir Secret
+Sharing scheme, the dealer in the VSS scheme
 also can't be trusted with the knowledge of the original core secret.
 
 Because in Anastasis each user can act as their own trusted dealer,
 the shares must not be verified and therefore Anastasis do not need
 any form of VSS.
 
-\subsubsection{Distributed Key Generation}
+\subsubsection{Distributed key generation}
 
 Distributed key generation (DKG) algorithms solve the problem of
 needing a trustworthy dealer by instead relying on a threshold of

-- 
To stop receiving notification emails like this one, please contact
gnunet@gnunet.org.