5.18 Attack Resistance
5.18 Attack Resistance Problem Hash tables usually provide expected constant time operations. That expectation depends on the assumption that keys are well distributed across buckets. When inputs are controlled by an adversary, this assumption may fail. You need a hash table strategy that remains safe when attackers can choose keys deliberately. Solution Use a keyed hash function or a collision-resistant table strategy for untrusted inputs. A keyed hash includes a...