Round-optimal zero-knowledge arguments based on any one-way function

Authors:
Mihir Bellare;Markus Jakobsson;Moti Yung
Affiliations:
Department of Computer Science & Engineering, University of California at San Diego, La Jolla, CA;Department of Computer Science & Engineering, University of California at San Diego, La Jolla, CA;CertCo, New York, NY
Venue:
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Year:
1997

Citing 20
Cited 14

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
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
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
The (true) complexity of statistical zero knowledge

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Constant-round perfect zero-knowledge computationally convincing protocols

Theoretical Computer Science
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 the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing
Direct Minimum-Knowledge Computations

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)

CRYPTO '92 Proceedings of the 12th 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
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond

SFCS '86 Proceedings of the 27th Annual 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
One-way functions are essential for complexity based cryptography

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

Concurrent zero-knowledge with timing, revisited

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Auditable, Anonymous Electronic Cash Extended Abstract

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A PVSS as Hard as Discrete Log and Shareholder Separability

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Concurrent zero-knowledge

Journal of the ACM (JACM)
Signcryption with Non-interactive Non-repudiation

Designs, Codes and Cryptography
Hybrid commitments and their applications to zero-knowledge proof systems

Theoretical Computer Science
One-way permutations, interactive hashing and statistically hiding commitments

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Which languages have 4-round zero-knowledge proofs?

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Efficient proxy signcryption scheme with provable CCA and CMA security

Computers & Mathematics with Applications
On the round complexity of zero-knowledge proofs based on one-way permutations

LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Hybrid trapdoor commitments and their applications

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Constant-Round non-malleable commitments from sub-exponential one-way functions

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent zero-knowledge with timing, revisited

Theoretical Computer Science
A note on constant-round concurrent zero-knowledge arguments of knowledge for NP

IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We fill a gap in the theory of zero-knowledge protocols by presenting NP-arguments that achieve negligible error probability and computational zero-knowledge in four rounds of interaction, assuming only the existence of a one-way function. This result is optimal in the sense that four rounds and a one-way function are each individually necassary to achieve a negligible error zero-knowledge argument for NP.