Performance evaluation of secret sharing schemes with data recovery in secured and reliable heterogeneous multi-cloud storage

Properties of redundant residue number system (RRNS) are used for detecting and correcting errors during the data storing, processing and transmission. However, detection and correction of a single error require significant decoding time due to the iterative calculations needed to locate the error. In this paper, we provide a performance evaluation of Asmuth-Bloom and Mignotte secret sharing schemes with three different mechanisms for error detecting and correcting: Projection, Syndrome, and AR-RRNS. We consider the best scenario when no error occurs and worst-case scenario, when error detection needs the longest time. When examining the overall coding/decoding performance based on real data, we show that AR-RRNS method outperforms Projection and Syndrome by 68% and 52% in the worst-case scenario.