LOVE a pairing
From MaRDI portal
Publication:2146100
DOI10.1007/978-3-030-88238-9_16zbMath1491.94034OpenAlexW3204556716MaRDI QIDQ2146100
Diego F. Aranha, Francisco Rodríguez-Henríquez, Elena Pagnin
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88238-9_16
Related Items (4)
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 ⋮ Linear-map vector commitments and their practical applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new construction of the server-aided verification signature scheme
- Provably secure server-aided verification signatures
- Verifiable delay functions
- Lattice attacks on pairing-based signatures
- Efficient implementation of pairing-based cryptosystems
- Short signatures from the Weil pairing
- The Weil pairing, and its efficient calculation
- Updating key size estimations for pairings
- Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Verifiable delay functions from supersingular isogenies and pairings
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- A taxonomy of pairing-friendly elliptic curves
- The simplest multi-key linearly homomorphic signature scheme
- Anonymous single-round server-aided verification
- Guide to Pairing-Based Cryptography
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Subgroup Security in Pairing-Based Cryptography
- The Realm of the Pairings
- Exponentiating in Pairing Groups
- Software Implementation of an Attribute-Based Encryption Scheme
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
- Batch Pairing Delegation
- Secure Delegation of Elliptic-Curve Pairing
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Optimal Pairings
- Delegating a Pairing Can Be Both Secure and Efficient
- Faster Key Compression for Isogeny-Based Cryptosystems
- Pairing-Friendly Elliptic Curves of Prime Order
- Server-Aided Verification: Theory and Practice
- Server-Aided Verification Signatures: Definitions and New Constructions
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: LOVE a pairing
