Clocked adversaries for hashing

@article{Lipton2005ClockedAF,
  title={Clocked adversaries for hashing},
  author={Richard J. Lipton and Jeffrey F. Naughton},
  journal={Algorithmica},
  year={2005},
  volume={9},
  pages={239-252}
}
A “clocked adversary” is a program that can time its operations and base its behavior on the results of those timings. While it is well known that hashing performs poorly in the worst case, recent results have proven that, for reference-string programs, the probability of falling into a bad case can be driven arbitrarily low. We show that this is not true for clocked adversaries. This emphasizes the limits on the appiicability of theorems on the behavior of hashing schemes on reference string… 
Bloom Filters in Adversarial Environments
TLDR
This work considers a data structure known as “Bloom filter” and proves a tight connection between Bloom filters in this model and cryptography and considers data structures in a more robust model, which is called the adversarial model.
Bloom Filters in Adversarial Environments
TLDR
This work considers a data structure known as a “Bloom filter” and proves a tight connection between Bloom filters in this model and cryptography and shows that non-trivial (memory-wise) Bloom filters exist if and only if one-way functions exist.
HyperLogLog: Exponentially Bad in Adversarial Settings
TLDR
It is shown that in a setting where the inputs may be adversarially generated, the HLL algorithm’s estimate of cardinality can be exponentially bad: when an adversary has access to the internals of the H LL algorithm and has some flexibility in choosing what inputs will be recorded, it can manipulate the cardinality estimate to be exponentially smaller than the true cardinality.
Probabilistic Data Structures in Adversarial Environments
TLDR
This work provides a provable security treatment of probabilistic data structures in adversarial environments with a syntax that captures a wide variety of in-use structures, and security notions support development of error bounds in the presence of powerful attacks.
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
TLDR
This paper construction is a two-level variant of cuckoo hashing, augmented with a ``backyard'' that handles a large fraction of the elements, together with a de-amortized perfect hashing scheme for eliminating the dependency on $\boldsymbol{n}$ memory words, and guarantees constant-time operations in the worst case with high probability.
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
TLDR
The theoretical analysis and experimental results indicate that the scheme is highly efficient, and provides a practical alternative to the only other known approach for constructing dynamic dictionaries with such worst case guarantees, due to Dietzfelbinger and Meyer auf der Heide.
Dynamic Hashing in Real Time1
TLDR
A dynamic hashing scheme that performs in real time is presented, which uses linear space and needs worst case constant time per instruction, and is based on a new high performance universal class of hash functions.
Pollution Attacks on Counting Bloom Filters for Black Box Adversaries
TLDR
These methods show that a counting Bloom filter is vulnerable to pollution attacks even when the attacker has only access to the filter as a black box to perform insertions, removals, and lookups.
More Practical and Secure History-Independent Hash Tables
TLDR
This work presents and analyzes an efficient hash table data structure that simultaneously achieves the following properties: it is based on the classic linear probing collision-handling scheme, it is weakly history-independent, and it is secure against collision-timing attacks.
An attack-resistant hashing scheme
TLDR
Experimental results show that the secure hashing algorithms proposed are efficient and robust against hash collision attacks, and the proposed generalized attack-resistant hashing algorithm is immune to these attacks.
...
...

References

SHOWING 1-7 OF 7 REFERENCES
Dynamic perfect hashing: upper and lower bounds
TLDR
An Omega (log n) lower bound is proved for the amortized worst-case time complexity of any deterministic algorithm in a class of algorithms encompassing realistic hashing-based schemes.
Universal Classes of Hash Functions
Parallel hashing: an efficient implementation of shared memory
TLDR
A probabilistic scheme for implementing shared memory on a bounded-degree network of processors that enables n processors to store and retrieve an arbitrary set of n data items in O(logn) parallel steps is presented.
How to emulate shared memory (Preliminary Version)
TLDR
This work presents a simple algorithm for emulating an N processor CRCW PRAM on an N node butterfly that improves the result of Pippenger by routing permutations with bounded queues in logarithmic time, without the possibility of deadlock.
How to Share Memory in a Distributed System (A Preliminary Version)
TLDR
A novel distributed data structure is described that eliminates the need for shared mernory without significantly increasing the run time of the parallel computation and is established that this upper bound is nearly optimal.
Multicomputers: message-passing concurrent computers
A status report is provided on the architecture and programming of a family of concurrent computers that are organized as ensembles of small programmable computers called nodes, connected by a
“Hot spot” contention and combining in multistage interconnection networks
TLDR
The technique of message combining was found to be an effective means of eliminating this problem if it arises due to lock or synchronization contention, severely degrading all memory access, not just access to shared lock locations, due to an effect the authors call tree saturation.