Re:There are no good constant-time data structures
by tptacek on Tuesday December 02, 2014 @10:12PM
(#8691697)
This doesn't look like a straightforward attack, but it seems plausible and worth exploring. I think the word "password" just turned my brain off --- in part because I see so many people obsess about constant-time comparison for password hashes.
That said, 'tedunangst's suggestion to hash before comparison seems sound; double-hashing is an old hack people use to do timing-safe comparisons of normal hashes, too.
So I'm still not sure you need timing-safe containers or timing-safe indices, although it's interesting to think about how you'd design them.
That said, 'tedunangst's suggestion to hash before comparison seems sound; double-hashing is an old hack people use to do timing-safe comparisons of normal hashes, too.
So I'm still not sure you need timing-safe containers or timing-safe indices, although it's interesting to think about how you'd design them.