EUROCRYPT'98 - PRELIMINARY PROGRAM (Please check all times from the the final program for possible changes.) SUNDAY, May 31 18:00 - 20:00 Registration Welcome Reception MONDAY, June 1 9:00 Opening Remarks 9:15 Session: Distributed Cryptography and Applications I Securing threshold cryptosystems against chosen ciphertext attack Victor Shoup and Rosario Gennaro Auto-recoverable auto-certifiable cryptosystems Adam Young and Moti Yung A practical and provably secure scheme for publicly verifiable secret sharing and its applications Eiichiro Fujisaki and Tatsuaki Okamoto 10:45 Coffee Break 11:15 Session: Complexity Theory - Reductions and Lower Bounds Equivalence of counting the number of points on elliptic curve over the ring Z_n and factoring n Noboru Kunihiro and Kenji Koyama Breaking RSA may not be equivalent to factoring Dan Boneh and Ramarathnam Venkatesan Lower bounds on generic algorithms in groups Ueli Maurer and Stefan Wolf 12:30 Lunch 14:00 Session: Cryptanalysis of Block Ciphers Improved cryptanalysis of RC5 Alex Biryukov and Eyal Kushilevitz Cryptanalysis of the ANSI X9.52 CBCM mode Eli Biham and Lars R. Knudsen Differential-linear weak key classes of IDEA Philip Hawkes 15:00 Session: Distributed Cryptography and Applications II Divertible protocols and atomic proxy cryptography Matt Blaze, Gerrit Bleumer, and Martin Strauss Optimum traitor tracing and asymmetric schemes Kaoru Kurosawa and Yvo Desmedt 15:50 Coffee Break 16:20 Session: Computational Algorithms On finding small solutions of modular multivariate polynomial equations Charanjit S. Jutla Computing discrete logarithms with quadratic number rings Damian Weber Improved algorithms for isomorphisms of polynomials Jacques Patarin, Louis Goubin and Nicolas Courtois TUESDAY, June 2 9:00 Session: Improving Computational Efficiency Visual cryptanalysis Adi Shamir How to improve an exponentiation black-box Gérard Cohen, Antoine Lobstein, David Naccache, and Gilles Zémor Speeding up discrete log and factoring based schemes via precomputations Victor Boyko, Marcus Peinado, and Ramarathnam Venkatesan Fast batch verification for modular exponentiation and digital signatures Mihir Bellare, Juan A. Garay, and Tal Rabin 10:30 Coffee Break 11:00 Session: Paradigms for Symmetric Systems A formal treatment of remotely keyed encryption Matt Blaze, Joan Feigenbaum, and Moni Naor Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible Mihir Bellare, Ted Krovetz, and Phillip Rogaway The chain & sum primitive and its applications to MACs and stream ciphers Mariusz H. Jakubowski and Ramarathnam Venkatesan 12:30 Lunch 13:45 Excursion 18:00 Opening of Poster Session 19:00 Rump Buffet 19:30 Rump Session WEDNESDAY, June 3 9:00 Session: Public Key Cryptosystems A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption Detlef Hühnlein, Michael J. Jacobson, Sachar Paulus, and Tsuyoshi Takagi A new public-key cryptosystem as secure as factoring Tatsuaki Okamoto and Shigenori Uchiyama 9:40 Session: Complexity Theory - One-way Functions Towards a better understanding of one-wayness: Facing linear permutations Alain P. Hiltgen Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? Daniel R. Simon 10:40 Coffee Break 11:15 Session: Multi-party Computation Secure communication in minimal connectivity models Matthew Franklin and Rebecca N. Wright On the foundations of oblivious transfer Christian Cachin Quorum-based secure multi-party computation Donald Beaver and Avishai Wool 12:30 Lunch 14:00 Session: Digital Signatures Strengthened security for blind signatures David Pointcheval Generic constructions for secure and efficient confirmer signature schemes Markus Michels and Markus Stadler Security analysis of a practical "on the fly" authentication and signature generation Guillaume Poupard and Jacques Stern 15:15 IACR Business Meeting 15:35 Coffee Break 16:00 Session: Untraceability in Multi-party Schemes Universally verifiable mix-net with verification work independent of the number of mix-servers Masayuki Abe A practical mix Markus Jakobsson 16:40 Session: Boolean Functions On the propagation criterion of degree l and order k Claude Carlet Highly nonlinear balanced Boolean functions with a good correlation-immunity Eric Filiol and Caroline Fontaine Heuristic design of cryptographically strong balanced Boolean functions William Millan, Andrew Clark, and Ed Dawson 19:30 Banquet THURSDAY, June 4 9:00 Session: Combinatorial Design and Analysis of Distributed Schemes Secret sharing schemes with bipartite access structure Carles Padró and Germán Sáez Combinatorial bounds for broadcast encryption Michael Luby and Jessica Staddon New results on multi-receiver authentication codes Rei Safavi-Naini and Huaxiong Wang 10:00 Session: Cryptanalysis of Elliptic Curve Systems Specialized integer factorization Don Coppersmith Security of an identity-based cryptosystem and the related reductions Tatsuaki Okamoto and Shigenori Uchiyama 10:45 Coffee Break 11:10 Session: Electronic Commerce and Payment Easy come - easy go divisible cash Agnes Chan, Yair Frankel, and Yiannis Tsiounis Secure and efficient metering Moni Naor and Benny Pinkas Optimistic fair exchange of digital signatures N. Asokan, Victor Shoup, and Michael Waidner 12:30 Adjourn END