Book Volume 950 1995

Advances in Cryptology — EUROCRYPT'94

Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9–12, 1994 Proceedings


ISBN: 978-3-540-60176-0 (Print) 978-3-540-44717-7 (Online)

Table of contents (47 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-12

    Visual cryptography

  3. Chapter

    Pages 13-22

    The size of a share must be large

  4. Chapter

    Pages 23-34

    A linear construction of perfect secret sharing schemes

  5. Chapter

    Pages 35-46

    On the dealer's randomness required in secret sharing schemes

  6. Chapter

    Pages 47-57

    Black box cryptanalysis of hash networks based on multipermutations

  7. Chapter

    Pages 58-66

    A practical attack against knapsack based hash functions

  8. Chapter

    Pages 67-76

    The blinding of weak signatures

  9. Chapter

    Pages 77-85

    Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —

  10. Chapter

    Pages 86-91

    Designated confirmer signatures

  11. Chapter

    Pages 92-111

    Optimal asymmetric encryption

  12. Chapter

    Pages 112-130

    A multiple-iterated trapdoor for dense compact knapsacks

  13. Chapter

    Pages 131-139

    On the security of some cryptosystems based on error-correcting codes

  14. Chapter

    Pages 140-155

    Parallel divertibility of proofs of knowledge

  15. Chapter

    Pages 156-170

    Methodology for digital money based on general cryptographic tools

  16. Chapter

    Pages 171-181

    New group signature schemes

  17. Chapter

    Pages 182-193

    Message recovery for signature schemes based on the discrete logarithm problem

  18. Chapter

    Pages 194-204

    Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders

  19. Chapter

    Pages 205-214

    The self-shrinking generator

  20. Chapter

    Pages 215-222

    Feedback registers based on ramified extensions of the 2-adic numbers

  21. Chapter

    Pages 223-229

    A general lower bound for the linear complexity of the product of shift-register sequences

previous Page of 3