On the impossibility of algebraic NIZK in pairing-free groups
From MaRDI portal
(Redirected from On the impossibility of algebraic NIZK in pairing-free groups)
Recommendations
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Quasi-adaptive NIZK for linear subspaces revisited
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Short pairing-based non-interactive zero-knowledge arguments
- Compact NIZKs from standard assumptions on bilinear maps
Cites work
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Cryptography and Coding
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Generic-group delay functions require hidden-order groups
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Lower bounds on the efficiency of encryption and digital signature schemes
- NIWI and new notions of extraction for algebraic languages
- Non-interactive Zaps and New Techniques for NIZK
- Non-interactive zero knowledge from sub-exponential DDH
- On the impossibility of algebraic vector commitments in pairing-free groups
- On the impossibility of purely algebraic signatures
- On the impossibility of structure-preserving deterministic primitives
- Perfect Non-interactive Zero Knowledge for NP
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Signatures of correct computation
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- The random oracle methodology, revisited.
- To label, or not to label (in generic groups)
- Unifying Zero-Knowledge Proofs of Knowledge
- Vector commitments and their applications
Cited in
(5)- Round-robin is optimal: lower bounds for group action based protocols
- Algebraic group model with oblivious sampling
- Limits of black-box anamorphic encryption
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- Short signatures from DDH without pairings or random oracles
This page was built for publication: On the impossibility of algebraic NIZK in pairing-free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190127)
