QuoteOriginally posted by: outrunthis "Ostrovsky's Anonymous Broadcast via XOR-Trees" is smart. It's a method for hiding a message sender in a network. Not exactly the same problem but it has smart elements.* The first idea is to have N senders, 1 real one and N-1 fake ones that send random data. The receiver collects N messages, tries to decode them, and then will be able to identify the real message. The drawback is that it has a factor N communication overhead.* The second idea is to connect N senders in a ring, passing along messages. Each one XORs the message with a uniquely seeded pseudorandom stream. The receiver know the seeds and will be able to un-XOR all the random streams off the message. The drawback of this is that it's computationally expensive method. The receiver will need to internally replicate all the XOR streams.* The 3rd method lets each sender decode it's incoming message before re-encoding it with a different stream and forward it. All incoming and outgoing messages will be completely uncorrelated (unless you know the seeds)the last one looks like a mixer.i like the expensive first idea. the best place to hide is in a crowd. however i would generate pure pseudorandom fake data. be prepared for the future. today's encryption will not be a big deal tomorrow. for example if your data is a picture of mountain, the fake data should be pictures of other moutains too. if someone cracks your setup it shouldnt be possible to tell what is real.
Last edited by hamster
on March 10th, 2014, 11:00 pm, edited 1 time in total.