On the Efficient Implementation of Pairing-Based Protocols

DOI10.1007/978-3-642-25516-8_18zbMath1292.68057OpenAlexW1942572371MaRDI QIDQ3104702

No author found.

Publication date: 16 December 2011

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_18

zbMATH Keywords

Pairing implementation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (8)

Efficient Implementation of Bilinear Pairings on ARM Processors ⋮ Leakage-Resilient Revocable Certificateless Encryption with an Outsourced Revocation Authority ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ A survey of fault attacks in pairing based cryptography ⋮ Tower building technique on elliptic curve with embedding degree 18 ⋮ An efficient attribute-based access control system with break-glass capability for cloud-assisted industrial control system ⋮ Compact structure-preserving signatures with almost tight security ⋮ Beta Weil pairing revisited

Uses Software

• MIRACL
• Barreto-Naehrig

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• Efficient implementation of pairing-based cryptosystems
• Discrete logarithms: The past and the future
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• Inner-product encryption under standard assumptions
• Elliptic curves suitable for pairing based cryptography
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• An Analysis of Affine Coordinates for Pairing Computation
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
• The Eta Pairing Revisited
• Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
• Fixed Argument Pairings
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Affine Pairings on ARM
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Elliptic Curve Cryptography
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: On the Efficient Implementation of Pairing-Based Protocols