Unconditional Characterizations of Non-interactive Zero-Knowledge
From MaRDI portal
Publication:5451022
DOI10.1007/11535218_8zbMath1145.94473OpenAlexW1565012603MaRDI QIDQ5451022
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_8
Related Items (13)
Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ NIZK from SNARGs ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Perfect Non-interactive Zero Knowledge for NP ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ The Complexity of Zero Knowledge ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
This page was built for publication: Unconditional Characterizations of Non-interactive Zero-Knowledge