Polynomial-Based Secret Sharing Scheme for Text, Image and Audio
- PDF / 3,516,380 Bytes
- 13 Pages / 595.276 x 790.866 pts Page_size
- 57 Downloads / 203 Views
ORIGINAL CONTRIBUTION
Polynomial-Based Secret Sharing Scheme for Text, Image and Audio Prashanti Guttikonda1,2
•
Nirupama Bhat Mundukur1
Received: 14 October 2019 / Accepted: 26 July 2020 The Institution of Engineers (India) 2020
Abstract Confidential information can be shared in a group with secret sharing scheme where no single user can retrieve the secret. Only few or more in the group together only can restore the secret. The secret could be in the form of numeric, text, image, audio, etc. There are different methods to deal with the above said secrets. In this paper, Lagrange’s interpolation method is applied in the formation and restoration of shares on numeric, text, image and audio. Constant coefficients and random coefficients are used while considering the coefficients of polynomial and dissimilarity between shares, and secret is measured using Pearson correlation coefficient. Keywords Secret sharing Text Image Audio Polynomial Lagrange’s interpolation Pearson correlation
Introduction Cryptography and watermarking algorithms are not suitable for situations where secret or master key has to be distributed and controlled among a group of participants [1]. For such cases, a branch of cryptography known as secret sharing scheme can be applied where the secret is cleaved into meaningless shares and allocated to the members of the group. Only a valid subset of members in the group can reveal the secret by combining their shares & Prashanti Guttikonda [email protected] 1
Vignan’s Foundation for Science, Technology and Research, Vadlamudi, Guntur District, Andhra Pradesh, India
2
Vignan’s LARA Institute of Technology and Science, Vadlamudi, Guntur District, Andhra Pradesh, India
[2]. With huge expansion of network, data communication is not limited to only text, but it has expanded to handle image, audio, video, etc. So there is a need for a scheme that can provide security to all these types of multimedia data. A threshold scheme based on polynomial interpolation has been introduced by Shamir that works well with text, image and audio based on constraints of the application and requirements of users [3]. In this method for a secret integer value u, a group of n participants with a threshold value k generate n shares with a polynomial of k - 1 degree. The secret can be reconstructed by a group with at least k participants using Lagrange’s interpolation, and the group with less than k participants cannot obtain the information. When secret is in the form of image or video, then Shamir’s scheme generates shares with size equal to the original image which is a burden for storage space [4]. To overcome this, Thien and Lin suggested a procedure where polynomial considers the pixel values as the coefficient thereby minimizing the dimensions of the image shares [5]. Security of shares is enhanced with the scheme proposed by Lin and Tsai, where the shares are hidden into camouflage images and then delivered to the participant, and also provides the capability of authentication during
Data Loading...
