Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam. Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. In Amos Beimel, Stefan Dziembowski, editors, Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I. Volume 11239 of Lecture Notes in Computer Science, pages 263-285, Springer, 2018. [doi]

@inproceedings{HazayV18,
  title = {Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations},
  author = {Carmit Hazay and Muthuramakrishnan Venkitasubramaniam},
  year = {2018},
  doi = {10.1007/978-3-030-03807-6_10},
  url = {https://doi.org/10.1007/978-3-030-03807-6_10},
  researchr = {https://researchr.org/publication/HazayV18},
  cites = {0},
  citedby = {0},
  pages = {263-285},
  booktitle = {Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I},
  editor = {Amos Beimel and Stefan Dziembowski},
  volume = {11239},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-03807-6},
}