Subgroup Security in Pairing-Based Cryptography

DOI10.1007/978-3-319-22174-8_14zbMath1370.94485MaRDI QIDQ2946453

Craig Costello, Paulo S. L. M. Barreto, Michael Naehrig, Gustavo H. M. Zanon, Geovandro C. C. F. Pereira, Rafael Misoczki

Publication date: 17 September 2015

Published in: Progress in Cryptology -- LATINCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22174-8_14

zbMATH Keywords

pairing-based cryptography; pairing-friendly curves; elliptic-curve cryptography; subgroup membership; small-subgroup attacks

Mathematics Subject Classification ID

94A60: Cryptography

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

Adequate Elliptic Curves for Computing the Product of n Pairings, Choosing and generating parameters for pairing implementation on BN curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• A comparison of MNT curves and supersingular curves
• Pairing-based cryptography -- Pairing 2008. Second international conference, Egham, UK, September 1--3, 2008. Proceedings
• Comparing two pairing-based aggregate signature schemes
• Pairings for cryptographers
• Factoring integers with elliptic curves
• The Magma algebra system. I: The user language
• Efficient implementation of pairing-based cryptosystems
• A taxonomy of pairing-friendly elliptic curves
• Faster Hashing to ${\mathbb G}_2$
• Exponentiating in Pairing Groups
• Software Implementation of an Attribute-Based Encryption Scheme
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• On the Efficient Implementation of Pairing-Based Protocols
• Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Fast Hashing to G 2 on Pairing-Friendly Curves
• Hidden Collisions on DSS
• The Eta Pairing Revisited
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
• New Software Speed Records for Cryptographic Pairings
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Integer Variable χ–Based Ate Pairing
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Implementing Pairings at the 192-Bit Security Level
• Optimal Pairings
• Strictly Proper Scoring Rules, Prediction, and Estimation
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• A normal form for elliptic curves
• Pairing-Friendly Elliptic Curves of Prime Order
• Topics in Cryptology – CT-RSA 2005
• Oblivious signature-based envelope
• Algorithmic Number Theory
• Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2001. Proceedings