|
Session
1: Introduction
|
2 min
|
|
7:30pm
|
Stuart Haber
|
|
Session
2: Announcements
|
8 min
|
|
7:32pm
|
2nd Annual PKI Workshop
Carl Ellison
|
1 min
|
|
|
Cryptographers Track, RSA Conference 2003
Helena Handschuh
|
1 min
|
|
|
PKC 2003
Mike Burmester
|
1 min
|
|
|
1st IEEE International Security in Storage Workshop
James Hughes
|
1 min
|
|
|
Financial Cryptography 2003
Rebecca Wright
|
1 min
|
|
|
The NESSIE project
Markus Dichtl
|
3 min
|
|
Session
3: Invited Talk
|
|
|
7:40pm
|
Polynomial-time deterministic primality tests
Dan Bernstein
|
10 min
|
|
Session
4: Symmetric-key cryptanalysis
|
14 min
|
|
7:50pm
|
Breaking TLS with the CBC-PAD flaw
Serge Vaudenay
|
3 min
|
|
|
OFB and CFB modes: A cautionary note regarding IV
selection
David Wagner
|
4 min
|
|
|
Cryptanalysis of ATM-based passive optical networks
David Wagner
|
3 min
|
|
|
An improvement in attacking RC4: 2^200 down, 2^600 to go
Ilya Mironov
|
4 min
|
|
Session
5: Protocols and cryptosystems
|
24 min
|
|
8:04pm
|
High-bandwidth provably secure stegonography
Yvo Desmedt
|
4 min
|
|
|
Settling the traceability question for the
Kurosawa-Desmedt scheme
Aggelos
Kiayias
|
4 min
|
|
|
A forward-secure public-key encryption scheme
Jonathan Katz
|
4 min
|
|
|
Working in the infeasible: Timed fair exchange of
arbitrary signatures
Juan Garay
|
4 min
|
|
|
Distributed verifiable random functions
Yevgeniy
Dodis
|
4 min
|
|
|
In search of snake oil: A rump CHESsion
Jean-Jacques
Quisquater
|
4 min
|
|
|
|
|
|
8:28pm
|
Break
|
17 min
|
|
|
|
|
|
Session
6: Systems
|
21 min
|
|
8:45pm
|
Palladium preview
Brian LaMacchia
|
7 min
|
|
|
Traitor revocation with traitor tracing
Carl Ellison
|
5 min
|
|
|
Votopia will be continued...
Kwangjo Kim
|
5 min
|
|
|
Random numbers: Too important to be left to chance!
Don Johnson
|
4 min
|
|
Session
7: Signatures and key agreement
|
13 min
|
|
9:06pm
|
Aggregate signatures from the Weil pairing
Hovav Shachem
|
4 min
|
|
|
Authenticated n-party key agreement from multi-linear
forms
Hyang-Sook Lee
|
3 min
|
|
|
Authenticated group key agreement protocol on braid groups
Hyang-Sook Lee
|
3 min
|
|
|
Short ring signatures
Beny Lynn
|
3 min
|
|
Session 8: Ciphers
|
22 min
|
|
9:19pm
|
NTRU News
Nick Howgrave-Graham
|
4 min
|
|
|
Security of CBC ciphersuites in SSL/TLS
Bodo Moller
|
4 min
|
|
|
Potential improvements to RSA-OAEP
Jakob Jonsson
|
3 min
|
|
|
Further multivariate quadratic equations in AES/BES
Greg Rose
|
4 min
|
|
|
Turing: A fast software stream cipher
Greg Rose
|
4 min
|
|
|
New results on iterated DES constructions
Bruce
Schneier
|
3 min
|
|
|
|
|
|
9:41pm
|
Break
|
19 min
|
|
|
|
|
|
Session
9: More systems, etc.
|
22 min
|
|
10:00pm
|
Related-key cryptanalysis of a university residential facility
Matt Blaze
|
5 min
|
|
|
Fighting spam
Cynthia Dwork
|
4 min
|
|
|
Security implications of the CAP theorem
Carl Ellison
|
3 min
|
|
|
A convenient trust model for self-certification of
digital signatures
Lyman Hazelton
|
3 min
|
|
|
WYSIWYG or Eddy current for magnetic analysis with
active sensors: Applications to the security of smart cards
David Samyde
|
4 min
|
|
|
Efficient double-and-add on an elliptic curve
Kristin
Lauter
|
3 min
|
|
Session
10: Public-key cryptanalysis
|
14 min
|
|
10:22pm
|
The cost of integer factorization
Dan Bernstein
|
5 min
|
|
|
The CHIMERA key-agreement protocol is not
unconditionally secure but rather totally insecure
Werner Schindler
|
3 min
|
|
|
Key-collisions in (EC)DSA
Tomas Rosa
|
3 min
|
|
|
Bypassing the standard scheme for elliptic-curve
validation for ECDSA
Serge Vaudenay
|
3 min
|
|
Session
11: Papers (to be) presented elsewhere
|
16 min
|
|
10:36pm
|
Randomness-optimal characterization of two NP proof
systems
Giovanni Di
Crescenzo
|
2 min
|
|
|
On the power of claw-free permutations
Yevgeniy
Dodis
|
2 min
|
|
|
Authenticated encryption in SSH: Fixing the SSH binary
packet protocol
Tadayoshi Kohno
|
2 min
|
|
|
Can pairing-based cryptography be generalized?
Alice
Silverberg
|
2 min
|
|
|
Transitive signatures based on factoring and RSA
Gregory Neven
|
2 min
|
|
|
Secure channels based on authenticated encryption
schemes: A simple characterization
Chanathip
Namprempre
|
2 min
|
|
|
Forward-secure signatures with fast key update and efficient
proofs of knowledge of 2^t-th modular roots
Leonid Reyzin
|
2 min
|
|
|
An improved pseudorandom generator based on the
difficulty of factoring
Leonid Reyzin
|
2 min
|
|
|
|
|
|
10:52pm
|
Good night!
|
|