Round Optimal Black-Box "Commit-and-Prove"

Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan. Round Optimal Black-Box "Commit-and-Prove". 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 286-313, Springer, 2018. [doi]

@inproceedings{KhuranaOS18-0,
  title = {Round Optimal Black-Box "Commit-and-Prove"},
  author = {Dakshita Khurana and Rafail Ostrovsky and Akshayaram Srinivasan},
  year = {2018},
  doi = {10.1007/978-3-030-03807-6_11},
  url = {https://doi.org/10.1007/978-3-030-03807-6_11},
  researchr = {https://researchr.org/publication/KhuranaOS18-0},
  cites = {0},
  citedby = {0},
  pages = {286-313},
  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},
}