Bloom Filters in Adversarial Environments (Q3457085): Difference between revisions

From MaRDI portal
Merged Item from Q4972681
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Explicit and efficient hash families suffice for cuckoo hashing with a stash / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Preserving Reductions via Cuckoo Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clocked adversaries for hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for approximate membership checking with application to password security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sketching in Adversarial Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Bloom Filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Hashing in Constant Time and Optimal Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuckoo hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank

Revision as of 04:18, 11 July 2024

scientific article; zbMATH DE number 7136427
Language Label Description Also known as
English
Bloom Filters in Adversarial Environments
scientific article; zbMATH DE number 7136427

    Statements

    Bloom Filters in Adversarial Environments (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2015
    0 references
    25 November 2019
    0 references
    Bloom filter
    0 references
    adaptive inputs
    0 references
    pseudorandom functions
    0 references
    streaming algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references