@inproceedings{fc8e1cded90f40ef8e97c2e019a81973,
title = "POSTER: A keyless efficient algorithm for data protection by means of fragmentation",
abstract = "Although symmetric ciphers may provide strong computational security, a key leakage makes the encrypted data vulnerable. In a distributed storage environment, reinforcement of data protection consists of dispersing data over multiple servers in a way that no information can be obtained from data fragments until a defined threshold of them has been collected. A secure fragmentation is usually enabled by secret sharing, information dispersal algorithms or data shredding. However, these solutions suffer from various limitations, like additional storage requirement or performance burden. This poster presents a novel flexible keyless fragmentation scheme, balancing memory use and performance with security. It could be applied in many different contexts, such as dispersal of outsourced data over one or multiple clouds or in resource-restrained environments like sensor networks. The scheme has been implemented in Java and Matlab. Preliminary analysis shows good performance and data protection.",
keywords = "Cloud storage, Data protection, Distributed systems, Fragmentation, Security analysis",
author = "Katarzyna Kapusta and Gerard Memmi and Hassan Noura",
note = "Publisher Copyright: {\textcopyright} 2016 Copyright held by the owner/author(s).; 23rd ACM Conference on Computer and Communications Security, CCS 2016 ; Conference date: 24-10-2016 Through 28-10-2016",
year = "2016",
month = oct,
day = "24",
doi = "10.1145/2976749.2989043",
language = "English",
series = "Proceedings of the ACM Conference on Computer and Communications Security",
publisher = "Association for Computing Machinery",
pages = "1745--1747",
booktitle = "CCS 2016 - Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security",
}