EUROCRYPT 1996

Saragossa, Spain

Ueli M. Maurer (Ed.): Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding. Lecture Notes in Computer Science, Vol. 1070, Springer, 1996, ISBN 3-540-61186-X

Errata of the Eurocrypt '96 Proceedings

Cryptoanalysis I

• Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter: Low-Exponent RSA with Related Messages. Also here. 1-9
• Daniel Bleichenbacher: Generating EIGamal Signatures Without Knowing the Secret Key. 10-18
• Bart Preneel, Paul C. van Oorschot: On the Security of Two MAC Algorithms. 19-32

Public Key Cryptosystems

• Jacques Patarin: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. 33-48
• Bernd Meyer, Volker Müller: A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring. 49-59
• Jörg Schwenk, Jörg Eisfeld: Public Key Encryption and Signature Schemes Based on Polynomials over Zn. 60-71

New Schemes and Protocols

• Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung: Multi-Autority Secret-Ballot Elections with Linear Work. Also here. 72-83
• Birgit Pfitzmann, Matthias Schunter: Asymmetric Fingerprinting. Or just the abstract. (Extended Abstract). 84-95

Multi-Party Computation

• Mike Burmester: Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing. 96-106
• Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild: Efficient Multiplicative Sharing Schemes. 107-118
• Donald Beaver: Equivocable Oblivious Transfer. Look for related papers here. 119-130

Proofs of Knowledge

• Joan Boyar, René Peralta: Short Discrete Proofs. 131-142
• Markus Jakobsson, Kazue Sako, Russell Impagliazzo: Designated Verifier Proofs and Their Applications. 143-154

Number Theory and Algorithms

• Don Coppersmith: Finding a Small Root of a Univariate Modular Equation. 155-165
• Seong-Min Hong, Sang-Yeop Oh, Hyunsoo Yoon: New Modular Multiplication Algorithms for Fast Modular Exponentiation. 166-177
• Don Coppersmith: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. 178-189

Secret Sharing

• Markus Stadler: Publicly Verifiable Secret Sharing. 190-199
• Wakaha Ogata, Kaoru Kurosawa: Optimum Secret Sharing Scheme Secure against Cheating. 200-211

Cryptoanalysis II

• Keith Gibson: The Security of the Gabidulin Public Key Cryptosystem. 212-223
• Lars R. Knudsen, M. J. B. Robshaw: Non-Linear Approximations in Linear Cryptoanalysis. 224-236
• Lars R. Knudsen, Torben P. Pedersen: On the Difficulty of Software Key Escrow. Also here. 237-244

Pseudorandomness

• Jean-Bernard Fischer, Jacques Stern: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding. 245-255
• Andrew Klapper: On the Existence of Secure Feedback Registers (Extended Abstract). 256-267

Cryptographic Functions

• Jovan Dj. Golic: Fast Low Order Approximation of Cryptographic Functions. 268-282
• Paul Camion, Anne Canteaut: Construction of t-Resilient Functions over a Finite Alphabet. 283-293
• Xian-Mo Zhang, Yuliang Zheng: Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions. Also here. 294-306
• William Aiollo, Ramarathnam Venkatesan: Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. 307-320

Key Management and Identification Schemes

• Victor Shoup, Avi Rubin: Session Key Distribution Using Smart Cards. Also here. 321-331
• Paul C. van Oorschot, Michael J. Wiener: On Diffie-Hellman Key Agreement with Short Exponents. 332-343
• Victor Shoup: On the Security of a Practical Identification Scheme. 344-353

Digital Signature Schemes

• Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Robust Threshold DSS Signatures. 354-371
• Ivan Damgård, Torben P. Pedersen: New Convertible Undeniable Signature Schemes. 372-386
• David Pointcheval, Jacques Stern: Security Proofs for Signature Schemes. 387-398
• Mihir Bellare, Phillip Rogaway: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. Also here. Or just the abstract. 399-416

Rump Session

• Marc Joye and Jean-Jacques Quisquater: Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams.