Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Zero-knowledge Perfect:
TR09-132 | 8th December 2009
Lior Malka

How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge

Perfect zero-knowledge (PZK) proofs have been constructed in various settings and they are
also interesting from a complexity theoretic perspective. Yet, virtually nothing is known about them. This is in contrast to statistical zero-knowledge proofs, where many general results have been proved using an array of tools, none of which ... more >>>

ISSN 1433-8092 | Imprint