Does there exist a hash of a set that won't reveal membership, but which preserves union and intersection operations? /cc @csoghoian
-
-
Replying to @vagabondjack
@vagabondjack isn't membership is a special case of intersection?1 reply 0 retweets 0 likes -
Replying to @fdaapproved
@fdaapproved That's an excellent point. Hm. The premise is: how do you permit ML research on data that is robust to government access reqs.1 reply 0 retweets 0 likes -
Replying to @vagabondjack
@vagabondjack@fdaapproved suspect the best you can do is set the error rate to whatever's needed to get plausible deniability of membership1 reply 0 retweets 1 like -
Replying to @avibryant
@avibryant@vagabondjack even something like Bloom would give you that. Intersects have more errors than membership though.2 replies 0 retweets 0 likes
@fdaapproved @vagabondjack right, which exactly of bloom/HLL/minhash/KMV etc you use is just about tuning the false+ve/-ve/cardinality err.
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.