Efficient 4-round zero-knowledge proof system for NP

MaRDI QIDQ1425336zbMATH OpenFDO

Authors Yunlei Zhao, Hong Zhu

Publication date 16 March 2004

Published in Progress in Natural Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• How to construct constant-round zero-knowledge proof systems for NP
• Theory of Cryptography
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Round-optimal zero-knowledge proofs of knowledge for NP
• Existence of 3-round zero-knowledge proof systems for NP

Cited in

(3)

• Efficient zero-knowledge proof systems
• Existence of 3-round zero-knowledge proof systems for NP
• Efficient zero-knowledge proofs. (Abstract)

This page was built for publication: Efficient 4-round zero-knowledge proof system for NP

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