Separable data hiding in encrypted image based on compressive sensing and discrete fourier transform
TL;DR: A new method of separable data hiding in encrypted images are proposed by using CS and discrete fourier transform, which takes full advantage of both real and imaginary coefficients for ensuring great recovery and providing flexible payload.
Abstract: Reversible data hiding in encrypted images has become an effective and popular way to preserve the security and privacy of users’ personal images. Recently, Xiao et al. firstly presented reversible data hiding in encrypted images with use of the modern signal processing technique compressive sensing (CS). However, the quality of decrypted image is not great enough. In this paper, a new method of separable data hiding in encrypted images are proposed by using CS and discrete fourier transform, which takes full advantage of both real and imaginary coefficients for ensuring great recovery and providing flexible payload. Compared with the original work, the proposed method can obtain better image quality when concealing the same embedding capacity. Furthermore, image decryption and data extraction are separable in the proposed method, and the secret data can be extracted relatively accurately.
Citations
More filters
TL;DR: The Corvus corone module two-way image transmission is proposed that provides energy efficiency along CS model, secured transmission through a matrix of security under CS such as inbuilt method, which was named as compressed secured matrix and faultless reconstruction along that of eminent random matrix counting under CS.
Abstract: The manufacturing of intelligent and secure visual data transmission over the wireless sensor network is key requirement nowadays to many applications. The two-way transmission of image under a wireless channel needed image must compatible along channel characteristics such as band width, energy-efficient, time consumption and security because the image adopts big space under the device of storage and need a long time that easily undergoes cipher attacks. Moreover, Quizzical the problem for the additional time under compression results that, the secondary process of the compression followed through the acquisition consumes more time.,Hence, for resolving these issues, compressive sensing (CS) has emerged, which compressed the image at the time of sensing emerges as a speedy manner that reduces the time consumption and saves bandwidth utilization but fails under secured transmission. Several kinds of research paved path to resolve the security problems under CS through providing security such as the secondary process.,Thus, concerning the above issues, this paper proposed the Corvus corone module two-way image transmission that provides energy efficiency along CS model, secured transmission through a matrix of security under CS such as inbuilt method, which was named as compressed secured matrix and faultless reconstruction along that of eminent random matrix counting under CS.,Experimental outputs shows intelligent module gives energy efficient, secured transmission along lower computational timing also decreased bit error rate.
252 citations
TL;DR: This paper proposed two-way image transmission to the Corvus Coron module, which presents an energy-effective with the CS model, as an inbuilt interaction in the CS transmission through the security framework, which results in energy-efficient and conserved transmission in the form of low error rate with low computational time.
Abstract: Two-way image communication in a wireless channel needs to be viable with channel properties such as transfer speed, energy-effective, time usage, and security because image capability consumes a huge space in the gadget and is quite effective. Is required in a manner. The figure goes through attacks. In addition, the quiesical issue for additional time of pressure is that the auxiliary interaction of pressure occurs through the dewar receiving extra time. To address these issues, compressed sensing emerges, which packs the image into hours of sensing, is generated in an expedient manner that reduces time usage and saves the use of data transfer capability, however Bomb in transmission. A variety of examinations cleared a way for dealing with security issues in compressive sensing (CS) through giving security as an alternative negotiation. In addition, univariate factors opted for CS as the issue of rearranging image quality is because of the aggregation of clutter. Along these lines related to the above issues, this paper proposed two-way image transmission to the Corvus Coron module, which presents an energy-effective with the CS model, as an inbuilt interaction in the CS transmission through the security framework. Receives what was designated as the pack-protected plot. Impeccable entertainment with the famous arbitrary network conjecture in CS. The result of the test is that the practical module presents energy-efficient and conserved transmission in the form of low error rate with low computational time.
230 citations
TL;DR: A data embedding method ( PBTL–DE) is proposed to embed secret data to an image by exploiting spatial redundancy within small image blocks and a PBTL-based reversible data hiding method in encrypted images (PBTL–RDHEI).
Abstract: This paper first introduces a parametric binary tree labeling scheme (PBTL) to label image pixels in two different categories. Using PBTL, a data embedding method (PBTL–DE) is proposed to embed secret data to an image by exploiting spatial redundancy within small image blocks. We then apply PBTL–DE into the encrypted domain and propose a PBTL-based reversible data hiding method in encrypted images (PBTL–RDHEI). PBTL–RDHEI is a separable and reversible method that both the original image and secret data can be recovered and extracted losslessly and independently. Experiment results and analysis show that PBTL–RDHEI is able to achieve an average embedding rate as large as 1.752 bpp and 2.003 bpp when block size is set to $2\times 2$ and $3\times 3$ , respectively.
131 citations
TL;DR: This survey presents a brief discussion of different aspects of digital image watermarking, including major characteristics of digital watermark, novel and recent applications of watermarked, different kinds of water marking techniques and common watermark embedding and extraction process.
Abstract: This survey presents a brief discussion of different aspects of digital image watermarking. Included in the present discussion are these general concepts: major characteristics of digital watermark, novel and recent applications of watermarking, different kinds of watermarking techniques and common watermark embedding and extraction process. In addition, recent state-of-art watermarking techniques, potential issues and available solutions are discussed in brief. Further, the performance summary of the various state-of-art watermarking techniques is presented in tabular format. This survey contribution will be useful for the researchers to implement efficient watermarking techniques for secure e-governance applications.
114 citations
Cites background or methods from "Separable data hiding in encrypted ..."
...& Ref [14] introduced a transform domain based watermarking technique in data mining environments....
[...]
...A combination of DFT and compressive sensing based watermarking technique is presented in [41]....
[...]
...& Ref [13, 76, 100, 102, 103] developed an encryption based watermarking method....
[...]
...Ref [97] proposed a reversible multi-watermarking technique using compressive sensing (CS)....
[...]
...& Ref [40, 76, 94] presented a watermarking method in which two different watermarks is embedding into the same cover media....
[...]
TL;DR: A new multiple-image encryption (MIE) algorithm based on Deoxyribonucleic acid encoding and chaotic system is proposed in this paper and has excellent encryption effect and high security.
Abstract: Under the Internet platform, the digital images are widely applied in many fields at present. To protect the content of multiple images, a new multiple-image encryption (MIE) algorithm based on Deoxyribonucleic acid (DNA) encoding and chaotic system is proposed in this paper. Different from the traditional image encryption algorithms, the permutation and diffusion of the new algorithm is manipulated on the three-dimensional DNA matrix. Firstly, k plain images are combined into a big image which is then encoded with the DNA codes; secondly, the big image is scrambled by a chaotic sequence; thirdly, the big image is segmented into k images with the same size of the plain images, and they are diffused by a chaotic image encoded with the DNA codes; finally, k encrypted images are obtained after the DNA decoding. SHA-256 hash value of the plain images is employed to calculate the initial values and control parameters of the chaotic systems. Experimental results and algorithm analyses show that the new encryption algorithm has excellent encryption effect and high security.
85 citations
References
More filters
TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
Abstract: Suppose we are given a vector f in a class FsubeRopfN , e.g., a class of digital signals or digital images. How many linear measurements do we need to make about f to be able to recover f to within precision epsi in the Euclidean (lscr2) metric? This paper shows that if the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program. More precisely, suppose that the nth largest entry of the vector |f| (or of its coefficients in a fixed basis) obeys |f|(n)lesRmiddotn-1p/, where R>0 and p>0. Suppose that we take measurements yk=langf# ,Xkrang,k=1,...,K, where the Xk are N-dimensional Gaussian vectors with independent standard normal entries. Then for each f obeying the decay estimate above for some 0
6,342 citations
Posted Content•
TL;DR: In this article, it was shown that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal $f \in {\cal F}$ decay like a power-law, then it is possible to reconstruct $f$ to within very high accuracy from a small number of random measurements.
Abstract: Suppose we are given a vector $f$ in $\R^N$. How many linear measurements do we need to make about $f$ to be able to recover $f$ to within precision $\epsilon$ in the Euclidean ($\ell_2$) metric? Or more exactly, suppose we are interested in a class ${\cal F}$ of such objects--discrete digital signals, images, etc; how many linear measurements do we need to recover objects from this class to within accuracy $\epsilon$? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal $f \in {\cal F}$ decay like a power-law (or if the coefficient sequence of $f$ in a fixed basis decays like a power-law), then it is possible to reconstruct $f$ to within very high accuracy from a small number of random measurements.
5,693 citations
01 Jul 1999
TL;DR: An overview of the information-hiding techniques field is given, of what the authors know, what works, what does not, and what are the interesting topics for research.
Abstract: Information-hiding techniques have recently become important in a number of application areas. Digital audio, video, and pictures are increasingly furnished with distinguishing but imperceptible marks, which may contain a hidden copyright notice or serial number or even help to prevent unauthorized copying directly. Military communications systems make increasing use of traffic security techniques which, rather than merely concealing the content of a message using encryption, seek to conceal its sender, its receiver, or its very existence. Similar techniques are used in some mobile phone systems and schemes proposed for digital elections. Criminals try to use whatever traffic security properties are provided intentionally or otherwise in the available communications systems, and police forces try to restrict their use. However, many of the techniques proposed in this young and rapidly evolving field can trace their history back to antiquity, and many of them are surprisingly easy to circumvent. In this article, we try to give an overview of the field, of what we know, what works, what does not, and what are the interesting topics for research.
2,561 citations
Book•
01 Jul 1988
TL;DR: This book focuses on the application of the FFT in a variety of areas: Biomedical engineering, mechanical analysis, analysis of stock market data, geophysical analysis, and the conventional radar communications field.
Abstract: The Fast Fourier Transform (FFT) is a mathematical method widely used in signal processing. This book focuses on the application of the FFT in a variety of areas: Biomedical engineering, mechanical analysis, analysis of stock market data, geophysical analysis, and the conventional radar communications field.
1,432 citations