Unconditionally secure NIZK in the fine-grained setting
From MaRDI portal
Publication:6132420
DOI10.1007/978-3-031-22966-4_15zbMath1519.94194OpenAlexW4320154868MaRDI QIDQ6132420
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_15
Related Items (1)
Cites Work
- Unnamed Item
- One-way permutations in NC 0
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Fine-grained secure attribute-based encryption
- Non-interactive zero-knowledge proofs with fine-grained security
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Fine-Grained Cryptography
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Square Span Programs with Applications to Succinct NIZK Arguments
- Short Non-interactive Zero-Knowledge Proofs
- The Knowledge Complexity of Interactive Proof Systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On the Correlation of Parity and Small-Depth Circuits
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- New Techniques for Noninteractive Zero-Knowledge
- Zaps and Their Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- On the Size of Pairing-Based Non-interactive Arguments
- Fine-grained cryptography revisited
This page was built for publication: Unconditionally secure NIZK in the fine-grained setting