You have Guest access.
Log In
Steven D. Galbraith and Kenneth G. Paterson
Front matter
1-17
Pairings in Trusted Computing
18-38
Pairing Lattices
39-56
The Uber-Assumption Family A Unified Complexity Framework for Bilinear Groups
57-74
Homomorphic Encryption and Signatures from Vector Decomposition
75-88
Hidden-Vector Encryption with Groups of Prime Order
89-99
The Hidden Root Problem
100-112
Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
113-125
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group
126-135
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
136-145
Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
146-163
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
164-177
Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
178-191
Integer Variable χ –Based Ate Pairing
192-210
Pairing Computation on Twisted Edwards Form Elliptic Curves
211-224
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
225-242
Generators for the ℓ-Torsion Subgroup of Jacobians of Genus Two Curves
243-264
Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
265-281
Pairings on Hyperelliptic Curves with a Real Model
282-296
Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
297-315
A Comparison between Hardware Accelerators for the Modified Tate Pairing over \mathbbF2m\mathbb{F}_{2^m} and \mathbbF3m\mathbb{F}_{3^m}
316-331
One-Round ID-Based Blind Signature Scheme without ROS Assumption
332-353
Tracing Malicious Proxies in Proxy Re-encryption
354-375
Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info