Families of SNARK-friendly 2-chains of elliptic curves
From MaRDI portal
Publication:2170053
Recommendations
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- A taxonomy of pairing-friendly elliptic curves
- Attractive subfamilies of BLS curves for implementing high-security pairings
- Curves with Fast Computations in the First Pairing Group
- Pairing-Friendly Elliptic Curves of Prime Order
Cites work
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- A taxonomy of pairing-friendly elliptic curves
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Constant-Size Commitments to Polynomials and Their Applications
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Extended tower number field sieve: a new complexity for the medium prime case
- Faster batch forgery identification
- Faster explicit formulas for computing pairings over ordinary curves
- Faster pairing computations on curves with high-degree twists
- Faster squaring in the cyclotomic subgroup of sixth degree extensions
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Nonsingular plane cubic curves over finite fields
- On the size of pairing-based non-interactive arguments
- Optimal Pairings
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Scalable zero knowledge via cycles of elliptic curves
- The Arithmetic of Elliptic Curves
- The Eta Pairing Revisited
- The realm of the pairings
- TNFS resistant families of pairing-friendly elliptic curves
- Updating key size estimations for pairings
Cited in
(17)- 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
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Pairings in rank-1 constraint systems
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves
- Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field
- On cycles of pairing-friendly abelian varieties
- Biextensions in pairing-based cryptography
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- Computing pairings on elliptic curves with embedding degree two via biextensions
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing
- Cycles of supersingular elliptic curves for pairing-based proof systems
This page was built for publication: Families of SNARK-friendly 2-chains of elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170053)
