International Peer-Reviewed Open Access Journal ISSN (Online): 2395-5325
IJCRCST Logo

International Journal of Contemporary Research in Computer Science and Technology

Peer Reviewed Open Access Fully Refereed Journal Since 2015
Download Full PDF
Article Information
  • Published In Volume 2, Issue 11 (2016)
  • Publication Date July 31, 2026
  • Manuscript ID IJCRCST-NOVEMBER16-01
  • Article Type Research Paper
  • Pages 1062 - 1065
  • 10 Views 0 Downloads

Abstract

The concept of secret sharing has been used in the cloud environment to secure the key used for encryption and decryption. The keys are divided into shares and stored in different cloud storage nodes to prevent from unauthorized access. The ā€œnā€ shares of the key can be regenerated to decrypt data stored in the cloud. The proposed system extends the concept of secret sharing by using our new one way collision resistant hash function which is based on random polynomial. This scheme makes our proposed system to secure against conspiracy attack even if the pseudo shares are compromised. Our proposed system analysis shows that it has better time and space complexity when compared to other secret sharing schemes.

Keywords

Secret sharing Hash function Random polynomial Cloud Conspiracy attack

Authors

S.Ahamed Ali
Dr.M.Ramakrishnan
How to Cite this Article

S.Ahamed Ali, Dr.M.Ramakrishnan (2016). "RANDOM POLYNOMIAL BASED SECRET SHARING SCHEME FOR SECURING KEY IN THE CLOUD ENVIRONMENT". International Journal of Contemporary Research in Computer Science and Technology, 2(11), pp. 1062-1065.