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

DOI10.1007/s11432-008-0013-5zbMath1137.94007OpenAlexW948054734MaRDI QIDQ2425854

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

interactive proofzero-knowledge proofDDH assumptionnon-Black-box simulation

Mathematics Subject Classification ID

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

Related Items

The Knowledge Complexity of Interactive Proof Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constant-round perfect zero-knowledge computationally convincing protocols
• Definitions and properties of zero-knowledge proof systems
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Advances in Cryptology – CRYPTO 2004
• Theory of Cryptography