Timeline for Permuted Hash Table
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2016 at 10:00 | comment | added | user153465 | @poncho Alternatively, we can map the original index, $i$, to a random value $i'$ (using a pseudorandom function), then we give away the encrypted $b$ and $i'$ to an adversary. And ask him to insert encrypted $b$ into $i'$-th bin in the hash table. | |
| Feb 9, 2016 at 9:39 | comment | added | user153465 | @poncho mapping from $H(a)$ to $i'$ is deterministic but we can use a pseudorandom permutation (that uses a random key) for the mapping, and the server obviously does not know the key. | |
| Feb 8, 2016 at 21:31 | comment | added | poncho | Is the transform from $H(a)$ to the index $i'$ deterministic? If so, then someone who sees two values $a, b$ hashing to the same entry in the table can immediately deduce that $H(a) = H(b)$. This implies that if they know what $a$ is, they reduce the number of possible values of $b$ significantly. | |
| Feb 8, 2016 at 20:05 | history | edited | user153465 | CC BY-SA 3.0 |
edited tags
|
| Feb 8, 2016 at 19:44 | history | asked | user153465 | CC BY-SA 3.0 |