LOVE a pairing
From MaRDI portal
Publication:2146100
DOI10.1007/978-3-030-88238-9_16zbMATH Open1491.94034OpenAlexW3204556716MaRDI QIDQ2146100FDOQ2146100
Authors: Diego F. Aranha, Elena Pagnin, Francisco Rodríguez-Henríquez 
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88238-9_16
Recommendations
Cites Work
- Short signatures from the Weil pairing
- A taxonomy of pairing-friendly elliptic curves
- Faster explicit formulas for computing pairings over ordinary curves
- Title not available (Why is that?)
- Pairing-Friendly Elliptic Curves of Prime Order
- The Weil pairing, and its efficient calculation
- The realm of the pairings
- Faster squaring in the cyclotomic subgroup of sixth degree extensions
- Optimal Pairings
- Title not available (Why is that?)
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- A new construction of the server-aided verification signature scheme
- Server-Aided Verification: Theory and Practice
- Server-Aided Verification Signatures: Definitions and New Constructions
- Batch Pairing Delegation
- Secure delegation of elliptic-curve pairing
- Provably secure server-aided verification signatures
- Updating key size estimations for pairings
- Title not available (Why is that?)
- Verifiable delay functions from supersingular isogenies and pairings
- Extended tower number field sieve: a new complexity for the medium prime case
- The simplest multi-key linearly homomorphic signature scheme
- Efficient implementation of pairing-based cryptosystems
- Verifiable delay functions
- On the size of pairing-based non-interactive arguments
- Guide to pairing-based cryptography
- Exponentiating in pairing groups
- Lattice attacks on pairing-based signatures
- Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
- Subgroup security in pairing-based cryptography
- Software Implementation of an Attribute-Based Encryption Scheme
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Attractive subfamilies of BLS curves for implementing high-security pairings
- Faster Key Compression for Isogeny-Based Cryptosystems
- Anonymous single-round server-aided verification
- Delegating a pairing can be both secure and efficient
Cited In (10)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Batch Pairing Delegation
- Delegating a pairing can be both secure and efficient
- Linear-map vector commitments and their practical applications
- 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
- Efficient algorithms for secure outsourcing of bilinear pairings
- Imaginaries in beautiful pairs
- Polymath: Groth16 is not the limit
- Secure delegation of elliptic-curve pairing
Uses Software
This page was built for publication: LOVE a pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146100)
