The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to generate factored random numbers
SIAM Journal on Computing - Special issue on cryptography
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Perfect zero-knowledge in constant rounds
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Composition of Zero-Knowledge Proof Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Everything Provable is Provable in Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
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
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
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Computational complexity and knowledge complexity (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the 4th ACM conference on Computer and communications security
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Certifying Cryptographic Tools: The Case of Trapdoor Permutations
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Language Dependent Secure Bit Commitment
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
CRYPTO '95 Proceedings of the 15th 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
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Round-optimal zero-knowledge arguments based on any one-way function
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Which languages have 4-round zero-knowledge proofs?
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
Resettable statistical zero knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Hi-index | 0.00 |