Lower Bounds for Non-interactive Zero-Knowledge

DOI10.1007/978-3-540-70936-7_6MaRDI QIDQ3596376zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Lower bounds for non-black-box zero knowledge
• Noninteractive Zero-Knowledge
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Randomness-efficient non-interactive zero knowledge
• Unconditional Characterizations of Non-interactive Zero-Knowledge

Cited in

(8)

• Non-interactive zero-knowledge proofs with fine-grained security
• Lower bounds for non-black-box zero knowledge
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• On QA-NIZK in the BPK model
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
• Smooth zero-knowledge hash functions
• Lower bounds for concurrent zero knowledge

This page was built for publication: Lower Bounds for Non-interactive Zero-Knowledge

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