The complexity of promise problems with applications to public-key cryptography
Information and Control
Does co-NP have short interactive proofs?
Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A note on computational indistinguishability
Information Processing Letters
The (true) complexity of statistical zero knowledge
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Statistical zero-knowledge languages can be recognized in two rounds
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Elements of information theory
Elements of information theory
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Interactive hashing can simplify zero-knowledge protocol design without computational assumptions
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Knowledge on the average—perfect, statistical and logarithmic
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Analysis of algorithms: computational methods and mathematical tools
Analysis of algorithms: computational methods and mathematical tools
On the Composition of Zero-Knowledge Proof Systems
SIAM Journal on Computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Quantifying knowledge complexity
Computational Complexity
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
On relationships between statistical zero-knowledge proofs
Journal of Computer and System Sciences
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Image Density is Complete for Non-Interactive-SZK (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Keeping the SZK-Verifier Honest Unconditionally
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
A Complete Promise Problem for Statistical Zero-Knowledge
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A theorem on probabilistic constant depth Computations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the knowledge complexity of N P
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Program checkers for algebraic problems*
Program checkers for algebraic problems*
A study of statistical zero-knowledge proofs
A study of statistical zero-knowledge proofs
Frontiers in zero knowledge
On interactive proofs with a laconic prover
Computational Complexity
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
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compression of samplable sources
Computational Complexity
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
On Pseudorandom Generators with Linear Stretch in NC0
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
The Complexity of Distinguishing Markov Random Fields
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
TCC'07 Proceedings of the 4th conference on Theory of cryptography
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
Cryptography and game theory: designing protocols for exchanging information
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
Cryptography in constant parallel time
Cryptography in constant parallel time
Unconditional characterizations of non-interactive zero-knowledge
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Theoretical Computer Science
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
Resettable statistical zero knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A surprisingly simple way of reversing trace distance via entanglement
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Security analysis of pseudo-random number generators with input: /dev/random is not robust
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.01 |
We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, called Statistical Difference, is to decide whether two efficiently samplable distributions are either statistically close or far apart. This gives a new characterization of SZK that makes no reference to interaction or zero knowledge.We propose the use of complete problems to unify and extend the study of statistical zero knowledge. To this end, we examine several consequences of our Completeness Theorem and its proof, such as:---A way to make every (honest-verifier) statistical zero-knowledge proof very communication efficient, with the prover sending only one bit to the verifier (to achieve soundness error 1/2).---Simpler proofs of many of the previously known results about statistical zero knowledge, such as the Fortnow and Aiello--Hεstad upper bounds on the complexity of SZK and Okamoto's result that SZK is closed under complement.---Strong closure properties of SZK that amount to constructing statistical zero-knowledge proofs for complex assertions built out of simpler assertions already shown to be in SZK.---New results about the various measures of "knowledge complexity," including a collapse in the hierarchy corresponding to knowledge complexity in the "hint" sense.---Algorithms for manipulating the statistical difference between efficiently samplable distributions, including transformations that "polarize" and "reverse" the statistical relationship between a pair of distributions.