Joe Kilian. On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs. In 35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA. pages 466-477, IEEE, 1994.
@inproceedings{Kilian94,
title = {On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs},
author = {Joe Kilian},
year = {1994},
researchr = {https://researchr.org/publication/Kilian94},
cites = {0},
citedby = {0},
pages = {466-477},
booktitle = {35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA},
publisher = {IEEE},
}