Families of SNARK-friendly 2-chains of elliptic curves
From MaRDI portal
Publication:2170053
DOI10.1007/978-3-031-07085-3_13zbMath1497.94085OpenAlexW3202783968MaRDI QIDQ2170053
Aurore Guillevic, Youssef El Housni
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_13
pairing-friendly elliptic curvesCocks-Pinch curvesrecursive zero-knowledge succinct non-interactive arguments of knowledge
Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
A survey of elliptic curves for proof systems ⋮ Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves ⋮ Co-factor clearing and subgroup membership testing on pairing-friendly curves ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ Revisiting cycles of pairing-friendly elliptic curves
Uses Software
Cites Work
- Unnamed Item
- Nonsingular plane cubic curves over finite fields
- Updating key size estimations for pairings
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- A taxonomy of pairing-friendly elliptic curves
- TNFS resistant families of pairing-friendly elliptic curves
- Point Decomposition Problem in Binary Elliptic Curves
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Faster Batch Forgery Identification
- The Realm of the Pairings
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- Constant-Size Commitments to Polynomials and Their Applications
- The Eta Pairing Revisited
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Faster Pairing Computations on Curves with High-Degree Twists
- The Arithmetic of Elliptic Curves
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Optimal Pairings
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
