The complexity of zero knowledge

Authors:
Salil Vadhan
Affiliations:
School of Engineering and Applied Science, Harvard University, Cambridge, MA
Venue:
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Year:
2007

Citing 58
Cited 0

Trading group theory for randomness

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Statistical zero-knowledge languages can be recognized in two rounds

Journal of Computer and System Sciences
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
A note on efficient zero-knowledge proofs and arguments (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems

Journal of the ACM (JACM)
IP = PSPACE

Journal of the ACM (JACM)
On the power of multi-prover interactive protocols

Theoretical Computer Science
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
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)
On the limits of non-approximability of lattice problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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)
A Pseudorandom Generator from any One-way Function

SIAM Journal on 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
Quantum lower bound for the collision problem

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Computationally Sound Proofs

SIAM Journal on Computing
A complete problem for statistical zero knowledge

Journal of the ACM (JACM)
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
imits on the Power of Quantum Statistical Zero-Knowledge

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Image Density is Complete for Non-Interactive-SZK (Extended Abstract)

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Direct Minimum-Knowledge Computations

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
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
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
Universal Arguments and their Applications

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Bounded-concurrent secure multi-party computation with a dishonest majority

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The random oracle methodology, revisited

Journal of the ACM (JACM)
New and improved constructions of non-malleable cryptographic protocols

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The complexity of computing a Nash equilibrium

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero knowledge with efficient provers

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Settling the Complexity of Two-Player Nash Equilibrium

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Statistically-hiding commitment from any one-way function

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On Worst-Case to Average-Case Reductions for NP Problems

SIAM Journal on Computing
An Unconditional Study of Computational Zero Knowledge

SIAM Journal on Computing
Adiabatic Quantum State Generation

SIAM Journal on Computing
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
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
Finding pessiland

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own right.