On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On zero-knowledge proofs (extended abstract): “from membership to decision”
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The complexity of approximating entropy
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compression of samplable sources
Computational Complexity
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Proceedings of the forty-first annual ACM symposium on Theory of computing
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the complexity of computational problems regarding distributions
Studies in complexity and cryptography
SZK proofs for black-box group problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Unconditional characterizations of non-interactive zero-knowledge
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Theoretical Computer Science
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the following (promise) problem, denoted ED (for Entropy Difference): The input is a pair of circuits, and YES instances (resp., NO instances) are such pairs in which the first (resp., second) circuit generates a distribution with noticeably higher entropy.On one hand we show that any language having a (honest-verifier) statistical zero-knowledge proof is Karp-reducible to ED. On the other hand, we present a public-coin (honest-verifier) statistical zero-knowledge proof for ED. Thus, we obtain an alternative proof of Okamoto's result by which HVSZK (i.e., honest-verifier statistical zero knowledge) equals public-coin HVSZK. The new proof is much simpler than the original one. The above also yields a trivial proof that HVSZK is closed under complementation (since ED easily reduces to its complement). Among the new results obtained is an equivalence of a weak notion of statistical zero knowledge to the standard one.