LOVE a pairing

DOI10.1007/978-3-030-88238-9_16MaRDI QIDQ2146100zbMATHOpenAlexFDO

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

zbMATH Keywords

LOVE protocolmalicious server

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient algorithms for secure outsourcing of bilinear pairings
• Delegating a pairing can be both secure and efficient
• Secure delegation of elliptic-curve pairing
• Batch Pairing Delegation
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions

Cites work

• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A new construction of the server-aided verification signature scheme
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• A taxonomy of pairing-friendly elliptic curves
• Anonymous single-round server-aided verification
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Batch Pairing Delegation
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level
• Delegating a pairing can be both secure and efficient
• Efficient implementation of pairing-based cryptosystems
• Exponentiating in pairing groups
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Extended tower number field sieve: a new complexity for the medium prime case
• Faster Key Compression for Isogeny-Based Cryptosystems
• Faster explicit formulas for computing pairings over ordinary curves
• Faster squaring in the cyclotomic subgroup of sixth degree extensions
• Guide to pairing-based cryptography
• Lattice attacks on pairing-based signatures
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• On the size of pairing-based non-interactive arguments
• Optimal Pairings
• Pairing-Friendly Elliptic Curves of Prime Order
• Provably secure server-aided verification signatures
• Secure delegation of elliptic-curve pairing
• Server-Aided Verification Signatures: Definitions and New Constructions
• Server-Aided Verification: Theory and Practice
• Short signatures from the Weil pairing
• Software Implementation of an Attribute-Based Encryption Scheme
• Subgroup security in pairing-based cryptography
• The Weil pairing, and its efficient calculation
• The realm of the pairings
• The simplest multi-key linearly homomorphic signature scheme
• Updating key size estimations for pairings
• Verifiable delay functions
• Verifiable delay functions from supersingular isogenies and pairings

Cited in

(10)

• Imaginaries in beautiful pairs
• Batch Pairing Delegation
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
• Co-factor clearing and subgroup membership testing on pairing-friendly curves
• Secure delegation of elliptic-curve pairing
• Delegating a pairing can be both secure and efficient
• Linear-map vector commitments and their practical applications
• Polymath: Groth16 is not the limit
• Efficient algorithms for secure outsourcing of bilinear pairings
• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves

Describes a project that uses

Uses Software

• RELIC
• GitHub

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)