Pairing-Based Cryptography – Pairing 2008: Second International Conference, Egham, UK, September 1-3, 2008. Proceedings

Liqun Chen, Paul Morrissey, Nigel P. Smart (auth.), Steven D. Galbraith, Kenneth G. Paterson (eds.)3540855033, 9783540855033

This book constitutes the thoroughly refereed proceedings of the Second International Conference on Pairing-Based Cryptography, Pairing 2008, held in London, UK, in September 2008.

The 20 full papers, presented together with the contributions resulting from 3 invited talks, were carefully reviewed and selected from 50 submissions. The contents are organized in topical sections on cryptography, mathematics, constructing pairing-friendly curves, implementation of pairings, and hardware implementation.

Table of contents :
Front Matter….Pages –
Pairings in Trusted Computing….Pages 1-17
Pairing Lattices….Pages 18-38
The Uber-Assumption Family….Pages 39-56
Homomorphic Encryption and Signatures from Vector Decomposition….Pages 57-74
Hidden-Vector Encryption with Groups of Prime Order….Pages 75-88
The Hidden Root Problem….Pages 89-99
Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography….Pages 100-112
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group….Pages 113-125
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field….Pages 126-135
Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials….Pages 136-145
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties….Pages 146-163
Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2  =  x 5  +  ax ….Pages 164-177
Integer Variable χ –Based Ate Pairing….Pages 178-191
Pairing Computation on Twisted Edwards Form Elliptic Curves….Pages 192-210
Exponentiation in Pairing-Friendly Groups Using Homomorphisms….Pages 211-224
Generators for the ℓ-Torsion Subgroup of Jacobians of Genus Two Curves….Pages 225-242
Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms….Pages 243-264
Pairings on Hyperelliptic Curves with a Real Model….Pages 265-281
Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition….Pages 282-296
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $mathbb{F}_{2^m}$ and $mathbb{F}_{3^m}$ ….Pages 297-315
One-Round ID-Based Blind Signature Scheme without ROS Assumption….Pages 316-331
Tracing Malicious Proxies in Proxy Re-encryption….Pages 332-353
Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities….Pages 354-375
Back Matter….Pages –