Efficient Modular NIZK Arguments from Shift and Product

Prastudy Fauzi; Helger Lipmaa; Bingsheng Zhang

Paper 2012/548

Efficient Modular NIZK Arguments from Shift and Product

Prastudy Fauzi, Helger Lipmaa, and Bingsheng Zhang

Abstract

We propose a non-interactive product argument, that is more efficient than the one by Groth and Lipmaa, and a novel shift argument. We then use them to design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover's computation. We construct NIZK arguments for $\mathbf{NP}$-complete languages, {\textsc{Set-Partition}}, {\textsc{Subset-Sum}} and {\textsc{Decision-Knapsack}}, with constant communication, subquadratic prover's computation and linear verifier's computation.

Note: Full version corresponding to a CANS 2013 paper

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown status
Keywords: FFT multi-exponentiation non-interactive zero knowledge product argument range argument shift argument
Contact author(s): helger lipmaa @ gmail com
History: 2013-09-09: last of 3 revisions; 2012-09-22: received; See all versions
Short URL: https://ia.cr/2012/548
License: CC BY

BibTeX

@misc{cryptoeprint:2012/548,
      author = {Prastudy Fauzi and Helger Lipmaa and Bingsheng Zhang},
      title = {Efficient Modular {NIZK} Arguments from Shift and Product},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/548},
      year = {2012},
      url = {https://eprint.iacr.org/2012/548}
}