Pairing-Based Cryptography – Pairing 2008

1. Front Matter

   PDF

2. Invited Talks

   1. Pairings in Trusted Computing

      • Liqun Chen, Paul Morrissey, Nigel P. Smart

      Pages 1-17

   2. Pairing Lattices

      • Florian Hess

      Pages 18-38

   3. The Uber-Assumption Family

      • Xavier Boyen

      Pages 39-56

3. Cryptography I

   1. Homomorphic Encryption and Signatures from Vector Decomposition

      • Tatsuaki Okamoto, Katsuyuki Takashima

      Pages 57-74

   2. Hidden-Vector Encryption with Groups of Prime Order

      • Vincenzo Iovino, Giuseppe Persiano

      Pages 75-88

4. Mathematics

   1. The Hidden Root Problem

      • Frederik Vercauteren

      Pages 89-99

   2. Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography

      • Reinier Bröker, Denis Charles, Kristin Lauter

      Pages 100-112

   3. Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group

      • Kirsten Eisenträger, Dimitar Jetchev, Kristin Lauter

      Pages 113-125

5. Constructing Pairing Friendly Curves

   1. Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field

      • Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott

      Pages 126-135

   2. Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials

      • Satoru Tanaka, Ken Nakamula

      Pages 136-145

   3. A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties

      • David Freeman

      Pages 146-163

   4. Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y ² = x ⁵ + ax

      • Mitsuru Kawazoe, Tetsuya Takahashi

      Pages 164-177

6. Implementation of Pairings

   1. Integer Variable χ–Based Ate Pairing

      • Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, Hidehiro Kato, Yoshitaka Morikawa

      Pages 178-191

   2. Pairing Computation on Twisted Edwards Form Elliptic Curves

      • M. Prem Laxman Das, Palash Sarkar

      Pages 192-210

   3. Exponentiation in Pairing-Friendly Groups Using Homomorphisms

      • Steven D. Galbraith, Michael Scott

      Pages 211-224

   4. Generators for the ℓ-Torsion Subgroup of Jacobians of Genus Two Curves

      • Christian Robenhagen Ravnshøj

      Pages 225-242

   5. Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms

      • Xinxin Fan, Guang Gong, David Jao

      Pages 243-264

   6. Pairings on Hyperelliptic Curves with a Real Model

      • Steven D. Galbraith, Xibin Lin, David J. Mireles Morales

      Pages 265-281

7. Hardware Implementation

   1. Faster Implementation of η _T Pairing over GF(3^m) Using Minimum Number of Logical Instructions for GF(3)-Addition

      • Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi

      Pages 282-296

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.

• Tate paring
• algorithms
• bilinear group
• broadcast encryption
• cryptographic protocols
• cryptography
• elliptic curves
• hardware acceleration
• hidden root
• homomorphic encryption
• hyperelliptic curves
• identity-based encryption
• lattices
• pairing
• trusted computing
• algorithm analysis and problem complexity

Policies and ethics