Workshop on Computer Security and Cryptography

April 12-16, 2010

Program

 

Monday, April 12, 2010

09:00 - 09:30
Registration (Room 5345) and Coffee & Croissants (Room 6245)

Session - Cryptographic Primitives
Meeting room : 6214

09:30 - 10:30
Renate Scheidler
(University of Calgary)
(Hyper-)elliptic curve cryptography
Abstract

Diapos / Slides
10:30 - 11:00
Coffee break
Room 6245
11:00 - 12:00
Christopher Peikert
(Georgia Institute of Technology)
Public-key cryptosystems from the worst-case shortest vector problem
Abstract

Diapos / Slides
12:00 - 12:30
Éric Schost
(University of Western Ontario)
Computing square roots in nice fields
Abstract

Diapos / Slides

12:30 - 14:00
Lunch break

Session - Cryptographic Primitives
Meeting room : 6214

14:00 - 15:00
Jung Hee Cheon
(Seoul National University)
Generalized algorithm for DLP with auxiliary inputs
Abstract
15:00 - 15:30
Coffee break
Room 6245
15:30 - 16:00
Christiane Peters
(Technische Universiteit Eindhoven)
Code-based Cryptography
Abstract

Diapos / Slides
16:15 - 16:45
Christophe Petit
(Université Catholique de Louvain)
Hash functions and Cayley graphs: the end of the story?
Abstract

Diapos / Slides

17:00
Welcoming reception
Room 6245

 

Tuesday, April 13, 2010

09:00 - 09:30
Coffee & Croissants
Room 6245

Session - Pairings I & Curves
Meeting room : 6214

09:30 - 10:30
Hovav Shacham
(University of California, San Diego )
On the generic group model in pairing-based cryptography
Abstract

Diapos / Slides
10:30 - 11:00
Coffee break
Room 6245
11:00 - 12:00
Kirsten Eisentraeger
(Pennsylvania State University)
Pairings on hyperelliptic curves
Abstract

Diapos / Slides
12:00 - 12:30
Melissa E. Chase
(Microsoft Research)
Pairing-based proof systems and applications
Abstract

12:30 - 14:00
Lunch break

Session - Pairings I & Curves
Meeting room : 6214

14:00 - 15:00
Alice Silverberg
(University of California, Irvine )
Pairing-friendly composite order bilinear groups
Abstract
15:00 - 15:30
Coffee break
Room 6245
15:30 - 16:00
Michael Naehrig
(Microsoft Research)
Choosing curves and coordinates for pairing computation
Abstract

Diapos / Slides
16:15 - 16:45
Christophe Ritzenthaler
(Université de la Méditerranée)
Addition laws on plane quartics
Abstract

Diapos / Slides

 

Wednesday, April 14, 2010

09:00 - 09:30
Coffee & Croissants
Room 6245

Session - (EC) DLP and Pairings II
Meeting room : 6214

09:30 - 10:30
Steven Galbraith
(University of Auckland)
A random talk
Abstract

Diapos / Slides
10:30 - 11:00
Coffee break
Room 6245
11:00 - 11:30
Peter Schwabe
(Eindhoven University of Technology)
Breaking ECC2K-130 on cell processors and GPUs
Abstract

Diapos / Slides
11:45 - 12:15
Sanjit Chatterjee
(University of Waterloo)
On efficient and secure implementation of pairing-based protocols in the type 4 setting
Abstract

Diapos / Slides
12:30 - 13:00
Koray Karabina
(University of Waterloo)
Torus-based compression by factor 4 and 6
Abstract

Diapos / Slides

13:00
Lunch Break and Free Afternoon

 

Thursday, April 15, 2010

09:00 - 09:30
Coffee & Croissants
Room 6245

Session - Theory & Curves
Meeting room : 6214

09:30 - 10:30
Igor Shparlinski
(Macquarie University)
Playing hide and seek in finite fields: hidden number problem and its applications
Abstract

Diapos / Slides
10:30 - 11:00
Coffee break
Room 6245
11:00 - 12:00
Alexandra Boldyreva
(Georgia Institute of Technology)
Deterministic encryption: theory and applications
Abstract
12:00 - 12:30
Payman Mohassel
(University of Calgary)
Adaptive trapdoor functions and chosen ciphertext security
Abstract

Diapos / Slides

12:30 - 14:00
Lunch break

Session - Theory & Curves
Meeting room : 6214

14:00 - 15:00
Victor S. Miller
(IDA - Center for Communications Research)
A tour through Elliptic Divisibility Sequences
Abstract

Diapos / Slides
15:00 - 15:30
Coffee break
Room 6245
15:30 - 16:00
Andrew V. Sutherland
(Massachusetts Institute of Technology)
Decomposing class polynomials with the CRT method
Abstract

Diapos / Slides
16:15 - 16:45
Bianca Viray
(University of California, Berkeley)
Constructing genus 2 curves for cryptography and denominators of Igusa class polynomials
Abstract

19:00
Conference Dinner, Chez Queux (158, St-Paul Street East, Old Montreal)

 

Friday, April 16, 2010

09:00 - 09:30
Coffee & Croissants
Room 6245

Session - Factoring
Meeting room : 6214

09:30 - 10:30
Vinod Vaikuntanathan
(IBM T.J. Watson)
Fully homomorphic encryption over the integers
Abstract

Diapos / Slides
10:30 - 11:00
Coffee break
Room 6245
11:00 - 12:00
Daniel J. Bernstein
(University of Illinois at Chicago)
The factorization of RSA-1024
Abstract

Diapos / Slides
12:00 - 12:30
Thorsten Kleinjung
(École Polytechnique Fédérale de Lausanne (EPFL))
The factorisation of RSA-768
Abstract

Diapos / Slides

12:30 - 14:00
Lunch break

Session - Factoring
Meeting room : 6214

14:00 - 15:00
David Molnar
(Microsoft Research )
Cryptographic opportunities for refining theory with experiment
Abstract

15:00
Coffee, tea, cookies
Room 6245

15:00
Closure of the workshop