Conference ProceedingsOPEN ACCESS

Fast accumulated hashing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1039 83-87
DOI: 10.1007/3-540-60865-6_45
68Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Nyberg, K. (1996). Fast accumulated hashing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1039, pp. 83–87). Springer Verlag. https://doi.org/10.1007/3-540-60865-6_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free