Loading…
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....
Saved in:
Published in: | Cluster computing 2019-12, Vol.22 (4), p.1173-1185 |
---|---|
Main Authors: | , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 1386-7857 1573-7543 |
DOI: | 10.1007/s10586-018-02896-9 |