Non-interactive zero-knowledge proofs with fine-grained security
From MaRDI portal
Publication:2170050
DOI10.1007/978-3-031-07085-3_11zbMath1497.94126OpenAlexW4285274098MaRDI QIDQ2170050
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_11
Related Items (3)
Unconditionally secure NIZK in the fine-grained setting ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Fine-grained secure attribute-based encryption
Cites Work
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Fine-grained secure computation
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Fine-grained secure attribute-based encryption
- Secure communications over insecure channels
- Fine-Grained Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- New Techniques for Noninteractive Zero-Knowledge
- Zaps and Their Applications
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fine-grained cryptography revisited
This page was built for publication: Non-interactive zero-knowledge proofs with fine-grained security
