Existence of 3-round zero-knowledge proof systems for NP

DOI10.1007/S11432-008-0013-5MaRDI QIDQ2425854zbMATH OpenOpenAlexFDO

Authors Hongda Li, Bao Li

Publication date 7 May 2008

Published in Science in China. Series F (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11432-008-0013-5

zbMATH Keywords

DDH assumptioninteractive proofnon-Black-box simulationzero-knowledge proof

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15) Cryptography (94A60)

Recommendations

• On the existence of three round zero-knowledge proofs
• scientific article; zbMATH DE number 1302862
• Round-optimal zero-knowledge proofs of knowledge for NP
• How to construct constant-round zero-knowledge proof systems for NP
• Advances in Cryptology – CRYPTO 2004
• Theory of Cryptography
• Efficient 4-round zero-knowledge proof system for NP
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• scientific article; zbMATH DE number 176551
• A one-round, two-prover, zero-knowledge protocol for NP

Cites work

• Advances in Cryptology – CRYPTO 2004
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• Constant-round perfect zero-knowledge computationally convincing protocols
• Definitions and properties of zero-knowledge proof systems
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 4191102 (Why is no real title available?)
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• 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
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography

Cited in

(5)

• Efficient 4-round zero-knowledge proof system for NP
• On the existence of three round zero-knowledge proofs
• The Knowledge Complexity of Interactive Proof Systems
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004

This page was built for publication: Existence of 3-round zero-knowledge proof systems for NP

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