Gilles Brassard, Claude Crépeau, Moti Yung
Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds
ICALP, 1989.
@inproceedings{ICALP-1989-BrassardC, author = "Gilles Brassard and Claude Crépeau and Moti Yung", booktitle = "{Proceedings of the 16th International Colloquium on Automata, Languages and Programming}", doi = "10.1007/BFb0035756", isbn = "3-540-51371-X", pages = "123--136", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds}", volume = 372, year = 1989, }