Name
Abstract | ||
|---|---|---|
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 programs, and raises a novel set of problems dealing with optimality of and vulnerability to clocked adversaries. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/BF01190898 | Algorithmica |
Keywords | Field | DocType |
Hashing,Adversary techniques,PRAM model | Computer science,Theoretical computer science,Hash function,K-independent hashing,Adversary,2-choice hashing,Dynamic perfect hashing | Journal |
Volume | Issue | ISSN |
9 | 3 | 0178-4617 |
Citations | PageRank | References |
9 | 1.50 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard J. Lipton | 1 | 6412 | 1796.57 |
| Jeffrey F. Naughton | 2 | 8363 | 1913.71 |