92 karma · joined June 8, 2019
One important fact about homomorphic and other encryption schemes you can calculate on: It leaks information! E.g., if enc(x) + enc(y) = enc(z), you gain the knowledge that x + y = z. With enough data, it’s easy to obtain the unencrypted data without the secret(s).
- It’s a pre-print
- Not reviewed
- Way too small group sizes to be meaningful
Those are some high p-values. Makes sense with a small control group of 43 people. This paper can be put in the bin labeled “no statically significance”
If shops adapt this, Amazon will have your name, address (credit card), a video of you and whoever you are with, and knows all the stuff you bought. Great for advertisement and law enforcement.
It seems to be relatively easy to lock someone’s account since they don’t check. Related: https://bitrebels.com/social/how-to-someones-facebook-shut-d...
Eh...what? Linear = Exponential growth?
Anonymity is actually pretty hard...
I wonder why nowadays you have to be ultra-PC with everyone. If everyone gets used to that, won’t everyone’s sensitivity for non-PC drop? I feel like we’re creating a generation of people that can’t take a punch anymore.