Towards zero knowledge argument for double discrete logarithm with constant cost
From MaRDI portal
Publication:6615217
DOI10.1016/J.TCS.2024.114799MaRDI QIDQ6615217
Publication date: 8 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-interactive zero-knowledge proofs for composite statements
- Efficient signature generation by smart cards
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Publicly Verifiable Secret Sharing
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Compact E-Cash
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Theory of Cryptography
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Towards zero knowledge argument for double discrete logarithm with constant cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615217)
