Secure generalized bloom filter
View Patent ↗Various embodiments are described that relate to a generalized Bloom filter design methodology. The Bloom filter design methodology can be used for preventing Bloom filter-specific cyber-attacks instead of designing special-purpose Bloom filters that can be applied preventing a specific kind of attack for a given kind of communications networking environment. The resultant security functionalities that can be considered as a package for the generalized secure Bloom filter can include Identifier Modifications, Secure Indexes, Dynamic Salting, Independent Multiple Hash Functions, Random Bit Insertions, Fake Bit Injections, Secure Record Linkage, Single Bloom Filter with all Identifiers, and Encryption. The overall secure generalized Bloom filter algorithms can be devised along with numerous sub-algorithms for these functionalities for making the Bloom-filter-based communications over a network providing robust security, reliability, and availability, preventing known cyber-attacks.
1. A non-transitory computer-readable medium configured to store computer-executable instructions that when executed by a processor cause the processor to perform a method, the method comprising:
identifying a request to create a secure Bloom filter; and
creating the secure Bloom filter through implementation of a security method, the security method comprising:
compressing an identifier of a Bloom filter;
creating secure indexing of the Bloom filter based on the compressed identifier;
creating random salt dynamically for the Bloom filter;
creating multiple independent hash functions for the Bloom filter;
inserting a random bit into the Bloom filter;
inserting a fake bit into the Bloom filter;
creating a linkage for the Bloom filter;
integrating the Bloom filter with multiple identifiers using a long-term clock; and
encrypting the Bloom filter using the random salt and at least one of the multiple independent hash functions.
2. The non-transitory computer-readable medium of claim 1 ,
where the multiple independent hash functions comprise a simple tabulation hashing.
3. The non-transitory computer-readable medium of claim 1 ,
where the multiple independent hash functions comprise a twisted tabulation hashing.
4. The non-transitory computer-readable medium of claim 1 ,
where the multiple independent hash functions comprise a double tabulation hashing.
5. The non-transitory computer-readable medium of claim 1 ,
where the fake bit is a fake noise bit.
6. The non-transitory computer-readable medium of claim 1 ,
where the fake bit is a fake phonetic code bit.
7. The non-transitory computer-readable medium of claim 1 , the method comprising:
causing an output of the secure Bloom filter.
8. A method that creates a secure Bloom filter, the method comprising:
compressing an identifier of a Bloom filter;
creating secure indexing of the Bloom filter based on the compressed identifier;
creating random salt dynamically for the Bloom filter;
creating multiple independent hash functions for the Bloom filter;
inserting a random bit into the Bloom filter;
inserting a fake bit into the Bloom filter;
creating a linkage for the Bloom filter;
integrating the Bloom filter with multiple identifiers using a long-term clock; and
encrypting the Bloom filter using the random salt and at least one of the multiple independent hash functions.
9. The method of claim 8 ,
where the multiple independent hash functions comprise a simple tabulation hashing.
10. The method of claim 8 ,
where the multiple independent hash functions comprise a twisted tabulation hashing.
11. The method of claim 8 ,
where the multiple independent hash functions comprise a double tabulation hashing.
12. The method of claim 8 ,
where the fake bit is a fake noise bit.
13. The method of claim 8 ,
where the fake bit is a fake phonetic code bit.
14. A system comprising a hardware processor configured to execute an instruction set comprising:
compressing an identifier of a Bloom filter;
creating secure indexing of the Bloom filter based on the compressed identifier;
creating random salt dynamically for the Bloom filter;
creating multiple independent hash functions for the Bloom filter;
inserting a random bit into the Bloom filter;
inserting a fake bit into the Bloom filter;
creating a linkage for the Bloom filter;
integrating the Bloom filter with multiple identifiers using a long-term clock; and
encrypting the Bloom filter using the random salt and at least one of the multiple independent hash functions.
15. The system of claim 14 ,
where the multiple independent hash functions comprise a simple tabulation hashing.
16. The system of claim 14 ,
where the multiple independent hash functions comprise a twisted tabulation hashing.
17. The system of claim 14 ,
where the multiple independent hash functions comprise a double tabulation hashing.
18. The system of claim 14 ,
where the fake bit is a fake noise bit.
19. The system of claim 14 ,
where the fake bit is a fake phonetic code bit.
20. The system of claim 14 ,
where the encrypted Bloom filter is outputted as a secure Bloom filter.