Which languages have 4-round zero-knowledge proofs?

DOI10.1007/S00145-010-9081-YMaRDI QIDQ421047zbMATH OpenOpenAlexFDO

Authors Jonathan Katz

Publication date 23 May 2012

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-010-9081-y

zbMATH Keywords

lower boundszero-knowledge proofs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Which Languages Have 4-Round Zero-Knowledge Proofs?
• On the existence of three round zero-knowledge proofs
• Round-optimal zero-knowledge proofs of knowledge for NP
• scientific article; zbMATH DE number 177820
• The knowledge complexity of quadratic residuosity languages

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Advances in Cryptology – CRYPTO 2004
• An Equivalence Between Zero Knowledge and Commitments
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Definitions and properties of zero-knowledge proof systems
• Derandomization in Cryptography
• Does co-NP have short interactive proofs ?
• How to construct constant-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• scientific article; zbMATH DE number 697823 (Why is no real title available?)
• scientific article; zbMATH DE number 1440068 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• Lower bounds for non-black-box zero knowledge
• Minimum disclosure proofs of knowledge
• On the Composition of Zero-Knowledge Proof Systems
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• On the round complexity of zero-knowledge proofs based on one-way permutations
• Practical and provably-secure commitment schemes from collision-free hashing
• Private coins versus public coins in zero-knowledge proof systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Round-optimal perfect zero-knowledge proofs
• Statistical zero-knowledge languages can be recognized in two rounds
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Strict Polynomial-Time in Simulation and Extraction
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(8)

• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• What security can we achieve within 4 rounds?
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
• What Security Can We Achieve Within 4 Rounds?
• 3-message zero knowledge against human ignorance
• A note on constant-round zero-knowledge proofs of knowledge
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Which Languages Have 4-Round Zero-Knowledge Proofs?

This page was built for publication: Which languages have 4-round zero-knowledge proofs?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421047)