On the impossibility of algebraic NIZK in pairing-free groups

DOI10.1007/978-3-031-38551-3_22OpenAlexW4385654391MaRDI QIDQ6190127

Emanuele Giunta

Publication date: 6 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_22

zbMATH Keywords

non-interactive zero-knowledgearguments of knowledgecorrelation intractable hash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the impossibility of structure-preserving deterministic primitives
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Generic-group delay functions require hidden-order groups
• Non-interactive zero knowledge from sub-exponential DDH
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• On the impossibility of purely algebraic signatures
• Constant-Size Commitments to Polynomials and Their Applications
• The random oracle methodology, revisited
• Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
• Lower bounds on the efficiency of encryption and digital signature schemes
• Perfect Non-interactive Zero Knowledge for NP
• Unifying Zero-Knowledge Proofs of Knowledge
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Signatures of Correct Computation
• Vector Commitments and Their Applications
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Non-interactive Zaps and New Techniques for NIZK
• Cryptography and Coding
• SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
• Generic-Group Identity-Based Encryption: A Tight Impossibility Result
• On the impossibility of algebraic vector commitments in pairing-free groups
• NIWI and new notions of extraction for algebraic languages
• To label, or not to label (in generic groups)

This page was built for publication: On the impossibility of algebraic NIZK in pairing-free groups