Perfect Zero-Knowledge Arguments for NP can be Based on General Complexity Assumptions (1993)

by M Naor, R Ostrovsky, R Venkatesan, M Yung
Venue:Advances in Cryptology — CRYPTO ’92, LNCS 740