Re:TFHE: Fast Fully-Homomorphic Encryption Over the Torus
by dllthomas on Monday August 07, 2017 @09:20PM
(#14952718)
Off the top of my head, maybe something like:
1) Secretly compute a list of encrypted tags and associated, unencrypted scores.
2) Sort by scores.
3) Convert the highest N tags back to encrypted data.
As a plus, steps 1 and 3 should be embarrassingly parallel.
You are, of course, leaking a count, which can be important (but your opponent can already make inferences based on the amount of data you have stored...).
1) Secretly compute a list of encrypted tags and associated, unencrypted scores. 2) Sort by scores. 3) Convert the highest N tags back to encrypted data.
As a plus, steps 1 and 3 should be embarrassingly parallel.
You are, of course, leaking a count, which can be important (but your opponent can already make inferences based on the amount of data you have stored...).