The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Zero-knowledge proofs of identity
Journal of Cryptology
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Minimum-knowledge interactive proofs for decision problems
SIAM Journal on Computing
Zero-knowledge proofs of computational power (extended summary)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of the ACM (JACM)
Secret sharing and perfect zero knowledge
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Security-preserving hardness-amplification for any regular one-way function
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of 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
Zero-knowledge proofs of decision power: new protocols and optimal round-complexity
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
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
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Commital Deniable Proofs and Electronic Campaign Finance
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
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 monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Multi-authority secret-ballot elections with linear work
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On server trust in private proxy auctions
Electronic Commerce Research
A note on (im)possibilities of obfuscating programs of zero-knowledge proofs of knowledge
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Hi-index | 0.00 |
We present a short survey of known notions of zero- knowledge proof systems in the interactive model and main results about these notions. We then introduce a new notion,an extension of proofs of knowledge,which we call Proofs of Non-Zero Knowledge, as they allow a prover to convince a verifier that he knows a secret satisfying some relation, without revealing any new information about the secret or even the relation that the secret satifies with the common input. We prove a number of basic results about proofs of non-zero knowledge, and, in the process, revisit previously studied protocols, described as ‘proofs of partial knowledge’, which are particular cases of proofs of non-zero knowledge.