Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple and fast probabilistic algorithm for computing square roots modulo a prime number
IEEE Transactions on Information Theory
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
Demonstrating that a public predicate can be satisfied without revealing any information about how
Proceedings on Advances in cryptology---CRYPTO '86
Cryptographic capsules: a disjunctive primitive for interactive protocols
Proceedings on Advances in cryptology---CRYPTO '86
Proceedings on Advances in cryptology---CRYPTO '86
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th 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
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
Cryptographic capsules: a disjunctive primitive for interactive protocols
Proceedings on Advances in cryptology---CRYPTO '86
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Proceedings on Advances in cryptology---CRYPTO '86
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
CRYPTO '88 Proceedings on Advances in cryptology
Journal of the ACM (JACM)
On the concrete complexity of zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
How convincing is your protocol?
ACM SIGACT News
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A taxonomy of proof systems (part 2)
ACM SIGACT News
Journal of the ACM (JACM)
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Secure set membership using 3SAT
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
The marriage proposals problem: fair and efficient solution for two-party computations
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
| Hi-index | 0.00 |
A zero-knowledge interactive proof is a protocol by which Alice can convince a polynomially-bounded Bob of the truth of some theorem without giving him any hint as to how the proof might proceed. Under cryptographic assumptions, we give a general technique for achieving this goal for every problem in NP. This extends to a presumably larger class, which combines the powers of non-determinism and randomness. Our protocol is powerful enough to allow Alice to convince Bob of theorems for which she does not even have a proof: it is enough for Alice to convince herself probabilistically of a theorem, perhaps thanks to her knowledge of some trap-door information, in order for her to be able to convince Bob as well, without compromising the trap-door in any way.