brassard@larry.mcrcim.mcgill.edu (Gilles Brassard) (07/16/89)
PRELIMINARY CRYPTO '89 PROGRAM August 20-25, 1989 Sponsored by the International Association for Cryptologic Research in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the University of California, Santa Barbara Computer Science Department Program Chairman Gilles Brassard, Universite de Montreal General Chairman Kevin S. McCurley, IBM Research and Sandia National Laboratories Program Committee: Josh Benaloh (University of Toronto), Russell Brand (Special session chairperson, Lawrence Livermore Laboratory), Gilles Brassard (Program chairperson, Universite de Montreal) Claude Crepeau (Massachusetts Institute of Technology), Whitfield Diffie (Bell Northern Research), Joan Feigenbaum (AT&T Bell Laboratories), James Massey (ETH Zentrum, Zurich), Jim Omura (Cylink Corporation), Gustavus Simmons (Sandia National Laboratories), Scott Vanstone (University of Waterloo). For further information, contact: Crypto 89, c/o Kevin McCurley IBM Research, K53/802 650 Harry Road San Jose CA 95120--6099 U.S.A. telephone: (408) 927-1708 Internet: mccurley@ibm.com Bitnet: mccurley@almvma -----------------------SUNDAY, August 20, 1989------------------------ 16:00--20:00 Registration 17:30--18:30 Dinner 19:00--22:00 Cocktail Party -----------------------MONDAY, August 21, 1989------------------------ 7:00--8:00 Breakfast ********** SESSION 1: Opening Session 8:30--8:45 Welcome to Crypto '89 8:45--9:15 The Enigma (invited), David Kahn 9:15--9:40 Making conditionally secure cryptosystems unconditionally abuse-free in a general context, Yvo G. Desmedt (University of Wisconsin--Milwaukee) 9:40--10:05 On the existence of bit commitment schemes and zero-knowledge proofs, Ivan B. Damga rd (Aarhus Universitet) 10:05--10:30 Coffee Break ************ SESSION 2: Why is cryptography harder than it looks? (invited session) 10:30--11:00 Cryptography and real world --- An exciting look at dull barriers, or why I see DES everywhere instead of something interesting, Russell Brand (LLNL) 11:00--11:15 Cryptographic protocols in Kerberos, John T. Kohl (MIT) 11:15--11:30 Cracking passwords for fun and profit, David C. Feldmeier and Phil R. Karn (Bellcore) 11:30--11:50 Practical problems with a cryptographic protection scheme, Jonathan M. Smith (Columbia) 11:50--12:00 The smart diskette --- A universal crypto-engine (contributed), Raymond Eisele and Paul Barrett (Computer Security Limited) 12:00--13:00 Lunch ************ SESSION 3: Pseudo-randomness and Sequences 13:45--14:10 On the quadratic spans of de Bruijn sequences, Agnes H. Chan (Northeastern University and MITRE) and Richard A. Games (MITRE) 14:10--14:25 The shortest feedback shift register that can generate a given sequence, Cees J. A. Jansen (Philips, Eindhoven) and Dick E. Boekee (University of Delft) 14:25--14:50 Perfect local randomness in pseudo-random sequences, Ueli M. Maurer and James L. Massey (ETH) 14:50--15:05 On sparse pseudorandom distributions, Oded Goldreich and Hugo Krawczyk (Technion) 15:05--15:20 Bit commitment using pseudo randomness, Moni Naor (IBM Almaden) 15:20--15:50 Coffee Break ************ SESSION 4: Cryptanalysis and Implementation 15:50--16:15 How to predict congruential generators, Hugo Krawczyk (Technion) 16:15--16:30 A chosen text attack on the modified cryptographic checksum algorithm of Cohen and Huang, Bart Preneel, Antoon Bosselaers, Rene Govaerts, and Joos Vandewalle (KUL) 16:30--16:45 On the linear consistency test (LCT) in cryptanalysis with applications, Kencheng Zeng (Academia Sinica), C. H. Yang, and T. R. N. Rao (University of Southwestern Louisiana) 16:45--17:00 Batch RSA, Amos Fiat (Tel--Aviv University) 17:00--17:15 On the implementation of elliptic curve crypto systems, Andreas Bender and Guy Castagnoli (ETH) 17:30--18:30 Dinner 19:00--22:00 Cocktail Party -----------------------TUESDAY, August 22, 1989----------------------- 7:00--8:00 Breakfast ********** SESSION 5: Signature and Authentication I 8:30--9:15 Digital signatures: The evolution of a fundamental primitive (invited), Silvio Micali (MIT) 9:15--9:40 New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs, Mihir Bellare and Shafi Goldwasser (MIT) 9:40--10:05 Undeniable signatures, David Chaum and Hans van Antwerpen (CWI) 10:05--10:30 Coffee Break ************ SESSION 6: Signature and Authentication II 10:30--10:55 A certified digital signature, Ralf C. Merkle (Xerox Parc) 10:55--11:20 Efficient identification and signatures for smart cards, Claus P. Schnorr (Universitat Frankfurt) 11:20--11:35 A signature with shared verification scheme, Marijke De Soete (MBLE, Brussels), Jean--Jacques Quisquater (PRLB), and Klaus Vedder (GAO) 11:35--12:00 On line/off line digital signatures, Shimon Even, Oded Goldreich (Technion), and Silvio Micali (MIT) 12:00--13:00 Lunch Free Afternoon 17:30--18:30 Dinner 19:00--??? Rump Session (work in progress) -----------------------WEDNESDAY, August 23, 1989--------------------- 7:00--8:00 Breakfast ********** SESSION 7: Threshold schemes and Key management 8:30--8:55 On the classification of ideal secret sharing schemes, Ernest F. Brickell and Daniel M. Davenport (Sandia) 8:55--9:10 Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space, Chi-Sung Laih (Cheng Kung University), Lein Harn (University of Missouri--Kansas City), and Jau-Yien Lee (Cheng Kung University) 9:10--9:25 Secret sharing over infinite domains, Benny Chor and Eyal Kushilevitz (Technion) 9:25--9:50 Threshold cryptosystems, Yvo G. Desmedt and Yair Frankel (University of Wisconsin--Milwaukee) 9:50--10:05 Flexible access control with master keys, Gerald C. Chick and Stafford E. Tavares (Queen's University) 10:05--10:30 Coffee Break ************ SESSION 8: Key distribution and Network security 10:30--10:55 Key distribution protocol for digital mobile communication systems, Makoto Tatebayashi, Natsume Matsuzaki (Matsushita), and David B. Newman, Jr. (George Washington University) 10:55--11:10 A key exchange system based on real quadratic fields, Johannes A. Buchmann (Universitat des Saarlandes) and Hugh C. Williams (University of Manitoba) 11:10--11:35 On key distribution systems, Yacov Yacobi (Bellcore) and Z. Shmuely (Technion) 11:35--12:00 SDNS architecture and end-to-end encryption, Ruth Nelson (GTE) 12:00--13:00 Lunch ************ SESSION 9: Fast computation 13:45--14:15 A survey of hardware implementations of RSA (invited), Ernest F. Brickell (Sandia) 14:15--14:30 Modular exponentiation using recursive sums of residues, P. A. Findlay and Brian A. Johnson (Hatfield Polytechnic) 14:30--14:45 A fast modular multiplication algorithm based on higher radix, Hikaru Morita (NTT) 14:45--15:05 Addition chain heuristics, Jurjen Bos and Matthijs Coster (CWI) 15:05--15:20 How easy is collision search? New results and applications to DES, Jean-Jacques Quisquater and Jean-Paul Delescaille (PRLB) 15:20--15:50 Coffee Break ************ SESSION 10: Odds and ends 15:50--16:05 Design principles for hash functions, Ivan B. Damga rd (Aarhus Universitet) 16:05--16:30 One way hash functions and DES, Ralf C. Merkle (Xerox Parc) 16:30--16:45 Algebraic properties of the PGM cryptosystem, Spyros S. Magliveras and Nasir D. Memon (University of Nebraska--Lincoln) 16:45--17:00 On the construction of block ciphers provably secure and not relying on any unproved hypotheses, Yuliang Zheng, Tsutomu Matsumoto and Hideki Imai (Yokohama University) 17:00--17:15 Disposable zero-knowledge authentications and their applications to untraceable electronic cash, Tatsuaki Okamoto and Kazuo Ohta (NTT) 18:00--dusk Beach Barbecue -----------------------THURSDAY, August 24, 1989---------------------- 7:00--8:00 Breakfast ********** SESSION 11: Zero-knowledge and Oblivious transfer 8:30--8:45 Efficient identification schemes using two prover interactive proofs, Shafi Goldwasser, Joe Kilian (MIT), Michael Ben Or, and Avi Wigderson (Hebrew University) 8:45--9:00 On the concrete complexity of zero-knowledge proofs, Joan Boyar (University of Chicago) and Rene Peralta (University of Wisconsin--Milwaukee) 9:00--9:25 Zero knowledge proofs of knowledge in two rounds, Uriel Feige and Adi Shamir (Weizmann) 9:25--9:40 Efficient zero-knowledge proofs with bounded interaction, Joe Kilian, Silvio Micali (MIT) and Rafail Ostrovsky (Boston University) 9:40--10:05 Non-interactive oblivious transfer and its applications, Mihir Bellare and Silvio Micali (MIT) 10:05--10:30 Coffee Break ************ SESSION 12: Multiparty computation 10:30--10:45 Perfect gradual disclosure schemes for random bits and their applications, Richard Cleve (ICSI) 10:45--11:10 Multiparty protocols tolerating half faulty processors, Donald Beaver (Harvard) 11:10--11:35 The Spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptographically from majorities, David Chaum (CWI) 11:35--12:00 Multiparty computation with faulty majority, Donald Beaver (Harvard) and Shafi Goldwasser (MIT) 12:00--13:00 Lunch -----------------------ADJOURN----------------------------------------