On constant-round zero-knowledge proofs of knowledge for NP-relations

DOI10.1007/S11432-010-0071-3MaRDI QIDQ5046398zbMATH OpenOpenAlexFDO

Authors Hongda Li, Haixia Xu, Bao Li, Dengguo Feng

Publication date 28 October 2022

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11432-010-0071-3

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Cited in

(1)

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

This page was built for publication: On constant-round zero-knowledge proofs of knowledge for NP-relations

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