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

DOI10.1007/S11432-013-5044-XMaRDI QIDQ893613zbMATH OpenOpenAlexFDO

Authors Hongda Li, Dengguo Feng

Publication date 20 November 2015

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

Full work available at URL http://engine.scichina.com/doi/10.1007/s11432-013-5044-x

zbMATH Keywords

constant-roundproofs of knowledgezero-knowledge proofsstrict polynomial-time extractors

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Strict Polynomial-Time in Simulation and Extraction
• A note on constant-round zero-knowledge proofs of knowledge
• Theory of Cryptography
• Round-optimal zero-knowledge proofs of knowledge for NP
• Obfuscation-based non-black-box extraction and constant-round zero-knowledge arguments of knowledge

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?)
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• New and improved constructions of non-malleable cryptographic protocols
• On constant-round zero-knowledge proofs of knowledge for NP-relations
• On probabilistic versus deterministic provers in the definition of proofs of knowledge
• On the Composition of Zero-Knowledge Proof Systems
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Round-optimal zero-knowledge proofs of knowledge for NP
• Statistically-hiding commitment from any one-way function
• 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

(7)

• Strict Polynomial-Time in Simulation and Extraction
• A note on constant-round zero-knowledge proofs of knowledge
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Obfuscation-based non-black-box extraction and constant-round zero-knowledge arguments of knowledge
• Theory of Cryptography
• Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness

This page was built for publication: Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP

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