@inproceedings {26616,
	title = {Efficient Modular NIZK Arguments from Shift and Product},
	journal = {Cryptology and Network Security (CANS 2013)},
	volume = {8257371918411522619174},
	year = {2013},
	pages = {92 - 121},
	publisher = {Springer International Publishing},
	address = {Cham},
	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{\textquoteright}s computation. We construct NIZK arguments for\&nbsp;NP-complete languages,\&nbsp;Set-Partition,\&nbsp;Subset-Sum\&nbsp;and\&nbsp;Decision-Knapsack, with constant communication, subquadratic prover{\textquoteright}s computation and linear verifier{\textquoteright}s computation.},
	isbn = {978-3-319-02936-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-02937-510.1007/978-3-319-02937-5_6},
	url = {https://link.springer.com/chapter/10.1007/978-3-319-02937-5_6},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Zhang, Bingsheng},
	editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Jon M. {Kleinberg} and Mattern, Friedemann and John C. {Mitchell} and Naor, Moni and Nierstrasz, Oscar and Rangan, Pandu and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Moshe Y. {Vardi} and Weikum, Gerhard and Abdalla, Michel and Nita-Rotaru, Cristina and Dahab, Ricardo}
}
