Random generation of combinatorial structures from a uniform
Theoretical Computer Science
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth 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
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
On the composition of zero-knowledge proof systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
The (true) complexity of statistical zero knowledge
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Languages that are easier than their proofs
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Quantifying knowledge complexity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Perfect zero-knowledge languages can be recognized in two rounds
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Interactive proof systems: Provers that never fail and random selection
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Algebraic methods for interactive proof systems
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Computational complexity and knowledge complexity (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Knowledge on the average—perfect, statistical and logarithmic
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Private approximation of search problems
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
| Hi-index | 0.00 |