Unconditionally secure NIZK in the fine-grained setting

DOI10.1007/978-3-031-22966-4_15MaRDI QIDQ6132420zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

unconditional securitynon-interactive zero-knowledgefine-grained cryptography\( \mathsf{AC^0} \)

Mathematics Subject Classification ID

Cryptography (94A60)

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

• A satisfiability algorithm for \(\mathrm{AC}^0\)
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Fine-Grained Cryptography
• Fine-grained cryptography revisited
• Fine-grained secure attribute-based encryption
• New techniques for noninteractive zero-knowledge
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Non-interactive zero-knowledge proofs with fine-grained security
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On the Correlation of Parity and Small-Depth Circuits
• On the size of pairing-based non-interactive arguments
• One-way permutations in NC 0
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Short non-interactive zero-knowledge proofs
• Square span programs with applications to succinct NIZK arguments
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• The Knowledge Complexity of Interactive Proof Systems
• Zaps and Their Applications

Cited in

(7)

• Fine-grained verifier NIZK and its applications
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Fine-grained secure attribute-based encryption
• Fine-grained polynomial functional encryption
• Non-interactive zero-knowledge proofs with fine-grained security
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• Unconditional Characterizations of Non-interactive Zero-Knowledge

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)