>I've always wanted to set up some secret-sharing filesystem where
>you have to download multiple "shares" to reconstruct the data.
>But other combinations of those exact same shares give other data.

I've also been toying with this idea for a few years. Throw in
Reed-Solomon code, and you can make a fault-tolerant network where you
need only K servers out of N to reconstruct the data, but less than K
are insufficient. I have written fast RS code -- it's on my website,
http://people.qualcomm.com/karn/dsp.html.

Phil

Reply via email to