Secret sharing scheme for data encryption based on polynomial coefficient

In recent years, there has been increasing trend for multimedia applications to use delegate service providers for content distributions. These delegate services have brought new challenges to the protection of multimedia content confidentiality. Encryption can be used to hide information from unauthorized individuals, either in transit or in storage. This technique transforms the content into unintelligible and unviewable format. This paper proposes data encryption and decryption process using secret sharing scheme. According to this process there are two levels of encryption. The first level, generates the random polynomial of degree (t-1), where t is a threshold value. The second level, evaluates the mean value of the polynomial´s coefficients. The mean value is added with the ASCII value of the plain text to get the cipher text. Next the secret value of the polynomial for participant´s ID values is generated. This secret is shared among `n´ participants. Each one gets their share. The participants reconstruct the polynomial from the shares. Then the cipher text is decrypted to get the original plain text. The comparison of the proposed method with Samier Secret Sharing method reveals that the size of the share is smaller and the protection level is high.