2017/05/27 by Katarzyna Kapusta, Kapusta, Katarzyna, Gérard Memmi +4
Computer Science · #Advanced Data Storage Technologies #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Privacy-Preserving Technologies in Data #cs.CR
paper · pdf · doi:10.48550/arxiv.1705.09872
arxiv created 2017/05/27 · openalex publication_date 2017/05/27 · arxiv updated 2017/05/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The family of Information Dispersal Algorithms is applied to distributed systems for secure and reliable storage and transmission. In comparison with perfect secret sharing it achieves a significantly smaller memory overhead and better performance, but provides only incremental confidentiality. Therefore, even if it is not possible to explicitly reconstruct data from less than the required amount of fragments, it is still possible to deduce some information about the nature of data by looking at preserved data patterns inside a fragment. The idea behind this paper is to provide a lightweight data fragmentation scheme, that would combine the space efficiency and simplicity that could be find in Information Dispersal Algorithms with a computational level of data confidentiality.