Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, and Moti Yung

Details

Publication typeInproceedings
Published inCRYPTO
Pages196-214
> Publications > Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)