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

From MaRDI portal
Merged Item from Q4972681
Created claim: Wikidata QID (P12): Q127732535, #quickstatements; #temporary_batch_1722490750963
 
(2 intermediate revisions by one other user not shown)
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
Property / cites work
 
Property / cites work: BLAKE2: Simpler, Smaller, Fast as MD5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Applications of Bloom Filters: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate membership testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost random graphs with simple hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intel’s New AES Instructions for Enhanced Performance and Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: How robust are linear sketches to adaptive inputs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes-Recurse Shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of pseudorandom permutations: Luby-Rackoff revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for sliding Bloom filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-, hash-, and space-efficient bloom filters / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127732535 / rank
 
Normal rank

Latest revision as of 07:43, 1 August 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
    0 references
    0 references
    10 December 2015
    0 references
    25 November 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Bloom filter
    0 references
    adaptive inputs
    0 references
    pseudorandom functions
    0 references
    streaming algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references