Round-optimal zero-knowledge proofs of knowledge for NP

DOI10.1007/S11432-011-4379-4MaRDI QIDQ362163zbMATH OpenOpenAlexFDO

Authors Hongda Li, Dengguo Feng, Bao Li, Haixia Xue

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

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)

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

Cites work

• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 697823 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 1952889 (Why is no real title available?)
• Definitions and properties of zero-knowledge proof systems
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• On the Composition of Zero-Knowledge 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
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Which Languages Have 4-Round Zero-Knowledge Proofs?

Cited in

(25)

• Advances in Cryptology – CRYPTO 2004
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• A note on constant-round zero-knowledge proofs of knowledge
• Polynomial-Space Approximation of No-Signaling Provers
• On round optimal statistical zero knowledge arguments
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Efficient 4-round zero-knowledge proof system for NP
• On the existence of three round zero-knowledge proofs
• 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
• Novel \(\Omega\)-protocols for NP
• On the round complexity of zero-knowledge proofs based on one-way permutations
• Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• scientific article; zbMATH DE number 1670843 (Why is no real title available?)
• Lower bounds for non-black-box zero knowledge
• scientific article; zbMATH DE number 1548176 (Why is no real title available?)
• Existence of 3-round zero-knowledge proof systems for NP
• Theory of Cryptography
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Which languages have 4-round zero-knowledge proofs?
• 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)