A survey of elliptic curves for proof systems

DOI10.1007/s10623-022-01135-yOpenAlexW4280542304MaRDI QIDQ6063127

Diego F. Aranha, Aurore Guillevic, Youssef El Housni

Publication date: 7 November 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01135-y

zbMATH Keywords

elliptic curvesproof systemspairingsSNARKs

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (2)

Revisiting cycles of pairing-friendly elliptic curves ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• The discrete logarithm problem on elliptic curves of trace one
• Updating key size estimations for pairings
• Transparent SNARKs from DARK compilers
• 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
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Recursive proof composition from accumulation schemes
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Families of SNARK-friendly 2-chains of elliptic curves
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• A taxonomy of pairing-friendly elliptic curves
• Improving the computation of the optimal ate pairing for a high security level
• TNFS resistant families of pairing-friendly elliptic curves
• Elliptic aliquot cycles of fixed length
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Ordinary Abelian varieties having small embedding degree
• The Tower Number Field Sieve
• Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
• 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
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Faster Batch Forgery Identification
• Faster Hashing to ${\mathbb G}_2$
• Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
• The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings
• Constant-Size Commitments to Polynomials and Their Applications
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Computing Hilbert class polynomials with the Chinese remainder theorem
• Decaf: Eliminating Cofactors Through Point Compression
• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• New Software Speed Records for Cryptographic Pairings
• Twisted Edwards Curves Revisited
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Integer Variable χ–Based Ate Pairing
• The Knowledge Complexity of Interactive Proof Systems
• An asymptotic for the average number of amicable pairs for elliptic curves
• Amicable Pairs and Aliquot Cycles for Elliptic Curves
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Class Invariants by the CRT Method
• Computation of a 30750-bit binary field discrete logarithm
• Optimal Pairings
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Pairing-Friendly Elliptic Curves of Prime Order
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• The Fast Fourier Transform in a Finite Field
• Theory of Cryptography
• Selected Areas in Cryptography
• On the Size of Pairing-Based Non-interactive Arguments
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• On Cycles of Pairing-Friendly Elliptic Curves
• Non-interactive Zaps and New Techniques for NIZK
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• Discrete logarithm problems with auxiliary inputs
• \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation

This page was built for publication: A survey of elliptic curves for proof systems