The Complexity of Perfect Zero-Knowledge (Extended Abstract). Fortnow, L. In Proceedings of Symposium on the Theory of Computing (STOC), pages 204-209, 1987.
The Complexity of Perfect Zero-Knowledge (Extended Abstract) [link]Paper  bibtex   
@inproceedings{ dblp4820803,
  title = {The Complexity of Perfect Zero-Knowledge (Extended Abstract)},
  author = {Lance Fortnow},
  author_short = {Fortnow, L.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {1987},
  key = {dblp4820803},
  id = {dblp4820803},
  biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/Fortnow87},
  url = {http://doi.acm.org/10.1145/28395.28418},
  conference = {STOC},
  pages = {204-209},
  text = {STOC 1987:204-209},
  booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}
}
Downloads: 0