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

DOI10.1007/S11432-013-5044-XzbMATH Open1343.68086OpenAlexW1965985642MaRDI QIDQ893613FDOQ893613

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

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

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)

Cites Work

• Perfect zero-knowledge arguments for NP using any one-way permutation
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• On probabilistic versus deterministic provers in the definition of proofs of knowledge
• Title not available (Why is that?)
• Statistically-hiding commitment from any one-way function
• Title not available (Why is that?)
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• The Knowledge Complexity of Interactive Proof Systems
• New and improved constructions of non-malleable cryptographic protocols
• Round-optimal zero-knowledge proofs of knowledge for NP
• Title not available (Why is that?)
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Theory of Cryptography
• Strict polynomial-time in simulation and extraction
• On constant-round zero-knowledge proofs of knowledge for NP-relations

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)