zec
/
zips
mirror of https://github.com/zcash/zips.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Include a reference to [BFIJSV2010] for batch pairing verification techniques. 

Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
Daira Hopwood 2020-10-19 14:11:06 +01:00
parent 901f807125
commit 85b8f1647b
2 changed files with 20 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
protocol/protocol.tex
View File

@ -10822,6 +10822,9 @@ The observation in \crossref{concretediversifyhash} that
as \keyPrivacy for ElGamal, is due to Mary Maller. as \keyPrivacy for ElGamal, is due to Mary Maller.
} }
We thank Ariel Gabizon for teaching us the techniques of \cite{BFIJSV2010}
used in \crossref{grothbatchverify}, by applying them to \BCTV.
Numerous people have contributed to the science of zero-knowledge proving Numerous people have contributed to the science of zero-knowledge proving
systems, but we would particularly like to acknowledge the work of systems, but we would particularly like to acknowledge the work of
Shafi Goldwasser, Silvio Micali, Oded Goldreich, Charles Rackoff, Shafi Goldwasser, Silvio Micali, Oded Goldreich, Charles Rackoff,
@ -10845,6 +10848,12 @@ Peter Newell's illustration of the Jubjub bird, from \cite{Carroll1902}.
\lsection{Change History}{changehistory} \lsection{Change History}{changehistory}
\historyentry{2020.1.15}{}
\begin{itemize}
\item Include a reference to \cite{BFIJSV2010} for batch pairing verification techniques.
\end{itemize}
\historyentry{2020.1.14}{2020-08-19} \historyentry{2020.1.14}{2020-08-19}
\begin{itemize} \begin{itemize}
\item The consensus rule that a \coinbaseTransaction must not spend more than is \item The consensus rule that a \coinbaseTransaction must not spend more than is
@ -13860,6 +13869,7 @@ can be extended across a larger batch.} %pnote
\lsubsection{\GrothText{} batch verification}{grothbatchverify} \lsubsection{\GrothText{} batch verification}{grothbatchverify}
The reference verification algorithm for \Groth proofs is defined in \crossref{groth}. The reference verification algorithm for \Groth proofs is defined in \crossref{groth}.
The batch verification algorithm in this section applies techniques from \cite[section 4]{BFIJSV2010}.
Let $\ParamS{q}$, $\ParamS{r}$, $\SubgroupS{1, 2, T}$, $\SubgroupSstar{1, 2, T}$, $\GenS{1, 2, T}$, Let $\ParamS{q}$, $\ParamS{r}$, $\SubgroupS{1, 2, T}$, $\SubgroupSstar{1, 2, T}$, $\GenS{1, 2, T}$,
$\OneS$, and $\PairingS$ be as defined in \crossref{blspairing}. $\OneS$, and $\PairingS$ be as defined in \crossref{blspairing}.

10
protocol/zcash.bib
View File

@ -105,6 +105,16 @@ Lecture Notes in Computer Science; Springer, 2013.},
Received July~24, 2014.} Received July~24, 2014.}
} }
@misc{BFIJSV2010,
presort={BFIJSV2010},
author={Olivier Blazy and Georg Fuchsbauer and Malika Izabachène and Amandine Jambert and Hervé Sibert and Damien Vergnaud},
title={Batch {G}roth--{S}ahai},
url={https://eprint.iacr.org/2010/040},
urldate={2020-10-17},
howpublished={Cryptology ePrint Ar\-chive: Report 2010/040.
Last revised February~3, 2010.}
}
@misc{AKLGL2010, @misc{AKLGL2010,
presort={AKLGL2010}, presort={AKLGL2010},
author={Diego Aranha and Koray Karabina and Patrick Longa and Catherine Gebotys and Julio López}, author={Diego Aranha and Koray Karabina and Patrick Longa and Catherine Gebotys and Julio López},