Unconditionally secure NIZK in the fine-grained setting
From MaRDI portal
Publication:6132420
DOI10.1007/978-3-031-22966-4_15zbMATH Open1519.94194OpenAlexW4320154868MaRDI QIDQ6132420FDOQ6132420
Authors: Yuyu Wang, Jia-xin Pan 
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
Recommendations
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Non-interactive zero-knowledge proofs with fine-grained security
- Fully homomorphic NIZK and NIWI proofs
- Attainable unconditional security for shared-key cryptosystems
- Relatively-Sound NIZKs and Password-Based Key-Exchange
- scientific article; zbMATH DE number 1980951
- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- scientific article; zbMATH DE number 1088919
Cites Work
- Efficient Non-interactive Proof Systems for Bilinear Groups
- The Knowledge Complexity of Interactive Proof Systems
- Fine-grained secure attribute-based encryption
- A satisfiability algorithm for \(\mathrm{AC}^0\)
- Zaps and Their Applications
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- New techniques for noninteractive zero-knowledge
- Non-interactive zero-knowledge proofs with fine-grained security
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Short non-interactive zero-knowledge proofs
- One-way permutations in NC 0
- Fine-Grained Cryptography
- Fine-grained cryptography revisited
- On the size of pairing-based non-interactive arguments
- Stretching Groth-Sahai: NIZK proofs of partial satisfiability
- Square span programs with applications to succinct NIZK arguments
- On the Correlation of Parity and Small-Depth Circuits
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
Cited In (7)
- Fine-grained polynomial functional encryption
- Fine-grained verifier NIZK and its applications
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Compact designated verifier NIZKs from the CDH assumption without pairings
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Fine-grained secure attribute-based encryption
- Non-interactive zero-knowledge proofs with fine-grained security
This page was built for publication: Unconditionally secure NIZK in the fine-grained setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132420)
