In one example, data may be divided into blocks, and the blocks may be stored in various storage resources. Data to be stored may be provided to a data divider. The data divider may divide the data into blocks. Redundancy may be introduced into the blocks to allow the original data to be reconstructed at some point in the future, even if fewer than all of the original blocks are available. The blocks may be sent to a data shuffler, which may shuffle the blocks, and may provide a key that describes how to reconstruct the original data from the blocks. The key may be provided to the owner of the data. When the original data is to be retrieved, the key may be provided to a reassembler, which retrieves the blocks from the various storage resources and reconstructs the data using the key.