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
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
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
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
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Theoretical Computer Science
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third 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
| Hi-index | 0.00 |