On the selection of pairing-friendly groups
From MaRDI portal
Recommendations
Cited in
(33)- On the relationship between squared pairings and plain pairings
- Choosing and generating parameters for pairing implementation on BN curves
- An efficient location-based compromise-tolerant key management scheme for sensor networks
- A taxonomy of pairing-friendly elliptic curves
- A provably secure proxy signcryption scheme using bilinear pairings
- Extended explicit relations between trace, definition field, and embedding degree
- Parallelizing the Weil and Tate pairings
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Faster Pairings on Special Weierstrass Curves
- Idetity based group key agreement from bilinear pairing
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Certificateless message recovery signatures providing Girault's level-3 security
- Easy Decision Diffie-Hellman Groups
- Elliptic curves in Huff’s model
- Huff's model for elliptic curves
- A pairing-less identity-based blind signature with message recovery scheme for cloud-assisted services
- An efficient ring signature scheme from pairings
- Optimised Versions of the Ate and Twisted Ate Pairings
- Efficient and Short Certificateless Signature
- Algorithms for pairing-friendly primes
- A survey of elliptic curves for proof systems
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- Efficient proxy signcryption scheme with provable CCA and CMA security
- Fuzzy perspective of online games by using cryptography and cooperative game theory
- Updatable public-key encryption, revisited
- Extending Regev's quantum algorithm to elliptic curves
- PMNS arithmetic for elliptic curve cryptography
- On security proofs of existing equivalence class signature schemes
- Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing
- A comparison of MNT curves and supersingular curves
- On computable isomorphisms in efficient asymmetric pairing-based systems
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
This page was built for publication: On the selection of pairing-friendly groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713963)