High accuracy bloom filter using partitioned hashing

Details High accuracy bloom filter using partitioned hashing High accuracy bloom filter using partitioned hashing

2011-04-19

2011-04-19

Hoffman, Brandon S (Department: 2433)

Electrical computers and digital processing systems: support

Multiple computer communication using cryptography

Particular communication authentication technique

Reexamination Certificate

active

07930547

ABSTRACT:
A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.

REFERENCES:
patent: 7548928 (2009-06-01), Dean et al.
B.H. Bloom, “Space/time tradeoffs in hash coding with allowable errors,” Communications of the ACM 13:7 (1970), 422-426.
A. Broder and M. Mitzenmacher, “Network applications for Bloom filters: a survey,” Internet Mathematics, vol. 1, No. 4, pp. 485-509, 2005.
B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, “The Bloomier filter: an efficient data structure for static support lookup tables,” SODA 2004.
U. Manber and S. Wu, “An algorithm for approximate membership checking with application to password security,” Information Processing Letters 50 (1994), 191-197.
S. Bakhtiari, R. Safavi-Naini, J. Pieprzyk, “Cryptographic Hash functions,” Centre for Computer Security Research, Department of Computer Science, University of Wollongong, Wollogong, NSW 2522, Australia, 1-26.

Affiliated with

Also associated with

Rating

High accuracy bloom filter using partitioned hashing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with High accuracy bloom filter using partitioned hashing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High accuracy bloom filter using partitioned hashing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2621893