Crypto '99 Rump Session Schedule

Stuart Haber Presiding

Session I

7:00 Introduction
Stuart Haber
7:03 Prize awards for Hasty Pudding analysis
Rich Schroeppel
7:10 Belgian remarks on U.S. pudding
Carl D'Halluin, Gert Bijnens, Bart Preneel, Vincent Rijmen
7:14 An attack on ISO 9786-1
Don Coppersmith, Shai Halevi, Charanjit Jutla
7:21 FPGA: A practical tool for cryptanalysis with running examples
F. Koeune, J.-J. Quisquater, R. Sebastien, J.-P. David, T. Gilmont, J.-D. Legat
7:25 Quadruple DES
Paul Kocher
7:28 Crypto law & export control update
John Gilmore (& Cindy Cohn)
7:35 Fast precomputation for discrete logarithm cryptosystems
C.P. Schnorr
7:40 Issues in tamper resistance
Benjamin Jun
7:44 Random number generator failure in provably secure encryption schemes
William Whyte, Burt Kaliski
7:50 (1) Arms export: Blazonry for dummies (2) Oenocryptology
Don Beaver
7:56-8:10 Break

Session II

8:10 Fun with cryptography: How not to set a final exam question
G. Agnew
8:15 Signature schemes based on the strong RSA assumption
Ronald Cramer, Victor Shoup
8:19 Constructions of universal hash families from algebraic curves over finite fields
Chaoping Xing, Huaxiong Wang, Kwok Yan Lam
8:26 What is the PGP key of Bill Gates? A practical experiment with
key servers J.-J. Quisquater
8:30 How to solve a system of equations inside IDEA
E.G. Giessmann, G. Lassmann
8:32 Keeping secrets using .o files
Steve Meyer
8:37 Computer license plates
Thomas Cusick
8:41 A probabilistic poly-time framework for protocol analysis
P. Lincoln, J. Mitchell, M. Mitchell, A. Scedrov
8:46 Cross-encryption
Rosario Gennaro, Shai Halevi, Tal Rabin
8:52 New forgeries with Rabin-like cryptosystems
J.-S. Coron, M. Joye, J.-J. Quisquater
8:57 Cracking Kryptos (well, almost)
Jim Gillogly
9:01 Introducing the T-class of SOBER stream ciphers
Greg Rose, Philip Hawkes
9:06 Studying cycles in RC4
Chris Hall
9:11 Next-generation mobile phone algorithms
Greg Rose
9:15-9:30 Break

Session III

9:30 The P-problem: a solved instance and its implications
Detlef Huehnlein
9:33 Player elimination in distributed protocols: Can resilience be for free?
Martin Hirt, Ueli Maurer, Bartosz Przydatek
9:39 Efficient separable fair contract signing schemes based on standard signatures
Jan Camenisch, Markus Michels
9:45 Consistency concerns for fair exchange
Paul Syverson
9:51 OEF using a successive extension
Kazumaro Aoki, Fumitaka Hoshino, Tetsutaro Kobayashi
9:54 Tricks for a better efficiency of authentication protocols
Marc Girault
9:58 Public-key cryptography and password protocols: The multi-user case
Maurizio Boyarsky (presented by Cynthia Dwork)
10:03 Correlated coins and applications to game theory
Yevgeniy Dodis, Shai Halevi, Tal Rabin
10:09 Complete characterization of security notions for probabilistic private-key encryption
Jonathan Katz, Moti Yung
10:14 Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Amit Sahai
10:16 A secure e-mail voting scheme with trusted authorities for one occasion
Jozsef Lukovics
10:19 Riffle-shuffle and gray-code as block cipher components
Jayant Shukla
10:22 A new blind signature scheme
Pascal Paillier
10:26 Efficient dynamic traitor tracing
Omer Berkman, Michal Parnas, Jiri Sgall
10:31 On full linear (k, n) traceability schemes
K. Kurosawa, M. Burmester, Y. Desmedt
10:35 A new measure of cryptanalytic strength
Bruce Schneier
10:38 Towards a simple distributed undeniable method of achieving robustly threshold-untraceable indistinguishability
Michael Richardson
10:40 END