The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A scheme of reversible data hiding in encrypted image (RDH-EI) with high embedding capacity is proposed in this paper. First, cover image is transformed to the quantized discrete cosine transform (DCT) coefficients, which are reformed and encrypted to generate the encrypted image. Then the secret message is embedded into the encrypted image in the location of zero alternating current (ac) coefficients...
Iris recognition has gained increasing popularity over the last few decades; however, the stand-off distance in a conventional iris recognition system is too short, which limits its application. In this paper, we propose a novel hardware–software hybrid method to increase the stand-off distance in an iris recognition system. When designing the system hardware, we use an optimized wavefront coding...
We propose a high capacity reversible ternary embedding-watermarking algorithm based on a modification of full-context-prediction-errors (MFCPE) wherein the binary bit stream is converted to the ternary stream then error histogram shifting is utilized to embed the ternary stream. Unlike the existing predictor methods, we provide a full context prediction with a modification of each pixel at most by...
In 2014, Lo et al. employs the histogram shifting technique to present a reversible data hiding scheme for the "absolute moment block truncation coding image" (AMBTC). In their scheme, the secret message is embedded into the quantization levels. The bitmaps in their scheme cannot carry any secret message. The embedding capacity of their scheme is lower. Thus, in this paper, a reversible...
Secret sharing is a technique that can distribute partial secret information (also called 'shares') to a specific group member. These individual shares are of no use on their own, but they can reconstruct the original secret information when the members collect all of the shares. In this paper, we proposed a novel, polynomial-based, secret sharing scheme using the absolute moment block truncation...
Watermarking is a simple and effective method that is frequently used to protect the copyright of an image. However, watermarks must be strong enough to resist various attacks. In this paper, two-level Discrete Wavelet Transform (DWT) and a trusted third party are applied to ensure the robustness of the watermarks and protect the copyright of an image. The experimental results showed that our proposed...
In this paper, we propose an efficient EMD-based data hiding scheme. To avoid the serious, but usually disregarded, overflow problem in the embedding process, the danger cover pixels, which may result in overflow problem, are modified to safe area. However, the modification will not influence the stego image quality. Comparing to Hong et al.'s scheme proposed in 2008 and Lee et al.'s scheme proposed...
This study presents a novel scheme called a dual verifying (t, n) visual secret sharing scheme. In our proposed scheme, each participant receives a public key and an encrypted shadow instead of the original secret image through the public communication network. There are three goals achieved. The first is to generate a reconstructed secret image, which satisfies the general criteria high security,...
Compression and data-hiding can reduce transmission cost and secure transmissions, respectively, but hiding information directly in the compression codes is one way to meet the two requirements simultaneously. Because of the low redundancy, few lossless compression methods have been applied in the research. Lempel-Ziv-Welch (LZW) coding is a well-known lossless compression algorithm that is simple...
This paper proposes a data hiding with high visual quality in stego-images so that malicious invaders are hardly aware of the existence of the embedded message. Due to high visual quality and good embedding capacity, we also apply our scheme with region of importance (ROI) for protecting the important part of an image. The overload, location map of ROI, is compressed with run length encoding (RLE)...
Wet paper coding is a technique that can be used to embed secrets into some specific pixels, called dry pixels, of a digital image. The fully exploiting modifications method (FEM) is a method applied to convey secrets securely from senders to receivers using a stego-image that is slightly modified from the original digital image. Based on FEM, before embedding, we randomly choose pixels in the image...
This paper demonstrates an effective lossless data hiding scheme using modified Huffman coding. The binary secret message is concurrently embedded and encoded with a cover medium such as a video file, an audio file, or even a text file. The proposed scheme not only provides good data hiding capacity and data recovery capability, but also being efficient in space saving (the stego medium is much smaller...
In this paper, we propose an information hiding scheme to embed secret information into the compression code of an index table. First, the codewords neighboring the current processed index along with their closest codewords form a state codebook. Two indices of the state codebook are reserved as indicators. Once the current processed index satisfies some pre-defined conditions, the current processed...
The wet paper codes method provides a good data embedding technique for secret data delivery. The WPC method applies matrix multiplications to determine modification locations in order to conceal secret data into a cover image. However, the WPC method is not suitable for low power computation environments. The proposed method applies pixel segmentation and exclusive-OR operation to achieve the goal...
A new watermark method for detecting image tampering is proposed in this paper. First, an authentication number is created by using a pair of watermark pixels as the coefficients of a linear function. The central pixel of a host block as the input data to the linear function. The authentication information of that block is then embedded into the host image using the LSB matching revisited embedding...
In this paper, we propose a simple reversible data hiding method in spatial domain for digital images by exploiting the correlation characteristic of neighboring pixels in natural images. The proposed method embeds several secret bits into a block of two consecutive cover pixels whose values are equal. The experimental results show that the proposed method achieves very good visual quality at low...
This paper proposes a novel data embedding method for embedding secrets into VQ indices by using the Chinese Remainder Theorem (CRT). In the experimental results, the hiding capacity is flexible which corresponds to the pre-defined prime parameters. In addition, a reversible mechanism is imported into the scheme so the original VQ indices can be restored after extracting secrets retrieval.
A new fragile watermarking scheme for image authentication and location of areas that have been tampered with is proposed in this paper. Based on a quadratic-residue theorem, the proposed scheme generates the watermark block-by-block in the cover image. To improve security by preventing malicious attacks, such as the vector quantization attack, a pseudo-random number generator using a private key...
This paper proposes an information hiding method based on block-segmentation strategy. The proposed scheme divides a grayscale image into several 4 times 4 blocks and further segment each block into four small blocks sized 2 times 2. Each small block chooses one reference point to be proceeded with outer embedding process. The chosen points then formed an inner block to be proceeded with inner embedding...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.