Workshop on Cryptography: Underlying Mathematics, Provability and Foundations

November 27 - December 1, 2006, The Fields Institute

Location: Fields Institute, Room 230

Description

The workshop will be devoted to fundamental issues in security, cryptography and protocols. The workshop will be interested in the study of fundamental cryptographic primitives and their power, as well as their application in developing new and important cryptographic protocols. As well, it will be interested in the study of formal notions of security of the standard protocols such as key exchange.

Confirmed list of speakers

Adi Akavi (MIT)
Amos Beimel (Ben-Gurion University)
Dan Bernstein (UIC)
Dan Brown (Certicom)
Debra Cook (Lucent)
Jean-Marc Couveignes (Toulouse)
Giovanni Di Crescenzo (Telcordia)
Jintai Ding (Cincinnati)
Juan Garay (Lucent)
Shai Halevi (IBM Research)
David Jao (Waterloo)
Jonathan Katz (Maryland)
Aggelos Kiayias (University of Connecticut)

Vlad Kolesnikov (Lucent)
Hugo Krawczyk (Technion)
Anna Lysyanskaya (Brown University)
Alexander May (Technical University of Darmstadt)
Stephen Miller (Rutgers)
Kumar Murty (Toronto)
Tatsuaki Okamoto (NTT, Japan)
Leonid Reyzin (Boston University)
Rei Safavi-Naini (University of Woollongong)
Berry Schoenmakers (Eindhoven)
Doug Stinson (Waterloo)
Ram Venkatesan (Microsoft Corporation)
Moti Yung (RSA Labs and Columbia)

Schedule

Monday, November 27th, 2006
08:30 to 09:00	Coffee and Registration
09:00 to 10:00	Efficient Pseudorandom Generators Based on the DDH Assumption Berry Schoenmakers, Technical University Eindhoven
10:00 to 10:30	Coffee Break
10:30 to 11:20	Private approximation of search problems Amos Beimel, Ben-Gurion University
11:25 to 12:15	Group Encryption Moti Yung, Columbia University
12:15 to 14:10	Lunch Break
14:10 to 15:00	Proving tight security for Rabin-Williams signatures Dan Bernstein
15:00 to 15:30	Coffee Break
15:30 to 16:20	Randomized Sparse Representations of integer representations for Elliptic Curve and applications Ramarathnam Venkatesan, Microsoft Research
16:25 to 17:15	New Cryptanalytic Results for RSA with Small Exponents Alexander May, TU Darmstadt
17:15	Reception

Tuesday, November 28th, 2006
09:00 to 10:00	Copyrighting public-key encryption and black-box traitor tracing Aggelos Kiayias
10:00 to 10:30	Coffee Break
10:30 to 11:20	Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets Leonid Reyzin, Boston University
11:25 to 12:15	Concurrently-Secure Blind Signatures Jonathan Katz, UMD
12:15 to 14:10	Lunch Break
14:10 to 15:00	Compact Ecash and Applications Anna Lysyanskaya, Brown University
15:00 to 15:30	Coffee Break
15:30 to 16:20	HMQV and Why Provable Security Matters Hugo Krawczyk, IBM Research
16:25 to 17:15	Isogenies as a cryptographic primitive David Jao, University of Waterloo

Wednesday, November 29th, 2006
09:00 to 10:00	On Basing One-Way Functions on NP-Hardness Adi Akavi, Massachusetts Institute of Technology
10:00 to 10:30	Coffee Break
10:30 to 11:20	Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions Juan Garay
11:25 to 12:15	Mitigating Dictionary Attacks on Password-Protected Local Storage Shai Halevi, Massachusetts Institute of Technology

Thursday, November 30th, 2006
09:00 to 10:00	Can HFE be saved? Jintai Ding, TU Darmstadt
10:00 to 10:30	Coffee Break
10:30 to 11:20	Hard homogeneous spaces Jean-Marc Couveignes
11:25 to 12:15	Provable Collisions in the Pollard Rho Algorithm for DLOG Stephen Miller, Rutgers University
12:15 to 14:10	Lunch Break
14:10 to 15:00	Difficulty and Inapplicability of the RSA problem Dan Brown, BlackBerry Corp
15:00 to 15:30	Coffee Break
15:30 to 16:20	Elastic block ciphers Debra Cook
16:25 to 17:15	An Efficient Public-Key Encryption Scheme under Standard Assumptions Tatsuaki Okamoto, NTT Network Service Systems Laboratories

Friday, December 1st, 2006
09:00 to 10:00	Information Theoretic Bounds on Authentication Systems in Query Model Rei Safavi-Naini, Director of Institute for Security, Privacy and Information Assurance, University of Calgary and University of Calgary
10:00 to 10:30	Coffee Break
10:30 to 11:20	Virus Localization using Cryptographic Primitives Giovanni Di Crescenzo
11:25 to 12:15	How to tell which of the encrypted numbers is greater Vlad Kolesnikov, University of Toronto
12:15 to 14:10	Lunch Break
14:10 to 15:00	Hash Function Games and Two-Channel Authentication Douglas Stinson, University of Waterloo
15:00 to 15:30	Coffee Break
15:30 to 16:20	Factorization and Modular forms Kumar Murty, University of Toronto

Organizing Committee

Arjen Lenstra - École Polytechnique Fédérale de Lausanne

Charles Rackoff - University of Toronto

Ramarathnam Venkatesan - Microsoft Research

Moti Yung - Columbia University

Scheduled as part of

Thematic Program in Cryptography

The Fields Institute for
Research in Mathematical Sciences