On Post-Generation Data Operations in Secure Distributed Storage Systems with Internal Padding

Abstract

Secure distributed storage systems can achieve data security and fault resilience by providing encrypted and redundant data segments across multiple computing nodes. However, such systems might face severe performance bottlenecks when frequently tacking data with high consistency demand. This paper proposed a secure distributed storage system based on revised secret sharing scheme with internal padding. Data are saved in multiple coefficients of associated polynomials for high capacity. Shares generated from these polynomials are distributed and can be recollected to retrieve the original data. Post-generation data operations including data insertion, deletion, updating and appending do not require the complete share regeneration. Only affected data portions will be reprocessed and parallel processing is supported if they are interleaved. Performance analyses and experimental results have demonstrated the effectiveness and efficiency of the post-generation data operations.