On the efficient implementation of pairing-based protocols

DOI10.1007/978-3-642-25516-8_18zbMATH Open1292.68057OpenAlexW1942572371MaRDI QIDQ3104702FDOQ3104702

Authors:

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

Recommendations

• Implementing cryptographic pairings
• Algorithmic Number Theory
• Topics in Cryptology – CT-RSA 2005
• Cryptography and Coding
• The realm of the pairings

zbMATH Keywords

Pairing implementation

Mathematics Subject Classification ID

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

Cites Work

• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• A taxonomy of pairing-friendly elliptic curves
• Faster explicit formulas for computing pairings over ordinary curves
• Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Efficient pairing computation on supersingular abelian varieties
• The Eta Pairing Revisited
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Optimal Pairings
• Advances in Elliptic Curve Cryptography
• Pairings for cryptographers
• Reducing elliptic curve logarithms to logarithms in a finite field
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Elliptic curves suitable for pairing based cryptography
• Title not available (Why is that?)
• Inner-product encryption under standard assumptions
• Topics in Cryptology – CT-RSA 2005
• Discrete logarithms: The past and the future
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Title not available (Why is that?)
• Efficient implementation of pairing-based cryptosystems
• An analysis of affine coordinates for pairing computation
• Constructing tower extensions of finite fields for implementation of pairing-based cryptography
• Affine pairings on ARM
• Fixed argument pairings

Cited In (15)

• An efficient attribute-based access control system with break-glass capability for cloud-assisted industrial control system
• Secure and Efficient Pairing at 256-Bit Security Level
• Efficient Implementations of MQPKS on Constrained Devices
• Efficient optimal ate pairing at 128-bit security level
• Subgroup security in pairing-based cryptography
• Improving the computation of the optimal ate pairing for a high security level
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• A survey of fault attacks in pairing based cryptography
• Beta Weil pairing revisited
• Compact structure-preserving signatures with almost tight security
• Designing a code generator for pairing based cryptographic functions
• Efficient implementation of bilinear pairings on ARM processors
• Tower building technique on elliptic curve with embedding degree 18
• On the implementation of a pairing-based cryptographic protocol in a constrained device
• Leakage-Resilient Revocable Certificateless Encryption with an Outsourced Revocation Authority

Uses Software

• MIRACL
• Barreto-Naehrig

This page was built for publication: On the efficient implementation of pairing-based protocols

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