3 ms·
homomorphic encryption theoretically allows a block list to be query-able without being inspect-able, true i'm unaware of any practical implementation that wou
by preseinger 3y ago
homomorphic encryption theoretically allows a block list to be query-able without being inspect-able, true
i'm unaware of any practical implementation that would address the given use case
if you know otherwise, please point me to it!
- anamexis 3y agoIt’s not homomorphic encryption, but publishing a list of salted hashes seems like it would fit those criteria.
- ryan-c 3y agoThat would provide very limited benefit due to the search space being so small, and would have serious scaling issues with large block lists.
- anamexis 3y agoIf you used a per-user list-wide salt, there wouldn't be any scaling issues. And the requirements themselves dictate that there's a small search space.
- ryan-c 3y agoIf you used a per-user-list salt, then it would be about as useful as obfuscating phone numbers by hashing them. The list must then be enumerable in N*x time, where x is the time to hash one user, and N is the cardinality of the search space. One second per legitimate hash check? You can enumerate the list in a few hours by doing a parallel search...
- pclmulqdq 3y agoA list of salted hashes can be "decrypted" by trying every username with each salt. It probably doesn't take much computing power to do that.
- anamexis 3y agoIsn't that true of any implementation? You could always query every username.