Lower Bounds for Non-interactive Zero-Knowledge

DOI10.1007/978-3-540-70936-7_6zbMath1129.94038OpenAlexW2150418456MaRDI QIDQ3596376

Hoeteck Wee

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_6

zbMATH Keywords

lower boundsNon-interactive zero-knowledgeset-up assumptions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

On QA-NIZK in the BPK Model, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, Smooth zero-knowledge hash functions