3 ms·
If it works as I think is described in the high security model, you will have to upload a copy of your update for every single friend. And when you add a new f
by tedunangst 16y ago
If it works as I think is described in the high security model, you will have to upload a copy of your update for every single friend. And when you add a new friend, you will either have to reupload all the old posts or your new friend will be presented with a blank profile.
And if it doesn't work like that, there's not much difference between low and high security that I can see.
- bonzoesc 16y agoYou can reduce this workload by using an asymmetric algorithm like RSA to store an intermediate key. Post = P Symmetric encryption of X with key Y = E(X, Y) Posts are stored as E(P, K_master) Authorizations to posts are stored as E(K_master, K_reader) You can trust your friends (that don't own quantum computers) with your RSA public key, allowing them to E(K_master, K_you) data that can only be decrypted with your private key. It is weak to a known plaintext attack (in which a user Eve with both K_master and E(K_master, K_alice) could attack Alice's private key), and of course weak to an authorized user sharing the master key. It's also weak to copy and paste, just like every other private social network.
- tedunangst 16y agoI assumed you would at least want to block people leaking the master key, even if you can't stop copy paste.
- bonzoesc 16y agoSince it's only for that particular item, it doesn't offer any reason to leak it and not just the item content.