Non-interactive zero-knowledge proofs with fine-grained security
From MaRDI portal
Publication:2170050
Recommendations
- Unconditionally secure NIZK in the fine-grained setting
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Non-interactive Zaps and New Techniques for NIZK
- Perfect Non-interactive Zero Knowledge for NP
- Lower Bounds for Non-interactive Zero-Knowledge
Cites work
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fine-Grained Cryptography
- Fine-grained cryptography revisited
- Fine-grained secure attribute-based encryption
- Fine-grained secure computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- New techniques for noninteractive zero-knowledge
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Secure communications over insecure channels
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Stretching Groth-Sahai: NIZK proofs of partial satisfiability
- The Knowledge Complexity of Interactive Proof Systems
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Zaps and Their Applications
Cited in
(19)- 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
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Interactive physical zero-knowledge proof for Norinori
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- scientific article; zbMATH DE number 6720551 (Why is no real title available?)
- Noninteractive Zero-Knowledge
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 503349 (Why is no real title available?)
- scientific article; zbMATH DE number 1955784 (Why is no real title available?)
- Unconditionally secure NIZK in the fine-grained setting
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- Fine-grained secure attribute-based encryption
- Fine-grained polynomial functional encryption
- Fine-grained non-interactive key-exchange without idealized assumptions
- Fine-grained non-interactive key exchange, revisited
- On sequential functions and fine-grained cryptography
- Leakage-resilient circuits against \textsf{NC1}, revisited
- Non-interactive zero-knowledge proofs for composite statements
This page was built for publication: Non-interactive zero-knowledge proofs with fine-grained security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170050)
