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