Advances in Cryptology – EUROCRYPT ’96

1. Front Matter

   Pages I-XII

   PDF

2. Cryptanalysis I

   1. Low-Exponent RSA with Related Messages

      • Don Coppersmith, Matthew Franklin, Jacques Patarin, Michael Reiter

      Pages 1-9

   2. Generating EIGamal Signatures Without Knowing the Secret Key

      • Daniel Bleichenbacher

      Pages 10-18

   3. On the Security of Two MAC Algorithms

      • Bart Preneel, Paul C. van Oorschot

      Pages 19-32

3. Public Key Cryptosystems

   1. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms

      • Jacques Patarin

      Pages 33-48

   2. A Public Key Cryptosystem Based on Elliptic Curves over ℤ/nℤ Equivalent to Factoring

      • Bernd Meyer, Volker Müller

      Pages 49-59

   3. Public Key Encryption and Signature Schemes Based on Polynomials over ℤn

      • Jörg Schwenk, Jörg Eisfeld

      Pages 60-71

4. New Schemes and Protocols

   1. Multi-Authority Secret-Ballot Elections with Linear Work

      • Ronald Cramer, Matthew Franklin, Berry Schoenmakers, Moti Yung

      Pages 72-83

   2. Asymmetric Fingerprinting

      • Birgit Pfitzmann, Matthias Schunter

      Pages 84-95

5. Multi-Party Computation

   1. Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing

      • Mike Burmester

      Pages 96-106

   2. Efficient Multiplicative Sharing Schemes

      • Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild

      Pages 107-118

   3. Equivocable Oblivious Transfer

      • Donald Beaver

      Pages 119-130

6. Proofs of Knowledge

   1. Short Discreet Proofs

      • Joan Boyar, René Peralta

      Pages 131-142

   2. Designated Verifier Proofs and Their Applications

      • Markus Jakobsson, Kazue Sako, Russell Impagliazzo

      Pages 143-154

7. Number Theory and Algorithms

   1. Finding a Small Root of a Univariate Modular Equation

      • Don Coppersmith

      Pages 155-165

   2. New Modular Multiplication Algorithms for Fast Modular Exponentiation

      • Seong-Min Hong, Sang-Yeop Oh, Hyunsoo Yoon

      Pages 166-177

   3. Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

      • Don Coppersmith

      Pages 178-189

8. Secret Sharing

   1. Publicly Verifiable Secret Sharing

      • Markus Stadler

      Pages 190-199

   2. Optimum Secret Sharing Scheme Secure against Cheating

      • Wakaha Ogata, Kaoru Kurosawa

      Pages 200-211

9. Cryptanalysis II

   1. The Security of the Gabidulin Public Key Cryptosystem

      • Keith Gibson

      Pages 212-223

The EUROCRYPT ’96 conference was sponsored by the International Asso- ation for Cryptologic Research (IACR)l, in cooperation with the University of Saragossa. It took place at the Palacio de Congresos in Saragossa, Spain, during May 12-16, 1996. This was the fifteenth annual EUROCRYPT conference (this name has been used since the third conference held in 1984), each of which has been held in a different city in Europe. For the second time, proceedings were available at the conference. JosC Pastor Franco, the General Chair, was resp- sible for local organization and registration. His contribution to the snccess of the conference is gratefully acknowledged. The Program Committee considered 126 submitted papers and selected 34 for presentation. Each paper was sent to all members of the Program Committee and was assigned to at least three of them for careful evaluation. There were also two invited talks. James L. Massey, this year’s IACR Distinguished Ltcturer, gave a lecture entitled “The difficulty with difficulty”. Massey is the third to receive this honor, the first two being Gustavus Simmons and Adi Shamir. Shafi Goldwasser gave an invited talk entitled “Multi party secure protocols: past and present”. These proceedings contain revised versions of the 34 contributed talks. While the papers were carefully selected, they have not been refereed like submissions to a refereed journal. The authors bear full responsibility for the contents of their papers. Some authors may write final versions of their papers for publication in a refereed journal.

• Cryptanalysis
• Cryptographic Functions
• Kommunikationsprotokoll
• Kryptoanalyse
• Public Key Cryptosystems
• Public-Key-Kryptosysteme
• Telecomm
• algorithms
• communication protocols
• cryptoanalysis
• cryptology
• cryptosystems
• digital signature
• secret sharing
• algorithm analysis and problem complexity

• Department of Computer Science, Swiss Federal Institute of Technology (ETH), Zürich, Switzerland

  Ueli Maurer

Policies and ethics