Round-optimal zero-knowledge proofs of knowledge for NP

DOI10.1007/s11432-011-4379-4zbMath1270.68110OpenAlexW2257281123MaRDI QIDQ362163

Hongda Li, Haixia Xue, Dengguo Feng, Bao Li

Publication date: 20 August 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4379-4

zbMATH Keywords

zero-knowledge proofsblack-box simulationconstant-roundproofs of knowledge

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP

Cites Work

• Definitions and properties of zero-knowledge proof systems
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Strict Polynomial-Time in Simulation and Extraction
• On the Composition of Zero-Knowledge Proof Systems
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Round-optimal zero-knowledge proofs of knowledge for NP