Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with instance-dependent:
TR08-068 | 3rd July 2008
Lior Malka

Instance-Dependent Commitment Schemes and the Round Complexity of Perfect Zero-Knowledge Proofs

We study the question whether the number of rounds in public-coin perfect zero-knowledge (PZK) proofs can be collapsed to a constant. Despite extensive research into the round complexity of interactive
and zero-knowledge protocols, there is no indication how to address this question. Furthermore, the main tool to tackle this question ... more >>>

ISSN 1433-8092 | Imprint