Round-optimal zero-knowledge proofs of knowledge for NP

DOI10.1007/S11432-011-4379-4zbMATH Open1270.68110OpenAlexW2257281123MaRDI QIDQ362163FDOQ362163

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

Recommendations

• How to construct constant-round zero-knowledge proof systems for NP
• A note on constant-round zero-knowledge proofs of knowledge
• On the round complexity of zero-knowledge proofs based on one-way permutations
• Theory of Cryptography
• On the existence of three round zero-knowledge proofs

zbMATH Keywords

black-box simulationconstant-roundproofs of knowledgezero-knowledge proofs

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)

Cites Work

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

Cited In (16)

• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-Space Approximation of No-Signaling Provers
• On the existence of three round zero-knowledge proofs
• Efficient 4-round zero-knowledge proof system for NP
• Promise zero knowledge and its applications to round optimal MPC
• The round complexity of quantum zero-knowledge
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds for non-black-box zero knowledge
• Existence of 3-round zero-knowledge proof systems for NP
• Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

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

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