Cryptanalysis I -- Low-Exponent RSA with Related Messages -- Generating EIGamal Signatures Without Knowing the Secret Key -- On the Security of Two MAC Algorithms -- Public Key Cryptosystems -- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms -- A Public Key Cryptosystem Based on Elliptic Curves over ?/n? Equivalent to Factoring -- Public Key Encryption and Signature Schemes Based on Polynomials over ?n -- New Schemes and Protocols -- Multi-Authority Secret-Ballot Elections with Linear Work -- Asymmetric Fingerprinting -- Multi-Party Computation -- Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing -- Efficient Multiplicative Sharing Schemes -- Equivocable Oblivious Transfer -- Proofs of Knowledge -- Short Discreet Proofs -- Designated Verifier Proofs and Their Applications -- Number Theory and Algorithms -- Finding a Small Root of a Univariate Modular Equation -- New Modular Multiplication Algorithms for Fast Modular Exponentiation -- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known -- Secret Sharing -- Publicly Verifiable Secret Sharing -- Optimum Secret Sharing Scheme Secure against Cheating -- Cryptanalysis II -- The Security of the Gabidulin Public Key Cryptosystem -- Non-Linear Approximations in Linear Cryptanalysis -- On the Difficulty of Software Key Escrow -- Pseudorandomness -- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding -- On the Existence of Secure Feedback Registers -- Cryptographic Functions -- Fast Low Order Approximation of Cryptographic Functions -- Construction of t-Resilient Functions over a Finite Alphabet -- Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions -- Foiling Birthday Attacks in Length-Doubling Transformations -- Key Management and Identification Schemes -- Session Key Distribution Using Smart Cards -- On Diffie-Hellman Key Agreement with Short Exponents -- On the Security of a Practical Identification Scheme -- Digital Signature Schemes -- Robust Threshold DSS Signatures -- New Convertible Undeniable Signature Schemes -- Security Proofs for Signature Schemes -- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin.

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.