Algorithmica

, Volume 9, Issue 3, pp 239–252

Clocked adversaries for hashing

  • Richard J. Lipton
  • Jeffrey F. Naughton
Article

DOI: 10.1007/BF01190898

Cite this article as:
Lipton, R.J. & Naughton, J.F. Algorithmica (1993) 9: 239. doi:10.1007/BF01190898

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.

Key words

Hashing Adversary techniques PRAM model 

Copyright information

© Springer-Verlag New York Inc. 1993

Authors and Affiliations

  • Richard J. Lipton
    • 1
  • Jeffrey F. Naughton
    • 1
  1. 1.Computer Science DepartmentPrinceton UniversityPrincetonUSA
  2. 2.Department of Computer SciencesUniversity of WisconsinMadisonUSA

Personalised recommendations