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.
Key wordsHashing Adversary techniques PRAM model
Unable to display preview. Download preview PDF.
- [AS]W. C. Athas and C. L. Seitz. Multicomputer: Message-passing concurrent computers.IEEE Computer, August 1988, pp. 9–24.Google Scholar
- [CW]J. L. Carter and M. N. Wegman. Universal classes of hash functions.Journal of Computer and System Sciences,18:143–154, 1979.Google Scholar
- [DKM+]M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. InProceedings of the 29th IEEE Conference on the Foundations of Computer Science, pp. 524–531, 1988.Google Scholar
- [KU]A. Karlin and E. Upfal. Parallel hashing—an efficient implementation of shared memory. InProceedings of the 27th Annual Symposium on Computer Science, 1986.Google Scholar
- [PN]G. F. Pfister and V. A. Norton. Hot-spot contention and combining in multistage interconnection networks. InProceedings of the International Conference on Parallel Processing, pp. 790–797, 1985.Google Scholar
- [R]A. G. Ranade, How to emulate shared memory. InProceedings of the 28th Annual Symposium on Computer Science, pp. 185–194, 1987.Google Scholar
- [UW]E. Upfal and A. Wigderson. How to share memory in a distributed system. InProceedings of the Sixteenth ACM Symposium on the Theory of Computing, pp. 171–180, 1984.Google Scholar