Those are really questions and issues of implementation than of theory. 1. Tabulation hashing provides guarantees against chosen key attacks. 2. In addition,

Those are really questions and issues of implementation than of theory. 1. Tabulation hashing provides guarantees against chosen key attacks. 2. In addition, bucketized cuckoo hashing provides guarantees on the probability of resize (low compared to linear probing), and multiple resizes (very low compared to linear probing). 3. Further, most hash table implementations that I know of have layers of defense, including limiting the number of sequential resizes for a given key. Putting everything together, if anything, I would be more concerned with the failure mode for linear probing (scanning the whole table before resizing) than for Cuckoo hashing (scanning two fixed-size buckets before resizing).