Pairings in rank-1 constraint systems

DOI10.1007/978-3-031-33488-7_13zbMATH Open1542.94123MaRDI QIDQ6535081

Youssef El Housni

Publication date: 9 November 2023

zbMATH Keywords

bilinear pairingssuccinct non-interactive arguments of knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

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?)
• Updatable and universal common reference strings with applications to zk-SNARKs
• The Weil pairing, and its efficient calculation
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Families of SNARK-friendly 2-chains of elliptic curves
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Improving the computation of the optimal ate pairing for a high security level
• Point Decomposition Problem in Binary Elliptic Curves
• The Realm of the Pairings
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Constant-Size Commitments to Polynomials and Their Applications
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Efficient Implementation of Bilinear Pairings on ARM Processors
• On Compressible Pairings and Their Computation
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Faster Pairing Computations on Curves with High-Degree Twists
• Implementing Pairings at the 192-Bit Security Level
• Optimal Pairings
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• On the Size of Pairing-Based Non-interactive Arguments
• Non-interactive Zaps and New Techniques for NIZK
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition

This page was built for publication: Pairings in rank-1 constraint systems

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