Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems

Authors:
Danny Gutfreund;Michael Ben-Or
Affiliations:
-;-
Venue:
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Year:
2000

Citing 17
Cited 0

Non-interactive zero-knowledge and its applications

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
Public-key cryptosystems provably secure against chosen ciphertext attacks

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Noninteractive zero-knowledge

SIAM Journal on Computing
On relationships between statistical zero-knowledge proofs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Image Density is Complete for Non-Interactive-SZK (Extended Abstract)

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Complete Promise Problem for Statistical Zero-Knowledge

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Computationally efficient error-correcting codes and holographic proofs

Computationally efficient error-correcting codes and holographic proofs
Minimum resource zero knowledge proofs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Multiple non-interactive zero knowledge proofs based on a single random string

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input to the protocol (i.e. the statement to prove). We show in these models a non-interactive statistical zero-knowledge proof for every language that has (interactive) statistical zero-knowledge proof, and a computational zero-knowledge proof for every language in NP. We also show how to change the latter proof system to fit the model of non-interactive computational zero-knowledge with preprocessingto improve existing results in term of the number of bit commitments that are required for the protocol to work.