Computational Complexity and Knowledge Complexity

Authors:
Oded Goldreich;Rafail Ostrovsky;Erez Petrank
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
1998

Citing 0
Cited 6

A complete problem for statistical zero knowledge

Journal of the ACM (JACM)
On Interactive Proofs with a Laconic Prover

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On interactive proofs with a laconic prover

Computational Complexity
Private approximation of search problems

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Perfect non-interactive zero knowledge for NP

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
New Techniques for Noninteractive Zero-Knowledge

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in ${\cal BPP}^{\cal NP}$. Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known. In the course of our proof, we relate statistical knowledge complexity to perfect knowledge complexity; specifically, we show that, for the honest verifier, these hierarchies coincide up to a logarithmic additive term.