Accepted papers

  1. Specialized integer factorization
    Don Coppersmith

  2. Towards a better understanding of one-wayness: Facing linear permutations
    Alain P. Hiltgen

  3. On the propagation criterion of degree l and order k
    Claude Carlet

  4. A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
    Detleif Hühnlein, Michael J. Jacobson, Sachar Paulus, and Tsuyoshi Takagi

  5. Optimum traitor tracing and asymmetric schemes
    Kaoru Kurosawa and Yvo Desmedt

  6. Secure communication in minimal connectivity models
    Matthew Franklin and Rebecca N. Wright

  7. Differential-linear weak key classes of IDEA
    Philip Hawkes

  8. Security analysis of a practical "on the fly" authentication and signature generation
    Guillaume Poupard and Jacques Stern

  9. Computing discrete logarithms with quadratic number rings
    Damian Weber

  10. Cryptanalysis of the ANSI X9.52 CBCM mode
    Eli Biham and Lars R. Knudsen

  11. Secret sharing schemes with bipartite access structure
    Carles Padró and Germaán Sáez

  12. Securing threshold cryptosystems against chosen ciphertext attack
    Victor Shoup and Rosario Gennaro

  13. Optimistic fair exchange of digital signatures
    N. Asokan and Victor Shoup

  14. Equivalence of counting the number of points on elliptic curve over the ring Z_n and factoring n
    Noboru Kunihiro and Kenji Koyama

  15. Generic constructions for secure and efficient confirmer signature schemes
    Markus Michels and Markus Stadler

  16. Strengthened security for blind signatures
    David Pointcheval

  17. A practical and provably secure scheme for publicly veriafiable secret sharing and its applications
    Eiichiro Fujisaki and Tatsuaki Okamoto

  18. A new public-key cryptosystem as secure as factoring
    Tatsuaki Okamoto and Shigenori Uchiyama

  19. Security of an identity-based cryptosystem and the related reductions
    Shigenori Uchiyama and Tatsuaki Okamoto

  20. How to improve an exponentiation black-box
    Gérard Cohen, Antoine Lobstein, David Naccache, and Gilles Zémor

  21. Highly nonlinear balanced Boolean functions with a good correlation immunity
    Éric Filiol and Caroline Fontaine

  22. Easy come - easy go divisible cash
    Agnes Chan, Yair Frankel, and Yiannis Tsiounis

  23. A formal treatment of remotely keyed encryption
    Matt Blaze, Joan Feigenbaum, and Moni Naor

  24. Lower bounds on generic algorithms in groups
    Ueli Maurer and Stefan Wolf

  25. Divertible protocols and atomic proxy cryptography
    Matt Blaze, Gerrit Bleumer, and Martin Strauss

  26. New results on multi-receiver authentication codes
    Rei Safavi-Naini and Huaxiong Wang

  27. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
    Daniel R. Simon

  28. Improved algorithms for isomorphisms of polynomials
    Jacques Patarin, Louis Goubin and Nicolas Courtois

  29. Improved cryptanalysis of RC5
    Alex Biryukov and Eyal Kushilevitz

  30. Breaking RSA may not be equivalent to factoring
    Dan Boneh and Ramarathnam Venkatesan

  31. Auto-recoverable auto-certifiable cryptosystems
    Adam Young and Moti Yung

  32. Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
    Mihir Bellare, Ted Krovetz, and Phillip Rogaway

  33. A practical mix
    Markus Jakobsson

  34. Heuristic design of cryptographically strong balanced Boolean functions
    William Millan, Andrew Clark, and Ed Dawson

  35. On finding small solutions of modular multivariate polynomial equations
    Charanjit S. Jutla

  36. Combinatorial bounds for broadcast encryption
    Michael Luby and Jessica Staddon

  37. Universally verifiable mix-net with verification work
    independent of the number of mix-servers
    Masayuki Abe

  38. Fast batch verification for modular exponentiation and digital signatures
    Mihir Bellare, Juan A. Garay, and Tal Rabin

  39. Visual cryptanalysis
    Adi Shamir

  40. Secure and efficient metering
    Moni Naor and Benny Pinkas

  41. Speeding up discrete log and factoring based schemes via precomputations
    Victor Boyko, Marcus Peinado, and Ramarathnam Venkatesan

  42. On the foundations of oblivious transfer
    Christian Cachin

  43. The chain & sum primitive and its applications to MACs and stream ciphers
    Mariusz H. Jakubowski and Ramarathnam Venkatesan

  44. Quorum-based secure multi-party computation
    Donald Beaver and Avishai Wool

To the EUROCRYPT '98 main page.
To the IACR home page., Tuomas Aura