Selected Areas in Cryptography

DOI10.1007/b96837zbMath1081.94016OpenAlexW2501607630MaRDI QIDQ5713963

No author found.

Publication date: 27 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96837

zbMATH Keywords

elliptic curvesTate pairinggroup generatorspairing-based cryptosystems

Mathematics Subject Classification ID

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

Related Items (25)

A Pairing-Less Identity-Based Blind Signature with Message Recovery Scheme for Cloud-Assisted Services ⋮ Idetity based group key agreement from bilinear pairing ⋮ A comparison of MNT curves and supersingular curves ⋮ Easy Decision Diffie-Hellman Groups ⋮ On computable isomorphisms in efficient asymmetric pairing-based systems ⋮ An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ 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 ⋮ Certificateless message recovery signatures providing Girault's level-3 security ⋮ Efficient proxy signcryption scheme with provable CCA and CMA security ⋮ An efficient location-based compromise-tolerant key management scheme for sensor networks ⋮ An efficient ring signature scheme from pairings ⋮ Elliptic curves in Huff’s model ⋮ Huff’s Model for Elliptic Curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Optimised Versions of the Ate and Twisted Ate Pairings ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Parallelizing the Weil and Tate Pairings ⋮ On the relationship between squared pairings and plain pairings ⋮ Efficient and Short Certificateless Signature ⋮ A provably secure proxy signcryption scheme using bilinear pairings

This page was built for publication: Selected Areas in Cryptography