Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs

Giovanni Di Crescenzo. Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs. In Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma, editors, Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Volume 1858 of Lecture Notes in Computer Science, pages 426-435, Springer, 2000. [doi]

@inproceedings{Crescenzo00:1,
  title = {Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs},
  author = {Giovanni Di Crescenzo},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1858/18580426.htm},
  researchr = {https://researchr.org/publication/Crescenzo00%3A1},
  cites = {0},
  citedby = {0},
  pages = {426-435},
  booktitle = {Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings},
  editor = {Ding-Zhu Du and Peter Eades and Vladimir Estivill-Castro and Xuemin Lin and Arun Sharma},
  volume = {1858},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67787-9},
}