Computationally secure threshold secret sharing scheme with minimal redundancy

When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it is computationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not satisfy the criterion of compactness of a sequence, but it can be used as an asymptotically ideal secret sharing scheme.

[1]  C. H. Huang.  A Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number Applications , 1983, IEEE Transactions on Computers.

[2]  Andrei Tchernykh,et al.  AC-RRNS: Anti-collusion secured data sharing scheme for cloud storage , 2018, Int. J. Approx. Reason..

[3]  E.-G. Talbi,et al.  Positional Characteristics for Efficient Number Comparison over the Homomorphic Encryption , 2019, Programming and Computer Software.

[4]  Seungjoo Kim,et al.  RSA Speedup with Chinese Remainder Theorem Immune against Hardware Fault Cryptanalysis , 2003, IEEE Trans. Computers.

[5]  Andrei Tchernykh,et al.  Performance evaluation of secret sharing schemes with data recovery in secured and reliable heterogeneous multi-cloud storage , 2019, Cluster Computing.

[6]  Ferucio Laurentiu Tiplea,et al.  On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme , 2018, IACR Cryptol. ePrint Arch..

[7]  Uwe Schwiegelshohn,et al.  Towards understanding uncertainty in cloud computing with risks of confidentiality, integrity, and availability , 2016, J. Comput. Sci..

[8]  Arutyun Avetisyan,et al.  Bi-objective Analysis of an Adaptive Secure Data Storage in a Multi-cloud , 2018, CARLA.

[9]  Pascal Bouvry,et al.  Configurable cost-quality optimization of cloud-based VoIP , 2019, J. Parallel Distributed Comput..

[10]  Zhihui Du,et al.  Experimental Analysis of Secret Sharing Schemes for Cloud Storage Based on RNS , 2017, CARLA.

[11]  Arutyun Avetisyan,et al.  Scalable Data Storage Design for Nonstationary IoT Environment With Adaptive Security and Reliability , 2020, IEEE Internet of Things Journal.

[12]  Sorin Cotofana,et al.  An O(n) Residue Number System to Mixed Radix Conversion technique , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[13]  P. A. Lyakhov,et al.  An Approximate Method for Comparing Modular Numbers and its Application to the Division of Numbers in Residue Number Systems* , 2014 .

[14]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[15]  Piero Maestrini,et al.  Error Correcting Properties of Redundant Residue Number Systems , 1973, IEEE Transactions on Computers.

[16]  Mustafa Kaiiali,et al.  A secure data outsourcing scheme based on Asmuth–Bloom secret sharing , 2016, CloudCom 2016.

[17]  Ferucio Laurentiu Tiplea,et al.  A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme , 2014, Inf. Process. Lett..

[18]  Nikolay I. Chervyakov,et al.  Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem , 2017, Int. J. Comput. Math..

[19]  Nikolay I. Chervyakov,et al.  AR-RRNS: Configurable reliable distributed data storage systems for Internet of Things to ensure security , 2017, Future Gener. Comput. Syst..

[20]  Bart Preneel,et al.  On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem , 2002, Public Key Cryptography.