Precise bounded-concurrent zero-knowledge proofs for NP
From MaRDI portal
Publication:5046447
DOI10.1007/S11432-010-4056-ZzbMATH Open1497.68212OpenAlexW1977435213MaRDI QIDQ5046447FDOQ5046447
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-4056-z
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Precise bounded-concurrent zero-knowledge proofs for NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046447)