Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

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.

ICALP 1989
DBLP
Scholar
DOI
Full names Links ISxN
@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,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.