Unconditional Characterizations of Non-interactive Zero-Knowledge
From MaRDI portal
Publication:5451022
DOI10.1007/11535218_8zbMATH Open1145.94473OpenAlexW1565012603MaRDI QIDQ5451022FDOQ5451022
Authors: Rafael Pass, Abhi Shelat 
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
Recommendations
Cited In (20)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Perfect Non-interactive Zero Knowledge for NP
- The Complexity of Zero Knowledge
- Title not available (Why is that?)
- Lower Bounds for Non-interactive Zero-Knowledge
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Multi-theorem preprocessing NIZKs from lattices
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Amplification of non-interactive zero knowledge, revisited
- Unconditionally secure quantum commitments with preprocessing
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- NIZK from SNARGs
- Non-interactive zero-knowledge proofs with fine-grained security
- Classically verifiable NIZK for QMA with preprocessing
This page was built for publication: Unconditional Characterizations of Non-interactive Zero-Knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451022)
