Secret Sharing Scheme Based on Chinese Remainder Theorem in Cloud Computing

For the problem of stealing user privacy data by non-trusted cloud computing service providers, the secret-sharing technique are applied to the cloud computing environment by using the Chinese remainder theorem, elliptic curve discrete logarithm problem and bilinear transformation. As a new verifiable secret sharing scheme, the Chinese residual theorem aims to allocate the special secret share and the common secret share respectively to the user and the cloud service provider. Without the participation of the user, the cloud service provider cannot restore the user's private data. The solution can detect the honesty of the cloud service provider and detect the fraud behavior of the cloud service provider in the system. The elliptic curve and the bilinear pairing technology. Not only reduces the computational cost of the system, but also achieves the verifiability of the solution and enhances the security of the system.