Final Program New!

All lectures will be held in the Management auditorium (Moore building annex) at Royal Holloway University of London.

Invited lectures will be 55 minutes, contributed talks will be 25 minutes. There will be 5 minutes for questions and change-over.

Speakers can use their own laptop or bring talks on USB disk.

Sunday, August 31

17:00 - 19:00   Registration and Microsoft drinks reception at "The Hub"
19:00 - 20:00 Dinner at "The Hub"

Monday, September 1

09:00 - 09:50   Registration, tea and coffee at Management auditorium
09:50 - 10:00 Opening remarks
[Invited Talk]
 

10:00 - 11:00 Pairings in Trusted Computing
L. Chen, P. Morrissey and N.P. Smart
11:00 - 11:30 Coffee
[Cryptography I]
 

11:30 - 12:00 Homomorphic Encryption and Signatures from Vector Decomposition
T. Okamoto and K. Takashima
12:00 - 12:30 Hidden-Vector Encryption with Groups of Prime Order
V. Iovino and G. Persiano
12:30 - 14:00 Lunch at "The Hub"
[Mathematics]
 

14:00 - 14:30 Evaluating large degree isogenies and applications to pairing based cryptography
R. Broeker, D. Charles and K. Lauter
14:30 - 15:00 The Hidden Root Problem
F. Vercauteren
15:00 - 15:30 Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group
K. Eisentraeger, D. Jetchev and K. Lauter
15:30 - 16:00 Coffee
[Constructing Pairing Friendly Curves]
 

16:00 - 16:30 Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field
E. J. Kachisa, E. F. Schaefer and M. Scott
16:30 - 17:00 Constructing pairing-friendly elliptic curves using factorization of cyclotomic polynomials
S. Tanaka and K. Nakamula
17:00 - 17:30 A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
D. Freeman
17:30 - 18:00 Pairing-friendly Hyperelliptic Curves with Ordinary Jacobians of Type $y^2=x^5+ax$
M. Kawazoe and T. Takahashi
19:00 - 20:00 Dinner at "The Hub"

Tuesday, September 2

[Invited talk]
 

09:00 - 10:00   Pairing Lattices
F. Hess
10:00 - 10:30 Coffee
[Implementation of Pairings]
 

10:30 - 11:00 Integer Variable x-based Ate Pairing
Y. Nogami, M. Akane, Y. Sakemi, H. Kato and Y. Morikawa
11:00 - 11:30 Pairing Computation on Twisted Edwards Form Elliptic Curves
M. P. L. Das and P. Sarkar
11:30 - 12:00 Exponentiation in Pairing-Friendly Groups Using Homomorphisms
S. D. Galbraith and M. Scott
12:00 - 12:30 Generators for the l-Torsion Subgroup of Jacobians of Genus Two Curves
C. R. Ravnshoj
12:30 - 14:00 Lunch at "The Hub"
[Implementation of Pairings in Genus 2]
 

14:00 - 14:30 Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
X. Fan, G. Gong and D. Jao
14:30 - 15:00 Pairings on Hyperelliptic Curves with a Real Model
S. D. Galbraith, X. Lin and D. J. Mireles Morales
[Hardware Implementation]
 

15:00 - 15:30 Faster Implementation of eta_T Pairing Over GF(3^m) Using Minimum Number of Logical Instructions for GF(3)-Addition
Y. Kawahara, K. Aoki and T. Takagi
15:30 - 16:00 A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F_2^m and F_3^m
J.-L. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto and F. Rodriguez-Henriquez
16:00 - 18:00 Walk in Windsor Great Park
19:00 - 19:30 Microsoft sponsored drinks reception:
North Quad, Founders
19:30 - Conference Banquet:
Founders building dining hall. Dress informal.

Wednesday, September 3

[Invited talk]
 

09:00 - 10:00   The Uber-Assumption Family: A Unified Complexity Framework for Bilinear Groups
X. Boyen
10:00 - 10:30 Coffee
[Cryptography II]
 

10:30 - 11:00 One-Round ID-Based Blind Signature Scheme without ROS Assumption
W. Gao, G. Wang, X. Wang and F. Li
11:00 - 11:30 Tracing Malicious Proxies in Proxy Re-Encryption
B. Libert and D. Vergnaud
11:30 - 12:00 Security And Anonymity Of Identity-based Encryption With Multiple Trusted Authorities
K. G. Paterson and S. Srinivasan
12:00 - 13:30 Sandwich Lunch: Management Auditorium