A Secure Reversible Data Hiding Scheme for Digital Images using Random Grid Visual Secret Sharing
Authors:
- 1 February 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 864-869
Abstract
A secure data hiding scheme based on visual secret sharing and histogram shifting is proposed. Visual secret sharing is used to encrypt the secret image before hiding it into the host image. Encryption is performed by dividing secret image into n shares. Out of these shares, n-1 are embedded in the host image, and one is stored as a secret key share with Trusting Authority. At the receiver side, the k out of these n-1 shares are extracted from the image. The complete secret data can be revealed only when the key share would be superimposed with the k retrieved shares. Random grid technique along with XOR operation has been used to create shares, resulting in no pixel expansion and maximum contrast for the extracted image. The shares have been embedded in the cover image by using the concept of histogram shifting.Keywords
This publication has 26 references indexed in Scilit:
- Reversible data hiding based on block median preservationInformation Sciences, 2011
- A new image secret sharing scheme to identify cheatersComputer Standards & Interfaces, 2009
- Sharing secrets in stego images with authenticationPattern Recognition, 2008
- An extended difference expansion algorithm for reversible watermarkingImage and Vision Computing, 2008
- Two secret sharing schemes based on Boolean operationsPattern Recognition, 2007
- Cheating in Visual CryptographyDesigns, Codes and Cryptography, 2006
- Optimal Colored Threshold Visual Cryptography SchemesDesigns, Codes and Cryptography, 2005
- Secret image sharing with steganography and authenticationJournal of Systems and Software, 2004
- Visual cryptography for color imagesPattern Recognition, 2003
- Encryption of pictures and shapes by random gridsOptics Letters, 1987