Abstract
Cloud storage as service is the mainstream technology used to retain digital data. However, there are significant risks for confidentiality, integrity, and availability violation associated with the loss of information, denial of access, technical failures, etc. In this article, we propose a two-level 2Lbp-RRNS scheme based on a Redundant Residue Number System with a backpropagation and hamming distance mechanisms for increasing reliability of a configurable and secure multi-cloud data storage. We provide a theoretical analysis of the 2Lbp-RRNS solution as an extension of the classical 2L-RRNS and a variant of fully homomorphic encryption for privacy-preserving, parallel processing, and scalability. We formulate, explain, and prove its main properties to extend existing knowledge within the limits of the critical bounding RRNS assumptions. We show that 2Lbp-RRNS can identify and recover more errors than traditional 2L-RRNS. We provide the upper bounds of the traditional threshold 2L-RRNS and our solution to estimate the number of detectable and correctable errors. We study various data access scenarios and show that it detects 1.58$\times $ and corrects 3.37$\times $ more errors than 2L-RRNS, on average. We also provide efficient implementations of encoding and decoding algorithms MRC8, and MRC16 based on the Mixed-Radix system, Finite Ring Neuronal Network, and signed binary window method. We evaluate encoding/decoding speeds using three algorithms: Mignotte, MRC8, and MRC16. The experimental system includes seven cloud storages: DropBox, GoogleDrive, OneDrive, Sharefile, Box, Egnyte, and Salesforce. To assess the efficiency of the system on real data, we vary scenarios of the first and second levels. The results show that our solution outperforms MRC8 by 2.53$\times $ (1.78$\times $ ), and Mignotte by 4.83$\times $ (11.43$\times $ ) for the encoding (decoding) speed, respectively.
Highlights
A secure and fault-tolerant multi-cloud storage has to prevent information from unauthorized access, use, disclosure, disruption, modification, etc
We present a two-level secret sharing scheme based on a Redundant Residue Number System named 2Lbp-RRNS designed as a configurable, reliable, and secure multi-clouds data storage mechanism, and a variant of fully homomorphic encryption for privacy-preserving, parallel processing, and scalability
We show how the reliability and performance of the system depend on the 2Lbp-RRNS parameters
Summary
A secure and fault-tolerant multi-cloud storage has to prevent information from unauthorized access, use, disclosure, disruption, modification, etc. Confidentiality, integrity, and availability must be preserved even in the presence of failures, deliberate, as well as accidental threats To this end, data encryption systems, homomorphic encryption, error correction codes, secured sharing schemes, etc. Recent developments in the theoretical cryptography address a set of techniques such as Homomorphic Encryption (HE), Fully Homomorphic Encryption (FHE), Some-what Homomorphic Encryption (SHE), and Secure Multi-Party Computation (MPC) These cryptosystems allow applying certain mathematical operations directly to the ciphertext and safely delegate the processing of data to an untrusted remote party. We propose a two-level RRNS backpropagation scheme (2Lbp-RRNS) with increased reliability for a configurable, reliable, and secure multi-clouds data storage. It has a scalable data access structure. The conclusions and future work are discussed in the last Section VII
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
