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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyberg, K. (1996). Fast accumulated hashing. In: Gollmann, D. (eds) Fast Software Encryption. FSE 1996. Lecture Notes in Computer Science, vol 1039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60865-6_45
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60865-3
Online ISBN: 978-3-540-49652-6
eBook Packages: Springer Book Archive