Searching for "Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds." – sorted by Relevance.

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

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

1 documents found, showing 1 through 1.

Black-Box Concurrent Zero-Knowledge Requires (almost) Logarithmically Many Rounds
by Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen — 2002 — SIAM Journal on Computing
…Black-Box Concurrent Zero-Knowledge Requires (almost) Logarithmically Many Rounds Ran Canetti y…
Cited by 56 (5 self) – Add To MetaCart

Showing 1 through 1.

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