Fast accumulated hashing

  • Kaisa Nyberg
Hash Functions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1039)

Abstract

A new non-trapdoor accumulator for cumulative hashing is introduced. It can be efficiently realized in practise using existing cryptographic hash algorithms and pseudorandom sequence generators. The memory requirement is less than in comparable signature-based solutions.

References

  1. 1.
    J. Benaloh and M. de Mare, One-way accumulators: a decentralized alternative to digital signatures. In: Advances in Cryptology — Eurocrypt'93 (ed. by T. Helleseth), Lecture Notes in Computer Science 765, Springer-Verlag, Heidelberg 1994, 274–285.Google Scholar
  2. 2.
    K. Nyberg, Commutativity in cryptography. In: Proceedings of the First International Workshop on Functional Analysis at Trier University, Walter de Gruyter & Co, Berlin (to appear).Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Kaisa Nyberg
    • 1
  1. 1.Communications and Information Systems DivisionFinnish Defence ForcesFinland

Personalised recommendations