Skip to main content
SpringerLink
Log in

Clocked adversaries for hashing

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. C. Athas and C. L. Seitz. Multicomputer: Message-passing concurrent computers.IEEE Computer, August 1988, pp. 9–24.

  2. J. L. Carter and M. N. Wegman. Universal classes of hash functions.Journal of Computer and System Sciences,18:143–154, 1979.

    Google Scholar 

  3. 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.

  4. A. Karlin and E. Upfal. Parallel hashing—an efficient implementation of shared memory. InProceedings of the 27th Annual Symposium on Computer Science, 1986.

  5. 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.

  6. A. G. Ranade, How to emulate shared memory. InProceedings of the 28th Annual Symposium on Computer Science, pp. 185–194, 1987.

  7. 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.

Download references

Author information

Author notes

  1. Jeffrey F. Naughton

    Present address: Department of Computer Sciences, University of Wisconsin, Madison, WI, USA

Authors and Affiliations

  1. Computer Science Department, Princeton University, 35 Olden Street, 08544-2087, Princeton, NJ, USA

    Richard J. Lipton & Jeffrey F. Naughton

Authors
  1. Richard J. Lipton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey F. Naughton
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Bernard Chazelle.

Work was supported by DARPA and ONR Contracts N00014-85-C-0456 and N00014-85-K-0465, and by NSF Cooperative Agreement DCR-8420948.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lipton, R.J., Naughton, J.F. Clocked adversaries for hashing. Algorithmica 9, 239–252 (1993). https://doi.org/10.1007/BF01190898

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01190898

Key words

Search

Navigation