Last update: Sun Jan 6 02:01:01 MST 2019
@Article{Lipmaa:2017:PEC,
author = "Helger Lipmaa",
title = "Prover-efficient commit-and-prove zero-knowledge
{SNARKs}",
journal = j-INT-J-APPL-CRYPTOGR,
volume = "3",
number = "4",
pages = "344--362",
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1504/IJACT.2017.089355",
ISSN = "1753-0563 (print), 1753-0571 (electronic)",
ISSN-L = "1753-0563",
bibdate = "Wed Jan 2 17:53:45 MST 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/ijact.bib",
URL = "https://www.inderscienceonline.com//doi/pdf/10.1504/IJACT.2017.089355",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Applied Cryptography",
journal-URL = "http://www.inderscienceonline.com/loi/ijact",
keywords = "batch verification; CaP; commit-and-prove; common
reference string; CRS; NIZK; non-interactive zero
knowledge; numerical NP-complete languages; range
proof; Subset-Sum; zk-SNARK",
}