Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aggarwal, G., et al.: Two can keep a secret: a distributed architecture for secure database services. In. Proceedings of the CIDR (2005)
Bacis, E., De Capitani di Vimercati, S., Foresti, S., Paraboschi, S., Rosa, M., Samarati, P.: Mix&Slice: efficient access revocation in the cloud. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 217–228. ACM, New York (2016). https://doi.org/10.1145/2976749.2978377
Bessani, A., Correia, M., Quaresma, B., André, F., Sousa, P.: DepSky: dependable and secure storage in a cloud-of-clouds. Trans. Storage 9(4), 12:1–12:33 (2013). https://doi.org/10.1145/2535929
Bowers, K.D., Juels, A., Oprea, A.: HAIL: a high-availability and integrity layer for cloud storage. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, pp. 187–198. ACM, New York (2009). https://doi.org/10.1145/1653662.1653686
Buchanan, W., Lanc, D., Ukwandu, E., Fan, L., Russell, G.: The future internet: a world of secret shares. Future Internet 7(4), 445 (2015). https://doi.org/10.3390/fi7040445
Castiglione, A., Santis, A.D., Masucci, B., Palmieri, F., Huang, X., Castiglione, A.: Supporting dynamic updates in storage clouds with the AKL–Taylor scheme. Inf. Sci. 387, 56–74 (2017). https://doi.org/10.1016/j.ins.2016.08.093
Chen, L., Laing, T.M., Martin, K.M.: Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme. In: Joye, M., Nitaj, A. (eds.) AFRICACRYPT 2017. LNCS, vol. 10239, pp. 40–57. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57339-7_3
Cincilla, P., Boudguiga, A., Hadji, M., Kaiser, A.: Light Blind: why encrypt if you can share? In: 2015 12th International Joint Conference on e-Business and Telecommunications (ICETE), vol. 04, pp. 361–368, July 2015
Hudic, A., Islam, S., Kieseberg, P., Rennert, S., Weippl, E.R.: Data confidentiality using fragmentation in cloud computing. Int. J. Pervasive Comput. Commun. 9(1), 37–51 (2013). https://doi.org/10.1108/17427371311315743
Kapusta, K., Memmi, G.: Data protection by means of fragmentation in distributed storage systems. In: International Conference on Protocol Engineering (ICPE) and International Conference on New Technologies of Distributed Systems (NTDS), pp. 1–8, July 2015. https://doi.org/10.1109/NOTERE.2015.7293486
Kapusta, K., Memmi, G.: Enhancing data protection with a structure-wise fragmentation and dispersal of encrypted data. In: 17th International Joint Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom), August 2018
Kapusta, K., Memmi, G., Noura, H.: POSTER: a keyless efficient algorithm for data protection by means of fragmentation. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 1745–1747. ACM, New York (2016). https://doi.org/10.1145/2976749.2989043
Karame, G.O., Soriente, C., Lichota, K., Capkun, S.: Securing cloud data under key exposure. IEEE Trans. Cloud Comput. 1 (2017). https://doi.org/10.1109/TCC.2017.2670559
Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136–146. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48329-2_12. http://dl.acm.org/citation.cfm?id=646758.705700
Li, M., Qin, C., Li, J., Lee, P.P.C.: CDStore: toward reliable, secure, and cost-efficient cloud storage via convergent dispersal. IEEE Internet Comput. 20(3), 45–53 (2016). https://doi.org/10.1109/MIC.2016.45
Li, M.: On the confidentiality of information dispersal algorithms and their erasure codes. CoRR abs/1206.4123 (2012). http://arxiv.org/abs/1206.4123
Memmi, G., Kapusta, K., Qiu, H.: Data protection: combining fragmentation, encryption, and dispersion. In: 2015 International Conference on Cyber Security of Smart Cities, Industrial Control System and Communications (SSIC), pp. 1–9, August 2015. https://doi.org/10.1109/SSIC.2015.7245680
Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2), 335–348 (1989). https://doi.org/10.1145/62044.62050
Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300–304 (1960). https://doi.org/10.1137/0108018
Resch, J.K., Plank, J.S.: AONT-RS: blending security and performance in dispersed storage systems. In: Proceedings of the 9th USENIX Conference on File and Stroage Technologies, FAST 2011, Berkeley, CA, USA, p. 14 (2011). http://dl.acm.org/citation.cfm?id=1960475.1960489
Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210–218. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0052348
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979). https://doi.org/10.1145/359168.359176
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Kapusta, K., Memmi, G. (2018). A Fast and Scalable Fragmentation Algorithm for Data Protection Using Multi-storage over Independent Locations. In: Katsikas, S., Alcaraz, C. (eds) Security and Trust Management. STM 2018. Lecture Notes in Computer Science(), vol 11091. Springer, Cham. https://doi.org/10.1007/978-3-030-01141-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-01141-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01140-6
Online ISBN: 978-3-030-01141-3
eBook Packages: Computer ScienceComputer Science (R0)