Topics in Cryptology – CT-RSA 2005

DOI10.1007/b105222zbMath1079.94572OpenAlexW2476332689MaRDI QIDQ5710839

No author found.

Publication date: 8 December 2005

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

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

zbMATH Keywords

Elliptic curvespairing-based cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Unnamed Item ⋮ Efficient selective identity-based encryption without random oracles ⋮ Comparing two pairing-based aggregate signature schemes ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Computing pairings using \(x\)-coordinates only ⋮ Secure and Efficient Group Key Agreements for Cluster Based Networks ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings

This page was built for publication: Topics in Cryptology – CT-RSA 2005