You could also look at http://web.eecs.utk.edu/~plank/plank/papers/FAST-2011.pdf http://web.eecs.utk.edu/~plank/plank/papers/FAST-2011.pdf You can combine the

You could also look at http://web.eecs.utk.edu/~plank/plank/papers/FAST-2011.pdf http://web.eecs.utk.edu/~plank/plank/papers/FAST-2011.pdf You can combine the reconstruction properties of Reed Solomon (you need k of n pieces) with the All or Nothing Transform. Encrypting data so that you need all of the data to decrypt. Then you can essentially do Shamir secret sharing witout storage overhead. A 1 MB file split so you need 5 pieces would have 200 KB pieces instead of 1mb pieces. This is at a cost of exchanging information theoretic security for computational security.