Unconditional Characterizations of Non-interactive Zero-Knowledge
From MaRDI portal
Recommendations
- Lower Bounds for Non-interactive Zero-Knowledge
- Noninteractive Zero-Knowledge
- Can statistical zero knowledge be made non-interactive? or On the relationship of \({\mathcal {SZK}}\) and \({\mathcal {NISZK}}\). (Extended abstract)
- An Unconditional Study of Computational Zero Knowledge
- Unconditionally secure NIZK in the fine-grained setting
Cited in
(23)- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Non-interactive zero-knowledge proofs with fine-grained security
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Perfect Non-interactive Zero Knowledge for NP
- Lower Bounds for Non-interactive Zero-Knowledge
- Robust non-interactive zero knowledge
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- The Complexity of Zero Knowledge
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Multi-theorem preprocessing NIZKs from lattices
- NIZK from SNARGs
- Classically verifiable NIZK for QMA with preprocessing
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Unconditionally secure quantum commitments with preprocessing
- Amplification of non-interactive zero knowledge, revisited
- Black-box constant-round secure 2PC with succinct communication
- Robust non-interactive zero-knowledge combiners
- Non-trivial zero-knowledge implies one-way functions
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)