On cycles of pairing-friendly abelian varieties

DOI10.1007/978-3-031-68400-5_7MaRDI QIDQ6653047

Craig Costello, Michael Naehrig, Maria Corte-Real Santos

Publication date: 13 December 2024

abelian varieties zero-knowledge proofs supersingular curves SNARKs recursive proof composition trace zero varieties

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

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?)
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?)
Jacobians in isogeny classes of abelian surfaces over finite fields
Using abelian varieties to improve pairing-based cryptography
Hyperelliptic cryptosystems
Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
Group structures of elementary supersingular abelian varieties over finite fields.
Families of SNARK-friendly 2-chains of elliptic curves
Efficient pairing computation on supersingular abelian varieties
Isogeny classes of abelian varieties over finite fields
Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
Scalable Zero Knowledge via Cycles of Elliptic Curves
Constructing supersingular elliptic curves
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Computing Hilbert class polynomials with the Chinese remainder theorem
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Fast Hashing to G 2 on Pairing-Friendly Curves
A double large prime variation for small genus hyperelliptic index calculus
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Twisted Edwards Curves
Efficient CM-constructions of elliptic curves over finite fields
Security Analysis of the Strong Diffie-Hellman Problem
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
The Arithmetic of Elliptic Curves
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Distortion maps for supersingular genus two curves
Speeding the Pollard and Elliptic Curve Methods of Factorization
Monte Carlo Methods for Index Computation (mod p)
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
Amicable Pairs and Aliquot Cycles for Elliptic Curves
Pairing-Friendly Elliptic Curves of Prime Order
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Efficient Non-interactive Proof Systems for Bilinear Groups
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Advances in Elliptic Curve Cryptography
Abelian Surfaces over Finite Fields as Jacobians
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Abelian varieties over finite fields
On the Size of Pairing-Based Non-interactive Arguments
On Cycles of Pairing-Friendly Elliptic Curves
Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three
Non-interactive Zaps and New Techniques for NIZK
Cryptography and Coding
Algorithmic Number Theory
A survey of elliptic curves for proof systems
Revisiting cycles of pairing-friendly elliptic curves

This page was built for publication: On cycles of pairing-friendly abelian varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653047)