Welcome to the resource topic for 2012/548
Title:
Efficient Modular NIZK Arguments from Shift and Product
Authors: Prastudy Fauzi, Helger Lipmaa, 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.
ePrint: https://eprint.iacr.org/2012/548
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .