Subgroup security in pairing-based cryptography

DOI10.1007/978-3-319-22174-8_14MaRDI QIDQ2946453zbMATH OpenOpenAlexFDO

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

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

elliptic-curve cryptographypairing-based cryptographypairing-friendly curvessmall-subgroup attackssubgroup membership

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
• Adequate elliptic curves for computing the product of n pairings
• A taxonomy of pairing-friendly elliptic curves
• Algorithmic Number Theory
• Attractive subfamilies of BLS curves for implementing high-security pairings

Cites work

• A comparison of MNT curves and supersingular curves
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A normal form for elliptic curves
• A taxonomy of pairing-friendly elliptic curves
• Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2001. Proceedings
• Algorithmic Number Theory
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Comparing two pairing-based aggregate signature schemes
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Constructing tower extensions of finite fields for implementation of pairing-based cryptography
• Efficient implementation of pairing-based cryptosystems
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Exponentiating in pairing groups
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Factoring integers with elliptic curves
• Fast Hashing to G 2 on Pairing-Friendly Curves
• Faster explicit formulas for computing pairings over ordinary curves
• Faster hashing to \({\mathbb G}_2\)
• Faster squaring in the cyclotomic subgroup of sixth degree extensions
• Hidden Collisions on DSS
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1088239 (Why is no real title available?)
• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Implementing pairings at the 192-bit security level
• Integer Variable χ–Based Ate Pairing
• New Software Speed Records for Cryptographic Pairings
• Oblivious signature-based envelope
• On the efficient implementation of pairing-based protocols
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Optimal Pairings
• Pairing-based cryptography -- Pairing 2008. Second international conference, Egham, UK, September 1--3, 2008. Proceedings
• Pairing-Friendly Elliptic Curves of Prime Order
• Pairings for cryptographers
• Software Implementation of an Attribute-Based Encryption Scheme
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Strictly Proper Scoring Rules, Prediction, and Estimation
• The Eta Pairing Revisited
• The Magma algebra system. I: The user language
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Topics in Cryptology – CT-RSA 2005

Cited in

(18)

• Choosing and generating parameters for pairing implementation on BN curves
• Updating key size estimations for pairings
• LOVE a pairing
• A survey on delegated computation
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Secure and efficient delegation of elliptic-curve pairing
• Still wrong use of pairings in cryptography
• Secure Top-k Subgroup Discovery
• The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
• Attractive subfamilies of BLS curves for implementing high-security pairings
• Adequate elliptic curves for computing the product of n pairings
• Tightly secure inner product functional encryption: multi-input and function-hiding constructions
• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
• Co-factor clearing and subgroup membership testing on pairing-friendly curves
• Compact structure-preserving signatures with almost tight security
• Secure and Efficient Pairing at 256-Bit Security Level
• The Tate profile
• Revisiting pairing-friendly curves with embedding degrees 10 and 14

This page was built for publication: Subgroup security in pairing-based cryptography

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