Validation and Data Repairing of Document Image using Steganography Method

This paper attempts to propose a novel technique of blind authentication based on the method of secret in addition to data repair capability for grayscale document images through the use of the Portable Network Graphics (PNG) image. For every block of a grayscale document image, an authentication signal is generated, which, along with the block content in binary, is transformed into numerous shares using the Shamir secret sharing scheme. The parameters involved are carefully selected so that as many shares as possible can be generated and embedded into an alpha channel plane. After this, the alpha channel plane is combined with the original grayscale image to yield a PNG image. During this process, the computed share values are recorded as a range of alpha channel values near their maximum value of 255 to return a transparent stego-image with a disguised effect. In the image authentication process, marking of an image block is done as tampered, if the authentication signal computed from the current block content does not match the one extracted from the shares embedded in the alpha channel plane. Each tampered block is then subjected to data repairing by a reverse Shamir scheme after collecting two shares from unmarked blocks. Procedures to protect the safety of the data that lies concealed in the alpha channel have been proposed. Decent experimental results demonstrate the efficiency of the proposed method

Visual secret sharing and related Works -A Review

The accelerated development of network technology and internet applications has increased the significance of protecting digital data and images from unauthorized access and manipulation. The secret image-sharing network (SIS) is a crucial technique used to protect private digital photos from illegal editing and copying. SIS can be classified into two types: single-secret sharing (SSS) and multi-secret sharing (MSS). In SSS, a single secret image is divided into multiple shares, while in MSS, multiple secret images are divided into multiple shares. Both SSS and MSS ensure that the original secret images cannot be reconstructed without the correct combination of shares. Therefore, several secret image-sharing methods have been developed depending on these two methods for example visual cryptography, steganography, discrete wavelet transform, watermarking, and threshold. All of these techniques are capable of randomly dividing the secret image into a large number of shares, each of which cannot provide any information to the intrusion team.  This study examined various visual secret-sharing schemes as unique examples of participant secret-sharing methods. Several structures that generalize and enhance VSS were also discussed in this study on covert image-sharing protocols and also this research also gives a comparative analysis of several methods based on various attributes in order to better concentrate on the future directions of the secret image. Generally speaking, the image quality generated employing developed methodologies is preferable to the image quality achieved through using the traditional visual secret-sharing methodology

An Effective Bit Plane X-ORing Algorithm for Irretrievable Image Steganography

The technical data of concealing secret info in side verbal exchange is known as Steganography; as a result the attending of skulking info is cloaked. it is the method of concealment noesis in same or a distinct media to limit awareness via the intruders. This paper introduces new system whereby irreversible steganography is employed to hide an image inside the equal medium in order that the key info is cloaked. The key image is usually referred to as payload and therefore the supplier is usually referred to as cover image. X-OR operation is employed amongst mid-level bit planes of supplier image and excessive level bit planes of knowledge image to come up with new low level bit planes of the stego photograph. recovery method involves the X-ORing of low stage bit planes and middle degree bit planes of the stego shot. targeted on the result of the recovery, ulterior data shot is generated. A RGB color image is employed as carrier and therefore the info photograph could be a grayscale image of dimensions but or adequate the dimensions of the carrier snapshot. The planned procedure extensively will increase the embedding capability without drastically reducing the PSNR valu

Penerapan Secret Image Sharing Menggunakan Steganografi dengan Metode Dynamic Embedding dan Authentication-Chaining

Teknik yang banyak digunakan untuk menyebarkan suatu citra rahasia kepada n orang adalah dengan cara membagi citra rahasia ke dalam beberapa bagian yang kemudian diproses menggunakan skema (k, n)-Shamir Secret Sharing yang dikemukakan oleh Adi Shamir (1979). Bagian-bagian dari citra rahasia yang sudah diproses tersebut disisipkan ke dalam n citra kamuflase dan menghasilkan n citra stego. Penyisipan dilakukan sedemikian rupa sehingga kualitas visual citra stego semirip mungkin dengan citra kamuflase. Cara untuk memproteksi citra stego dari orang yang tidak berhak adalah dengan cara menyisipkan suatu bit otentikasi yang berfungsi sebagai suatu digital signature dari citra stego. Citra rahasia dapat dirangkai kembali jika terdapat minimal k citra stego asli. Teknik ini dinamakan Secret Image Sharing

Improvements in Geometry-Based Secret Image Sharing Approach with Steganography

Protection of the sensitive data is an important issue because of the fast development of applications that need exchange of the secret information over the Internet. Secret sharing is an idea proposed by Shamir and Blakley separately with different implementations in 1979. Lin and Tsai proposed a method that uses Steganography to create meaningful shares by using Shamir's secret sharing scheme in 2004. In recent years, researchers work to remove some of the weaknesses of this method. However, all of these methods need cover images four times bigger than the secret image. This arises two problems: increased storage and bandwidth need for shares. We used cover images with the same size as the secret image by using both Blakley's secret sharing approach and Steganography. Therefore, we achieved reduced storage and transmission bandwidth for shares. Besides, the proposed method creates meaningful shares by using Steganography instead of noise-like shares, different from other studies that use Blakley's approach

An enhanced method based on intermediate significant bit technique for watermark images

Intermediate Significant Bit digital watermarking technique (ISB) is a new approved technique of embedding a watermark by replacing the original image pixels with new pixels. This is done by ensuring a close connection between the new pixels and the original, and at the same time, the watermark data can be protected against possible damage. One of the most popular methods used in watermarking is the Least Significant Bit (LSB). It uses a spatial domain that includes the insertion of the watermark in the LSB of the image. The problem with this method is it is not resilient to common damage, and there is the possibility of image distortion after embedding a watermark. LSB may be used through replacing one bit, two bits, or three bits; this is done by changing the specific bits without any change in the other bits in the pixel. The objective of this thesis is to formulate new algorithms for digital image watermarking with enhanced image quality and robustness by embedding two bits of watermark data into each pixel of the original image based on ISB technique. However, to understand the opposite relationship between the image quality and robustness, a tradeoff between them has been done to create a balance and to acquire the best position for the two embedding bits. Dual Intermediate Significant Bits (DISB) technique has been proposed to solve the existing LSB problem. Trial results obtained from this technique are better compared with the LSB based on the Peak Signal to Noise Ratio (PSNR) and Normalized Cross Correlation (NCC). The work in this study also contributes new mathematical equations that can study the change on the other six bits in the pixel after embedding two bits

Data Hiding in Gray-Scale Images by LSB Method using IWT with Lifting Scheme

This paper introduced a completely unique steganography technique to extend the capability and therefore the physical property of the image once embedding. Genetic rule utilized to get associate degree optimum mapping operate to minimize the error distinction between the quilt and therefore the stego image and use the block mapping technique to preserve the native image properties. Additionally we have a tendency to applied the OPAP to extend the activi ty capability of the rule comp are d to different systems. However, the process complexity of the new rule is high. The simulation results showed that capability and physical property of image had enl arg ed timing. Also, we will choose the most effective blo ck size to scale back the computation value and to extend the PSNR victimisation optimisation algorithms like GA