Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) (1998)

Cached

Download Links

by Moni Naor , Rafail Ostrovsky , Ramarathnam Venkatesan , Moti Yung
Venue:JOURNAL OF CRYPTOLOGY
Citations:41 - 11 self