FINAL PROGRAMME

 

MONDAY DECEMBER 14

 

18:30-19:30 Registration in the Tithe Barn

 

19:30-20:30 Buffet Dinner for residents only

 

TUESDAY DECEMBER 15

 

08:45-09:10 Registration

 

09:10-09:15 Opening remarks

 

09:15-10:15 Invited speaker: Frank Kschischang
Subspace Codes

 

On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel

Eirik Rosnes

 

Codes as modules over skew polynomial rings
Delphine Boucher and Felix Ulmer

 

11:05-11:30 Coffee

 

On Higher Weights and Code Existence
Hans Georg Schaathun

 

Mass Formula for Even Codes over $\ZZ_8$
K. Betsumiya, R.A.L. Betty and A. Munemasa

 

On the Classification of Self-Dual $\ZZ_k$-Codes
Masaaki Harada and Akihiro Munemasa

 

12:45-14:00 Lunch

 

On Linear Cryptanalysis with Many Linear Approximations
Benoît Gérard and Jean-Pierre Tillich

 

Bivium as a Mixed-Integer Linear Programming Problem
Julia Borghoff, Lars R. Knudsen, Mathias Stolpe

 

Security of Cyclic Double Block Length Hash Functions
Ewan Fleischmann, Michael Gorski, Stefan Lucks

 

15:15-15:40 Coffee

 

Another Glance at Double-Length Hashing
Onur Özen and Martijn Stam

 

Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
S. Murphy and M.B. Paterson

 

On Linear Codes from Maximal Curves
Stefania Fanali

 

19:00 Dinner

 

WEDNESDAY DECEMBER 16

 

09:00-10:00 Invited speaker: Ronald Cramer
Torsion-Limits for Towers of Algebraic Function Fields and Special Codes in Secure Computation and Complexity

 

Provably Secure Code-Based Threshold Ring Signatures
Léonard Dallot and Damien Vergnaud

 

A New Protocol for the Nearby Friend Problem
Sanjit Chatterjee, Koray Karabina, and Alfred Menezes

 

10:50-11:15 Coffee

 

Distributing the Key Distribution Centre in Sakai-Kasahara based systems
M. Geisler and N.P. Smart

 

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes
Hao Chen, San Ling, Carles Padró, Huaxiong Wang, and Chaoping Xing

 

Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes
Nuttapong Attrapadung and Hideki Imai

 

12:30-14:00 Lunch

 

Certificate-Free Attribute Authentication
Dalia Khader, Liqun Chen, and James H. Davenport

 

Comparing With RSA
Julien Cathalo, David Naccache, and Jean-Jacques Quisquater

 

Double-Exponentiation in Factor-4 Groups and its Applications
Koray Karabina

 

15:15-15:40 Coffee

 

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Antoine Joux, Reynald Lercier, David Naccache, and Emmanuel Thomé

 

An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
Steven Galbraith and Raminder S. Ruprai

 

19:30 Drinks reception

 

20:00 Banquet

 

THURSDAY DECEMBER 17

 

09:00-10:00 Invited speaker: Alexander Pott

On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
Yves Edel and Alexander Pott

 

A new family of hyper-bent Boolean functions in polynomial form
Sihem Mesnager

 

The Rayleigh quotient of bent functions
Lars Eirik Danielsen, Matthew G. Parker, and Patrick Solé

 

10:50-11:15 Coffee

 

Cache Timing Analysis of LFSR-based Stream Ciphers
Gregor Leander, Erik Zenner, and Philip Hawkes

 

Optimal Recovery of Secret Keys from Weak Side Channel Traces
Werner Schindler and Colin D. Walter

 

Practical Zero-Knowledge Proofs for Circuit Evaluation
E. Ghadafi, N.P. Smart, and B. Warinschi

 

12:30-14:00 Lunch