International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Everything in NP can be Argued in <i>Perfect</i> Zero-Knowledge in a <i>Bounded</i> Number of Rounds (Extended Abstract)

Authors:
Gilles Brassard
Claude Crépeau
Moti Yung
Download:
DOI: 10.1007/3-540-46885-4_21
Search ePrint
Search Google
Conference: EUROCRYPT 1989
BibTeX
@inproceedings{eurocrypt-1989-2122,
  title={Everything in NP can be Argued in <i>Perfect</i> Zero-Knowledge in a <i>Bounded</i> Number of Rounds (Extended Abstract)},
  booktitle={Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={434},
  pages={192-195},
  doi={10.1007/3-540-46885-4_21},
  author={Gilles Brassard and Claude Crépeau and Moti Yung},
  year=1989
}