TY - JOUR
T1 - AC-RRNS: Anti-collusion secured data sharing scheme for cloud storage
AU - Tchernykh, A.
AU - Babenko, M.
AU - Chervyakov, N.
AU - Miranda-López, V.
AU - Kuchukov, V.
AU - Cortés-Mendoza, J.M.
AU - Deryabin, M.
AU - Kucherov, N.
AU - Radchenko, G.
AU - Avetisyan, A.
N1 - Cited By :30
Export Date: 27 August 2021
CODEN: IJARE
Correspondence Address: Tchernykh, A.; CICESE Research Center, BC, Mexico; email: chernykh@cicese.mx
Funding details: Russian Foundation for Basic Research, RFBR, 18-07-00109, 18-07-01224-a, 2.6035.2017, MK-6294.2018.9, SP-1215.2016.5, SP-2236.2018.5
Funding text 1: The work is partially supported by Russian Foundation for Basic Research (RFBR) 18-07-01224-a , 18-07-00109 , State task No. 2.6035.2017 , and Russian Federation President Grants SP-1215.2016.5 , SP-2236.2018.5 , and MK-6294.2018.9 .
PY - 2018
Y1 - 2018
N2 - Cloud security issues are important factors for data storage and processing. Apart from the existing security and reliability problems of traditional distributed computing, there are new security and reliability problems. They include attacks on a virtual machine, attacks on the synchronization keys, and so on. According to the assessment of international experts in the field of cloud security, there are risks of cloud collusion under uncertain conditions. To mitigate this type of uncertainty and reduce harms it can cause, we propose AC-RRNS algorithm based on modified threshold Asmuth–Bloom and Mignotte secret sharing schemes. We prove that the algorithm satisfies the formal definition of computational security. If the adversary coalition knows the secret shares, but does not know the secret key, the probability to obtain the secret is less than 1/(2l⋅(k−1)(2l−k−1)). The probability is less than 1/2(l−1) with unknown secret shares and known secret key, and 1/2l⋅k with unknown secret key. Its complexity is equal to brute-force method. We demonstrate that the proposed scheme ensures security under several types of attacks. We propose approaches for selection of parameters for AC-RRNS secret sharing scheme to optimize the system behavior and data redundancy of encryption. © 2018 Elsevier Inc.
AB - Cloud security issues are important factors for data storage and processing. Apart from the existing security and reliability problems of traditional distributed computing, there are new security and reliability problems. They include attacks on a virtual machine, attacks on the synchronization keys, and so on. According to the assessment of international experts in the field of cloud security, there are risks of cloud collusion under uncertain conditions. To mitigate this type of uncertainty and reduce harms it can cause, we propose AC-RRNS algorithm based on modified threshold Asmuth–Bloom and Mignotte secret sharing schemes. We prove that the algorithm satisfies the formal definition of computational security. If the adversary coalition knows the secret shares, but does not know the secret key, the probability to obtain the secret is less than 1/(2l⋅(k−1)(2l−k−1)). The probability is less than 1/2(l−1) with unknown secret shares and known secret key, and 1/2l⋅k with unknown secret key. Its complexity is equal to brute-force method. We demonstrate that the proposed scheme ensures security under several types of attacks. We propose approaches for selection of parameters for AC-RRNS secret sharing scheme to optimize the system behavior and data redundancy of encryption. © 2018 Elsevier Inc.
KW - Cloud Computing
KW - Collusion
KW - Multi-cloud
KW - Residue Number System
KW - Secret Sharing Schemes
KW - Uncertainty
KW - Cloud computing
KW - Cryptography
KW - Data handling
KW - Digital storage
KW - Information theory
KW - Numbering systems
KW - Risk assessment
KW - Multi-clouds
KW - Residue number system
KW - Secret sharing schemes
KW - Distributed computer systems
U2 - 10.1016/j.ijar.2018.07.010
DO - 10.1016/j.ijar.2018.07.010
M3 - Article
SN - 0888-613X
VL - 102
SP - 60
EP - 73
JO - Int J Approximate Reasoning
JF - Int J Approximate Reasoning
ER -