On the Applicability of Secret Share Algorithms for Saving Data on IoT, Edge and Cloud Devices

A common practice to store data is to use remote Cloud-based storage systems. However, storing files in remote services can arise privacy and security issues, for example, they can be attacked or even discontinued. A possible solution to solve this problem is to split files into chunks and add redundancy by means of Secret Share techniques. When it comes to Internet of Things (IoT), Edge and Cloud environments, these techniques have not been evaluated for the purpose of storing files. This work aims to address this issue by evaluating two of the most common Secret Share algorithms in order to identify their suitability for different environments, while considering the size of the file and the availability of resources. In particular, we analysed Shamir's Secret Share schema and the Redundant Residue Number System (RRNS) to gauge their efficiency regarding storage requirement and execution time. We made our experiments for different file sizes (from 1kB up to 500MB), number of parallel threads (1 to 4) and data redundancy (0 to 7) in all aforementioned environments. Results were promising and showed that, for example, to have seven degrees of redundancy, Shamir uses eight times more storage than RRNS; or, Shamir is faster than RRNS for small files (up to 20 kB). We also discovered that the environment on which the computation should be performed depends on both file size and algorithm. For instance, when employing RRNS, files up to 500kB can be processed on the IoT, up to 50MB on the Edge, and beyond that on the Cloud; whereas, in Shamir's schema, the threshold to move the computation from the IoT to the Edge is about 50kB, and from the Edge to the Cloud is about 500kB.

[1]  Xiaoqing Tan,et al.  A New (t, n) Multi-Secret Sharing Scheme , 2008 .

[2]  Shyong Jian Shyu,et al.  Implementing Secret Sharing Scheme in Parallel , 2018, 2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN).

[3]  Shou-Ching Hsiao,et al.  The dynamic analysis of WannaCry ransomware , 2018, 2018 20th International Conference on Advanced Communication Technology (ICACT).

[4]  Shi-Jinn Horng,et al.  Modified Generalized Random Grids-Based Progressive Secret Sharing with Lossless Ability for Binary Image , 2018, 2018 International Conference on Computer, Control, Informatics and its Applications (IC3INA).

[5]  Hidema Tanaka,et al.  Verifiable Secret Sharing Scheme Using Hash Values , 2018, 2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW).

[6]  Song Wan,et al.  Visual Secret Sharing Scheme for Color QR Code , 2018, 2018 IEEE 3rd International Conference on Image, Vision and Computing (ICIVC).

[7]  Alireza Shamsoshoara,et al.  Overview of Blakley's Secret Sharing Scheme , 2019, ArXiv.

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

[9]  Yogesh K. Meghrajani,et al.  Boolean-based Multi Secret Sharing Scheme using Meaningful Shares , 2018, 2018 Second International Conference on Inventive Communication and Computational Technologies (ICICCT).

[10]  Giovanni Di Crescenzo Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio , 2001, MFCS.

[11]  R. W. Watson,et al.  Self-checked computation using residue arithmetic , 1966 .

[12]  Feng Tian,et al.  Critical analysis of vendor lock-in and its impact on cloud computing migration: a business perspective , 2016, Journal of Cloud Computing.

[13]  Shou-Ching Hsiao,et al.  The static analysis of WannaCry ransomware , 2018, 2018 20th International Conference on Advanced Communication Technology (ICACT).

[14]  Sonali Patil,et al.  Exploring secret image sharing with embedding of shares , 2018, 2018 2nd International Conference on Inventive Systems and Control (ICISC).

[15]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[16]  Fan Ding,et al.  Study on Secret Sharing for SM2 Digital Signature and Its Application , 2018, 2018 14th International Conference on Computational Intelligence and Security (CIS).

[17]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.