Exponentiating in pairing groups

DOI10.1007/978-3-662-43414-7_22MaRDI QIDQ2949544zbMATH OpenOpenAlexFDO

Authors Joppe W. Bos, Craig Costello, Michael Naehrig

Publication date 1 October 2015

Published in Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43414-7_22

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Advances in Cryptology – CRYPTO 2004
• Algorithmic Number Theory
• The complexity of certain multi-exponentiation techniques in cryptography

Cited in

(12)

• Efficient identity-based threshold decryption scheme from bilinear pairings
• LOVE a pairing
• A survey on delegated computation
• Secure and efficient delegation of elliptic-curve pairing
• Computing in groups with exponent six
• Subgroup security in pairing-based cryptography
• A shuffle argument secure in the generic model
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• scientific article; zbMATH DE number 169133 (Why is no real title available?)
• Secure and Efficient Pairing at 256-Bit Security Level
• Optimizing and securing GLV multiplication over BLS pairings-friendly curves
• A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level

This page was built for publication: Exponentiating in pairing groups

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