Open Access Open Access  Restricted Access Subscription Access

(N, 1) Secret Sharing


 

In this, paper we propose a novel approach of (N,1) Secret Sharing. This approach aims to embed secret data in images based on Steganography with color images. The cover image is the one behind which the text data is hidden. There are ‘N’ such cover images and one stego image. The stego image is the last image or ‘N+1’ image. We present the approach for embedding the secret data as well as extracting this data on the receiver side. The cover images are colored images that would be sent to the receiver side through a secured channel. The sender will send the last image i.e. stego image or N+1 image through the unsecured channel to the receiver. The receiving end would require all the N cover images in sequence and the +1 stego image to retrieve the entire secret data.


User
Notifications
Font Size

Abstract Views: 106

PDF Views: 0




  • (N, 1) Secret Sharing

Abstract Views: 106  |  PDF Views: 0

Authors

Abstract


In this, paper we propose a novel approach of (N,1) Secret Sharing. This approach aims to embed secret data in images based on Steganography with color images. The cover image is the one behind which the text data is hidden. There are ‘N’ such cover images and one stego image. The stego image is the last image or ‘N+1’ image. We present the approach for embedding the secret data as well as extracting this data on the receiver side. The cover images are colored images that would be sent to the receiver side through a secured channel. The sender will send the last image i.e. stego image or N+1 image through the unsecured channel to the receiver. The receiving end would require all the N cover images in sequence and the +1 stego image to retrieve the entire secret data.