Disclosing the element distribution of bloom filter

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An algorithm named Reconstruction based on Semantically Enhanced Counting Bloom Filter (RSECBF) was proposed to disclose the distribution of original element from semantically enhanced Counting Bloom Filter's hash space. The algorithm deploys DBSM, which directly selects some bits from original string as the reversible hash function. The overlapping of hash bit strings in this paper brings the ability to confirm the homogenetic hash strings. The efficiency of RSECBF in the principal component analysis was verified by the DDoS detection in a published trace. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Peng, Y., Gong, J., Yang, W., & Liu, W. (2006). Disclosing the element distribution of bloom filter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3991 LNCS-I, pp. 1022–1025). Springer Verlag. https://doi.org/10.1007/11758501_163

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