A Fast and Scalable Fragmentation Algorithm for Data Protection Using Multi-storage over Independent Locations

摘要

Data fragmentation and dispersal over several independent locations enhances protection level of outsourced data. In this paper, we introduce a Fast and Scalable Fragmentation Algorithm (FSFA) that is particularly well adapted to be used in a multi-cloud environment. It transforms data into interdependent fragments that all have to be gathered in order to reconstruct the initial information. A performance comparison with published related works (including data encryption and dispersal) demonstrates it can be more than twice faster than the fastest of the relevant fragmentation techniques, while producing reasonable storage overhead.