AC-RRNS: Anti-collusion secured data sharing scheme for cloud storage

Highlights

• Qualify methods used to solve the collusion problem.

• Prove that known homomorphic encryption scheme HORNS is not computationally secure.

• Introduce AC-RRNS configurable data storage scheme based on the reliable RRNS secret sharing scheme.

• Solve the problem of cloud collusion by the modification of Asmuth–Bloom scheme.

• Demonstrate that the AC-RRNS ensures security under several types of attacks.

Abstract

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/(2^{l\cdot (k-1)}(2^{l-k}-1))$. The probability is less than $1/2^{(l-1)}$ with unknown secret shares and known secret key, and $1/2^{l\cdot 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.