Search

Reversible data hiding in encrypted images (RDH-EIs) has attracted increasing attention since it can protect the privacy of original images while exactly extracting the embedded data. In this paper, we propose an RDH-EI scheme with multiple data hiders. First, we introduce a cipher-feedback secret sharing (CFSS) technique using the cipher-feedback strategy of the Advanced Encryption Standard. Then, using the CFSS technique, we devise a new $(r,n)$ -threshold ($r\leq n$) RDH-EI scheme with multiple data hiders called CFSS-RDHEI. It can encrypt an original image into $n$ encrypted images with reduced size using an encryption key and sends each encrypted image to one data hider. Each data hider can independently embed secret data into the encrypted image to obtain a marked encrypted image. The embedded data can be extracted from each marked encrypted image using the data hiding key, and the original image can be completely recovered from $r$ marked encrypted images using the encryption key. Performance evaluations show that our CFSS-RDHEI scheme has a higher embedding rate and that its generated encrypted images are much smaller, while still being well protected, compared to existing secret sharing-based RDH-EI schemes. [ABSTRACT FROM AUTHOR]

In recent years, the use of permutation-diffusion architecture for digital image encryption has become increasingly popular. The permutation procedure scrambles the pixel locations, while the diffusion phase modifies the pixel values and gives rise to the avalanche effect. Various diffusion techniques have been developed, and their strength strongly impacts the security of the overall cryptosystem. In this paper, we re-evaluate the security of a family of image diffusion mechanisms that are based on mixing modulo addition with bitwise exclusive OR operations. The recovery of the encryption element of these diffusion mechanisms is comprehensively demonstrated, and the accuracy bounds under various conditions are proved mathematically. Compared to the state-of-the-art methods, our work improves the recovery accuracy of the encryption element while the required prior knowledge is decreased. The proposed analysis of the diffusion mechanisms is further used to cryptanalyze the whole cryptosystem theoretically and experimentally. [ABSTRACT FROM AUTHOR]

This paper first introduces a (k,n) -sharing matrix S^{(k, n)} and its generation algorithm. Mathematical analysis is provided to show its potential for secret image sharing. Combining sharing matrix with image encryption, we further propose a lossless (k,n)$ -secret image sharing scheme (SMIE-SIS). Only with no less than $k$ shares, all the ciphertext information and security key can be reconstructed, which results in a lossless recovery of original information. This can be proved by the correctness and security analysis. Performance evaluation and security analysis demonstrate that the proposed SMIE-SIS with arbitrary settings of $k$ and $n$ has at least five advantages: 1) it is able to fully recover the original image without any distortion; 2) it has much lower pixel expansion than many existing methods; 3) its computation cost is much lower than the polynomial-based secret image sharing methods; 4) it is able to verify and detect a fake share; and 5) even using the same original image with the same initial settings of parameters, every execution of SMIE-SIS is able to generate completely different secret shares that are unpredictable and non-repetitive. This property offers SMIE-SIS a high level of security to withstand many different attacks. [ABSTRACT FROM AUTHOR]

This paper first introduces a binary-block embedding (BBE) method to embed secret data in a binary image. Using BBE, we propose an algorithm for reversible data hiding in encrypted images (BBE-RDHEI). It uses BBE to embed binary bits in lower bit-planes of the original image into its higher bit-planes such that the lower bit-planes can be reserved for hiding secret data in subsequent processes. BBE-RDHEI employs a bit-level scrambling process after secret data embedding to spread embedded secret data to the entire marked encrypted image so that it can prevent secret data from loss. A security key design mechanism is proposed to enhance the security level of BBE-RDHEI. The processes of BBE-RDHEI are fully reversible. The secret data and original image can be reconstructed independently and separately. Experiments and comparisons show that BBE-RDHEI has an embedding rate nearly twice larger than the state-of-the-art algorithms, generates the marked decrypted images with high quality, and is able to withstand the brute-force, differential, noise and data loss attacks. [ABSTRACT FROM AUTHOR]

Abstract: To enhance security of the bitplane decomposition based image encryption methods, this paper introduces a novel image encryption algorithm using a bitplane of a source image as the security key bitplane to encrypt images. Users have the flexibility to choose (1) any existing or newly generated image as the source image; (2) any decomposition method for generating the bitplane; (3) any decomposed bitplane as the security key bitplane; (4) any scrambling method for the bit-level permutation. As an example, this paper also proposes a bit-level scrambling algorithm to change bit positions. Simulations and security analysis are provided to demonstrate an excellent encryption performance of the proposed algorithm. [Copyright &y& Elsevier]

Abstract: This paper introduces a simple and effective chaotic system using a combination of two existing one-dimension (1D) chaotic maps (seed maps). Simulations and performance evaluations show that the proposed system is able to produce many 1D chaotic maps with larger chaotic ranges and better chaotic behaviors compared with their seed maps. To investigate its applications in multimedia security, a novel image encryption algorithm is proposed. Using a same set of security keys, this algorithm is able to generate a completely different encrypted image each time when it is applied to the same original image. Experiments and security analysis demonstrate the algorithm's excellent performance in image encryption and various attacks. [Copyright &y& Elsevier]

Abstract: This paper introduces a new parametric switching chaotic system (PSCS) and its corresponding transforms for image encryption. The proposed PSCS has a simple structure and integrates the Logistic, Sine and Tent maps into one single system. The PSCS shows more general properties, including the Sine and Tent maps as special instances. It has complex chaotic behaviors. A novel image encryption algorithm is introduced using the proposed PSCS and its transforms. Simulation results and security analysis are given to demonstrate that the proposed algorithm can encrypt different types of images with a high level of security. [Copyright &y& Elsevier]

Abstract: Image encryption is an effective method to protect images or videos by transferring them into unrecognizable formats for different security purposes. To improve the security level of bit-plane decomposition based encryption approaches, this paper introduces a new image encryption algorithm by using a combination of parametric bit-plane decomposition along with bit-plane shuffling and resizing, pixel scrambling and data mapping. The algorithm utilizes the Fibonacci P-code for image bit-plane decomposition and the 2D P-Fibonacci transform for image encryption because they are parameter dependent. Any new or existing method can be used for shuffling the order of the bit-planes. Simulation analysis and comparisons are provided to demonstrate the algorithm''s performance for image encryption. Security analysis shows the algorithm''s ability against several common attacks. The algorithm can be used to encrypt images, biometrics and videos. [Copyright &y& Elsevier]

This paper presents a new encryption scheme of protecting medical images. It has high efficiency and shows robustness of defending some impulse noise and data loss. First, some random data are inserted into surroundings of the image. Then, two rounds of high-speed scrambling and pixel adaptive diffusion are performed to randomly shuffle neighboring pixels and spread these inserted random data over the entire image. The proposed encryption scheme can be directly applied to medical images with any representation format. We provide two kinds of operations to implement the pixel adaptive diffusion: bitwise XOR and modulo arithmetic. The former has high efficiency in hardware platforms while the latter can achieve fast speed in software platforms. Simulations and evaluations show that both encryption schemes using bitwise XOR and modulo arithmetic have high security levels, can achieve much faster speeds, and can better adapt to impulse noise and data loss interference than several typical and state-of-the-art encryption schemes. [ABSTRACT FROM AUTHOR]

• A new two-dimensional infinite collapse map, named 2D-ICM, is constructed. • The hyper-chaotic performance of 2D-ICM is proved in the various evaluations. • A 2D-ICM based image encryption algorithm, named ICMIE, is proposed. • ICMIE has a high security level and low time complexity. Due to the unpredictability and complexity properties, chaotic maps are widely applied in security, communication, and system control. Existing one-dimensional (1D) chaotic maps can be easily predicted and high-dimensional (HD) ones have more complex structures and higher computation costs. In order to enhance the chaotic performance, this paper proposes a new two-dimensional infinite collapse map (2D-ICM). Compared with existing 2D chaotic maps, 2D-ICM has better ergodicity, hyperchaotic property, unpredictability, and a wider chaotic region. To investigate its application, we further propose an image encryption algorithm using 2D-ICM. Simulation demonstrates that the proposed image encryption algorithm has excellent performance for protecting various kinds of images. [ABSTRACT FROM AUTHOR]

• To improve the sparsification performance, we propose the adaptive thresholding sparsification strategy, which utilizes SWT and column based adaptive thresholding (CBAT). • To improve the efficiency, we generate a random order Bernoulli random matrix for each column in the data sampling and develop a new PCS technique. • To reduce the data loss of carrier image, we introduce the matrix encoding technique to embed the secret image to the carrier image. • Simulation and comparison results demonstrate that our proposed scheme is more efficient, and can achieve higher quality of the reconstructed and cipher images than some newly developed schemes. Recently, some visually secure image encryption schemes using compressive sensing (CS) have been developed to protect images with visual security, where the images are first encrypted and compressed concurrently, and then embedded into a carrier image. However, existing schemes have some performance limitations in the quality of the reconstructed and cipher images and the efficiency. To address above issues, this work proposes a new visually secure image encryption scheme. First, we devise an adaptive-thresholding sparsification to greatly improve the quality of the reconstructed image. Second, we design a new parallel CS technique to tremendously improve the processing efficiency. Further, a matrix encoding strategy is finally employed to significantly reduce the number of changed bits in embedding process. Simulations and comparisons show that our proposed scheme has a high security level. Meanwhile, it is also more efficient, and achieves higher quality of the reconstructed and cipher images than some newly developed schemes. [ABSTRACT FROM AUTHOR]