Abstract
Secret sharing schemes are ideal for storing highly sensitive data. A secret is divided into many parts and every participant gets his unique part. If we combine all of these parts and try regenerating the secret then it might be impractical, and therefore the threshold scheme is used. Shamir’s secret sharing scheme supports the same. Here, some of the parts or all of them are required to reconstruct the secret. Any threshold number of parts are sufficient to reconstruct the original secret. The Admin has a set of files which are confidentiality and availability of data. Whenever a Client requests to access the files, the Admin performs authentication of the user through an encrypted and stored on multiple databases so as to achieve Authentication module, who makes use if Shamir's secret sharing concept. This is similar to the One Time Password (OTP) mechanism. If the Client is authentic, Admin grants him the decryption key and the Client can access the file. In this paper, we shall discuss all this in detail using which we can provide security, replication of data and authentication.Â
Highlights
Data is regarded as an important asset in recent years
A secret sharing scheme is a technique of sharing a secret s into n pieces, called shares, and distributing them to a set of n users in such a way that only certain qualified subsets of users can recover the secret by combining their shares and any unqualified subset of users can not do so[3]
A secret sharing scheme is called a (t, n) threshold secret sharing scheme for t≤n if the following two conditions are satisfied: (1) knowledge of any t or more shares makes the secret s computable; (2) knowledge of any t-1 or fewer shares leaves s completely undetermined in information theoretic sense[3]
Summary
Data is regarded as an important asset in recent years. If crucial information gets leaked many loss such as financial losses, lost sales, customer fleeing to competitors may occur. Symmetric key cryptosystem uses same key for both encrypting and decrypting the data. A secret sharing scheme is called a (t, n) threshold secret sharing scheme for t≤n if the following two conditions are satisfied: (1) knowledge of any t or more shares makes the secret s computable; (2) knowledge of any t-1 or fewer shares leaves s completely undetermined in information theoretic sense[3]. This concept can be used by the owners of secure and confidential information to perform. A Client is authenticated only if she is able to provide required number of shares of the secret correctly
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
