Data protection by means of fragmentation in distributed storage systems

This paper analyzes different dispersed storage systems that use data fragmentation as a way of protection. Existing solutions have been organized into two categories: those operating on unstructured data and in a uniform environment, and those having as input data with predefined confidentiality level and disposing of a heterogeneous environment in terms of machine trustworthiness. Furthermore, we outline requirements and desired architecture traits of an efficient dispersed storage, which will address the issues of performance (including latency), resilience and scalability.

[1]  Hugo Krawczyk,et al.  Secret Sharing Made Short , 1994, CRYPTO.

[2]  Shudong Li,et al.  Novel space efficient secret sharing for implicit data security , 2012 .

[3]  Ninghui Li,et al.  t-Closeness: Privacy Beyond k-Anonymity and l-Diversity , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[4]  Subhash C. Kak,et al.  Space efficient secret sharing for implicit data security , 2011, Inf. Sci..

[5]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[6]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[7]  Sushil Jajodia,et al.  Combining fragmentation and encryption to protect privacy in data storage , 2010, TSEC.

[8]  Brian Randell,et al.  Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach , 1994, EDCC.

[9]  Ethan L. Miller,et al.  POTSHARDS—a secure, recoverable, long-term archival storage system , 2009, TOS.

[10]  Frédéric Cuppens,et al.  A French Anonymization Experiment with Health Data , 2014, PSD 2014.

[11]  Douglas M. Blough,et al.  An approach for fault tolerant and secure data storage in collaborative work environments , 2005, StorageSS '05.

[12]  Sushil Jajodia,et al.  Encryption and Fragmentation for Data Confidentiality in the Cloud , 2013, FOSAD.

[14]  Ronald L. Rivest,et al.  All-or-Nothing Encryption and the Package Transform , 1997, FSE.

[15]  Rajeev Motwani,et al.  Two Can Keep A Secret: A Distributed Architecture for Secure Database Services , 2005, CIDR.

[16]  James S. Plank,et al.  AONT-RS: Blending Security and Performance in Dispersed Storage Systems , 2011, FAST.

[17]  Pradeep K. Khosla,et al.  Survivable Information Storage Systems , 2000, Computer.

[18]  Yves Deswarte,et al.  Intrusion-Tolerance Using Fine-Grain Fragmentation-Scattering , 1986, 1986 IEEE Symposium on Security and Privacy.

[19]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[20]  Ian Goldberg,et al.  Privacy-Preserving Queries over Relational Databases , 2010, Privacy Enhancing Technologies.

[21]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[22]  Gérard Memmi,et al.  Fast Selective Encryption Methods for Bitmap Images , 2015, Int. J. Multim. Data Eng. Manag..

[23]  Simon Heron,et al.  Encryption: Advanced Encryption Standard (AES) , 2009 .

[24]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[25]  Edgar R. Weippl,et al.  Data Confidentiality using Fragmentation in Cloud Computing , 2013, Int. J. Pervasive Comput. Commun..