Welcome to the resource topic for 2002/055
Title:
Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity
Authors: Manoj Prabhakaran, Amit Sahai
Abstract:We consider the problem of constructing Concurrent Zero Knowledge
Proofs, in which the fascinating and useful ``zero
knowledge’’ property is guaranteed even in situations where
multiple concurrent proof sessions are executed with many
colluding dishonest verifiers. Canetti et al.
show that black-box concurrent zero knowledge proofs for
non-trivial languages require \tilde\Omega(\log k) rounds where
k is the security parameter. Till now the best known upper
bound on the number of rounds for NP languages was \omega(\log^2
k), due to Kilian, Petrank and Richardson. We establish an
upper bound of \omega(\log k) on the number of rounds for NP
languages, thereby closing the gap between the upper and lower
bounds, up to a \omega(\log\log k) factor.
ePrint: https://eprint.iacr.org/2002/055
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .