Towards zero knowledge argument for double discrete logarithm with constant cost
From MaRDI portal
Cites work
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Aurora: transparent succinct arguments for R1CS
- Compact E-Cash
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient proofs that a committed number lies in an interval
- Efficient signature generation by smart cards
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Extended tower number field sieve: a new complexity for the medium prime case
- Fast Reed-Solomon interactive oracle proofs of proximity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1418309 (Why is no real title available?)
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Non-interactive zero-knowledge proofs for composite statements
- On the size of pairing-based non-interactive arguments
- Publicly verifiable secret sharing
- Quadratic span programs and succinct NIZKs without PCPs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- The algebraic group model and its applications
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
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)
