From 4035e4c5e054d1787f50c4ba980d44506568c22c Mon Sep 17 00:00:00 2001 From: Daira Hopwood Date: Mon, 4 Jun 2018 17:15:31 +0100 Subject: [PATCH] Correct a reference. Signed-off-by: Daira Hopwood --- protocol/protocol.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/protocol/protocol.tex b/protocol/protocol.tex index 80fce4cc..089c6ada 100644 --- a/protocol/protocol.tex +++ b/protocol/protocol.tex @@ -5438,7 +5438,7 @@ $\PedersenHash$ is an algebraic \hashFunction with \collisionResistance Discrete Logarithm Problem on the \jubjubCurve. It is based on the work of David Chaum, Ivan Damgård, Jeroen van de Graaf, Jurjen Bos, George Purdy, Eugène van Heijst and Birgit Pfitzmann in -\cite{CDG1987}, \cite{BCP1988} and \cite{CvHP1991}, +\cite{CDvdG1987}, \cite{BCP1988} and \cite{CvHP1991}, and of Mihir Bellare, Oded Goldreich, and Shafi Goldwasser in \cite{BGG1995}, with optimizations for efficient instantiation in \zkSNARKCircuits by Sean Bowe and Daira Hopwood. @@ -5588,7 +5588,7 @@ A mixing \xPedersenHash is used to compute $\NoteAddressRand$ from $\cm$ and $\NotePosition$ in \crossref{commitmentsandnullifiers}. It takes as input a \xPedersenCommitment $P$, and hashes it with another input $x$. -Let $\NotePositionBase = \FindGroupJHashOf{\ascii{Zcash\_J\_}, \ascii{}}$. +Define $\NotePositionBase := \FindGroupJHashOf{\ascii{Zcash\_J\_}, \ascii{}}$. We define $\MixingPedersenHash \typecolon \GroupJ \times \range{0}{\ParamJ{r}-1} \rightarrow \GroupJ$ by: