Microsoft Research
Microsoft Translator |
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)

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

In  CRYPTO

Details

TypeInproceedings
Pages196-214
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)