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

DOI10.1007/s11432-013-5044-xzbMath1343.68086OpenAlexW1965985642MaRDI QIDQ893613

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

zero-knowledge proofsconstant-roundproofs of knowledgestrict polynomial-time extractors

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Round-optimal zero-knowledge proofs of knowledge for NP
• 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
• Strict polynomial-time in simulation and extraction
• New and improved constructions of non-malleable cryptographic protocols
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• On constant-round zero-knowledge proofs of knowledge for NP-relations
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Theory of Cryptography

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