On the complexity of bounded-interaction and non-interactive zero-knowledge proofs (1994)

by J Kilian
Venue:Proceedings of the 35th IEEE Symposium on the Foundation of Computer Science