Perfect zeroknowledge arguments for NP can be based on general complexity assumptions (1998)

by M Naor, R Ostrovsky, R Venkatesan, M Yung
Venue:Advances in Cryptology { Crypto 92 Proceedings, Lecture Notes in Computer Science