International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Moni Naor
Rafail Ostrovsky
Ramarathnam Venkatesan
Moti Yung
Download:
DOI: 10.1007/3-540-48071-4_14
Search ePrint
Search Google
Conference: CRYPTO 1992
BibTeX
@inproceedings{crypto-1992-1577,
  title={Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)},
  booktitle={Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={740},
  pages={196-214},
  doi={10.1007/3-540-48071-4_14},
  author={Moni Naor and Rafail Ostrovsky and Ramarathnam Venkatesan and Moti Yung},
  year=1992
}