International Association for Cryptologic Research

Crypto 2001 Rump Session

Tuesday, August 21

7:00

Session 1: Cryptanalysis, elections, elliptic curves, announcements

Introduction 
Stuart Haber

It's all a matter of viewpoint 
Whit Diffie, John Gilmore

Weaknesses in the key-scheduling algorithm of RC4
Scott Fluhrer, Itsik Mantin, Adi Shamir

Using the Fluhrer, Mantin, and Shamir attack to break WEP
Adam Stubblefield, John Ioannidis, Avi Rubin

A verifiable secret shuffle and its application to e-voting 
Andy Neff

No more panic in Florida: Reality or dream? 
Kwangjo Kim, Jinho Kim, Byoungcheon Lee

7:27
Cryptanalysis of the revised NSS signature scheme 
Craig Gentry, Michael Szydlo

Cryptanalysis of a pseudorandom generator based on the braid group, or The decisional Ko-Lee assumption is false
Rosario Gennaro, Daniele Micciancio

The compression side channel 
John Kelsey

Umbral optimal normal bases 
A. Jurisic

Financial Cryptography '02 
Matt Blaze

Announcements from NIST 
Morris Dworkin

HDCP -- as spec' d 
Gideon Yuval

CryptoBroker 
Jim Hughes


8:10

Session 2: Block ciphers, short & long keys, public-key security, protocols

A new class of invertible mappings 
Alexander Klimov, Adi Shamir

A working implementation of the time-memory trade-off of Hellman, and How many
40-bit keys can we break with a simple computer during a short rump-session talk?
J.-J. Quisquater, G. Rouvroy, F.-X. Standaert, J.-P. David, and J.-D. Legat

Deterministic and bountiful generation of block substitution tables with maximal nonlinearity
Lothrop Mittenthal

New covering radius of Reed-Muller codes for t-resilient functions 
Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa

A trivial attack against CBC-PAD: Breaking SSL, IPSEC, WTLS, ... 
and Alert on nonlinearity: Linearities in Rijndael, Kasumi, ...
Serge Vaudenay

Securely combining public-key cryptosystems 
Benny Pinkas, Stuart Haber

A provably secure IND-CCA public-key encryption scheme as efficient as El-Gamal
David Soldera

Bidirectional security
Y. Dodis, J. Katz, S. Xu, M. Yung

Generating long shared keys in the storage-bounded model 
Stefan Dziembowski, Ueli Maurer

On the composition of authenticated Byzantine agreement 
Yehuda Lindell, Ann Lysyanskaya, Tal Rabin

On the model of distinguishers in computational zero knowledge 
Jun Furukawa, Satoshi Obana, Tatsuaki Okamoto, Kazue Sako

Reusable time-lines and applications 
Juan Garay, Markus Jakobsson

Non-malleable commitments based on factoring 
Roger Fischlin, Marc Fischlin

9:07  Break

9:20

Session 3: Signatures, quantum crypto, miscellaneous topics

How many 40-bit keys can we break ... during a short rump-session talk? 
J.-J. Quisquater, et al.

Short signatures from the Weil pairing
Dan Boneh, Ben Lynn, Hovav Shacham

A short DSS-based signature
Ilya Mironov

Composition and efficiency tradeoffs for forward-secure digital signatures
Tal Malkin, Daniele Micciancio, Sara Miner

Secure digital signatures with McEliece and new records in short signatures
Nicolas T. Courtois, Matthieu Finiasz, Nicolas Sendrier

Security notions of unconditionally secure signature schemes
Junji Shikata, Goichiro Hanaoka, Yuliang Zheng, Hideki Imai

9:49
Quantum coin flipping with arbitrary small bias is impossible 
Yuki Tokunaga

A quantum information-theoretical model for quantum secret-sharing schemes
Anderson Nascimento, Yodai Watanabe, Hideki Imai

A dual watermarking and fingerprinting system 
Darko Kirovski, Henrique Malvar, Yacov Yacobi

State-varying hybrid stream cipher 
Viswanath Ananth

Tree decision Diffie-Hellman problem 
Yongdae Kim

Introducing GammaPi 
Seth Patinkin

10:13 Good night!



[ IACR home page | IACR Newsletter page and archive | This issue ] © IACR