Searching for "Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
by Gilles Brassard, Departement Iro, Universite De Montreal, Claude Crepeau, Moti Yung — 1989
…Everything in NP can be argued in perfectper fect zeroknowledge in a boundedbounded number…
Cited by 27 (5 self) – Add To MetaCart

Sorting Out Zero-Knowledge
by Gilles Brassard, Claude Crepeau — 1990
… in the case of [BCC]). For a full discussion of the fact that everything in NP can be argued in perfect zero-knowledge…
Cited by 11 (4 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB