Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition

DOI10.1007/978-3-030-65411-5_13zbMath1520.94053MaRDI QIDQ6488029

Youssef El Housni, Aurore Guillevic

Publication date: 22 March 2023

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (4)

Families of SNARK-friendly 2-chains of elliptic curves ⋮ 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 ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists

Cites Work

• Unnamed Item
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• A taxonomy of pairing-friendly elliptic curves
• Faster computation of the Tate pairing
• Point Decomposition Problem in Binary Elliptic Curves
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Faster Hashing to ${\mathbb G}_2$
• Indifferentiable Hashing to Barreto–Naehrig Curves
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• An Analysis of Affine Coordinates for Pairing Computation
• Faster Pairing Computations on Curves with High-Degree Twists
• Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
• The Knowledge Complexity of Interactive Proof Systems
• Optimal Pairings
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• On the Size of Pairing-Based Non-interactive Arguments
• On Cycles of Pairing-Friendly Elliptic Curves
• Algorithmic Number Theory
• Discrete logarithm problems with auxiliary inputs

This page was built for publication: Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition