Book Volume 1070 1996

Advances in Cryptology — EUROCRYPT ’96

International Conference on the Theory and Application of Cryptographic Techniques Saragossa, Spain, May 12–16, 1996 Proceedings


ISBN: 978-3-540-61186-8 (Print) 978-3-540-68339-1 (Online)

Table of contents (34 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XII

  2. Cryptanalysis I

    1. Chapter

      Pages 1-9

      Low-Exponent RSA with Related Messages

    2. Chapter

      Pages 10-18

      Generating EIGamal Signatures Without Knowing the Secret Key

    3. Chapter

      Pages 19-32

      On the Security of Two MAC Algorithms

  3. Public Key Cryptosystems

    1. Chapter

      Pages 33-48

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

    2. Chapter

      Pages 49-59

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

    3. Chapter

      Pages 60-71

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

  4. New Schemes and Protocols

    1. Chapter

      Pages 72-83

      Multi-Authority Secret-Ballot Elections with Linear Work

    2. Chapter

      Pages 84-95

      Asymmetric Fingerprinting

  5. Multi-Party Computation

    1. Chapter

      Pages 96-106

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

    2. Chapter

      Pages 107-118

      Efficient Multiplicative Sharing Schemes

    3. Chapter

      Pages 119-130

      Equivocable Oblivious Transfer

  6. Proofs of Knowledge

    1. Chapter

      Pages 131-142

      Short Discreet Proofs

    2. Chapter

      Pages 143-154

      Designated Verifier Proofs and Their Applications

  7. Number Theory and Algorithms

    1. Chapter

      Pages 155-165

      Finding a Small Root of a Univariate Modular Equation

    2. Chapter

      Pages 166-177

      New Modular Multiplication Algorithms for Fast Modular Exponentiation

    3. Chapter

      Pages 178-189

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

  8. Secret Sharing

    1. Chapter

      Pages 190-199

      Publicly Verifiable Secret Sharing

    2. Chapter

      Pages 200-211

      Optimum Secret Sharing Scheme Secure against Cheating

  9. Cryptanalysis II

    1. Chapter

      Pages 212-223

      The Security of the Gabidulin Public Key Cryptosystem

    2. Chapter

      Pages 224-236

      Non-Linear Approximations in Linear Cryptanalysis

previous Page of 2