Which languages have 4-round zero-knowledge proofs?

DOI10.1007/S00145-010-9081-YzbMath1276.94016OpenAlexW1983179654MaRDI QIDQ421047

Jonathan N. 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

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

Related Items (5)

Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ A note on constant-round zero-knowledge proofs of knowledge ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical zero-knowledge languages can be recognized in two rounds
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• Round-optimal perfect zero-knowledge proofs
• Definitions and properties of zero-knowledge proof systems
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• Private Coins versus Public Coins in Zero-Knowledge Proof Systems
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Strict Polynomial-Time in Simulation and Extraction
• On the Composition of Zero-Knowledge Proof Systems
• Advances in Cryptology – CRYPTO 2004
• Derandomization in Cryptography
• An Equivalence Between Zero Knowledge and Commitments

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