SIE: An Application to Secure Stereo Images Using Encryption.
01 Jan 2019-pp 37-61
TL;DR: This chapter introduces a new and effective encryption technique to encrypt left and right stereo images simultaneously to produce a single encrypted image.
Abstract: To provide the security to image contents, most encryption techniques are designed for synthetic and real images which is, however, not applicable to stereo images. Stereo images generally consists of two views (left and right views) of a scene with known viewpoints. The only way is to encrypt both left and right images separately. To address this issue, this chapter introduces a new and effective encryption technique to encrypt left and right stereo images simultaneously to produce a single encrypted image. A decryption process is finally introduced to generate left and right stereo images from the final encrypted image. The extensive experiments on different stereo images demonstrate the efficiency and the robustness of the proposed encryption technique.
Citations
More filters
TL;DR: A compression-then-encryption-based dual watermarking to protect the EPR data for the healthcare system, which produces several significant features and offers better performance in terms of robustness and security.
Abstract: The smart healthcare system is an electronic patient records (EPR) sharing system, which significantly helps sharing of EPR data and provides appropriate medical assistance for the patients and a more suitable platform for the potential researchers. However, the security of EPR data is still a major issue in such systems. In this paper, we develop a compression-then-encryption-based dual watermarking to protect the EPR data for the healthcare system, which produces several significant features. Experiments conducted on a large set of medical data indicate the capability of our proposed method for smart healthcare. Finally, when compared with the existing technique, the proposed work offers better performance in terms of robustness and security.
57 citations
Cites methods from "SIE: An Application to Secure Stere..."
...Lagzian et al. proposed a nonblind robust watermarking technique based on RDWT and SVD transforms.12 It provides better robustness when compared to a watermarking technique using a fusion of Discrete Wavelet Transform (DWT)-SVD....
[...]
...Further, the pixel values are altered based on the coupling of nonlinear chaotic maps with SVD....
[...]
...Fimg ¼ IDWT LL;HL;LH;WHHð Þ (10) Watermark Embedding The final generated watermark is embedded in the medical host image using a fusion of RDWT-RSVD....
[...]
..., SIE is a stereo image encryption scheme that uses a combination of SSFC, nonlinear chaotic maps, and SVD.(16) Images are first scrambled using SSFC scrambling technique....
[...]
...As proposed by Kumar et al., SIE is a stereo image encryption scheme that uses a combination of SSFC, nonlinear chaotic maps, and SVD.16 Images are first scrambled using SSFC scrambling technique....
[...]
TL;DR: Experimental results indicate that the proposed technique offers high robustness and fulfills all watermarking needs for telehealth applications in terms of imperceptibility, robustness, capacity, and security.
Abstract: Maintaining electronic patient records is the primary role for the fruitful implementation of the telehealth services in urban areas to enhance the quality of healthcare. These records frequently shared in-between professionals and healthcare centers so as to develop efficient tool(s) for accurate diagnosis purpose. However, protection of these records is a challenging task in the current era. In this article, we develop a joint watermarking-encryption- error correcting code (ECC) technique for the purpose of securing patient records. The suggested method involves three major steps as follows: 1) watermarks generation and scrambling, 2) encryption of cover and generated watermark via Paillier cryptosystem, and 3) imperceptibly embedding and robustly recovery/extraction of the watermarks. Experimental results indicate that the proposed technique offers high robustness and fulfills all watermarking needs for telehealth applications in terms of imperceptibility, robustness, capacity, and security. Furthermore, the proposed method achieves better robustness against varying attacks, and outperforms former techniques.
25 citations
Cites methods from "SIE: An Application to Secure Stere..."
...The generated watermark is further scrambled by using a step space filling curve (SSFC).(15) Finally, novelty of our method is the use of Paillier cryptosystem scrambled watermark, which is inserted into the encrypted host image by using Homomorphic properties of Paillier cryptosystem....
[...]
...SSFC is a continuous traversal of each pixel of the image in a stair format.(15) It uses the perpendicular relationship property existing between the pixels in the superdiagonal or Figure 2....
[...]
13 Jul 2018
TL;DR: Detailed analysis shows that the lossy techniques performs better quantitatively whereas lossless is better qualitatively, however, lossless techniques are more effective as there is no data loss during the process.
Abstract: Data compression is a vital part of information security, since compressed data is much more secure and convenient to handle. Effective data compression technique creates an effective, secure, easy communicable & redundant data. There are two types of compression algorithmic techniques: - lossy and lossless. These techniques can be applied to any data format like text, audio, video or image file. The primary objective of this study was to analyse data compression techniques used for information security techniques like steganography, cryptography etc. Four each, lossy and lossless techniques are implemented and evaluated on parameters like- file size, saving percentage, time, compression ratio and speed. Detailed analysis shows that the lossy techniques performs better quantitatively whereas lossless is better qualitatively. However, lossless techniques are more effective as there is no data loss during the process. Among all, Huffman encoding outperforms other algorithms.
11 citations
Cites background from "SIE: An Application to Secure Stere..."
...e, the mean and standard deviation are selected which represent each pixel in a block [30-31]....
[...]
6 citations
TL;DR: In this article , a robust medical data hiding scheme based on secure hybrid optimization for industrial scenario image is presented, where the marked image is obtained through non-subsampled shearlet transform-multiresolution singular value decomposition.
Abstract: With the development of the industrial internet technology, the medical data exchange in IoT systems has become more prosperous. Specially, more and more medical images produced by industrial and intelligent devices are outsourced to the cloud for convenient use. However, IoT systems deployment poses several medical data security challenges. To address this issue, in this article, a robust medical data hiding scheme based on secure hybrid optimization for industrial scenario image is presented. Specifically, the marked image is obtained through non-subsampled shearlet transform-multiresolution singular value decomposition. In order to generate the dual marks, we employ the Fisher–Yates permutation to produce the scrambled system watermark address for embedding into the mark image. Afterward, the generated mark image is embedded in the chosen coefficients of the cover in an invisible way. After the watermarking, a hybrid optimization-based encryption scheme is utilized to secure the marked image. Extensive experiments demonstrate the invisibility, security, and robustness of our scheme. Further, the superiority of the scheme is elaborated through making the comparison with the other similar algorithms. The solution not only performs the robust exchange of medical data but also protects the privacy of patients.
4 citations
References
More filters
Book•
[...]
01 Jan 1994
TL;DR: The subject of space-filling curves has generated a great deal of interest in the 100 years since the first such curve was discovered by Peano as discussed by the authors, but there have been no comprehensive treatment of the subject since Siepinsky's in 1912.
Abstract: The subject of space-filling curves has generated a great deal of interest in the 100 years since the first such curve was discovered by Peano. Cantor, Hilbert, Moore, Knopp, Lebesgue and Polya are among the prominent mathematicians who have contributed to the field. However, there have been no comprehensive treatment of the subject since Siepinsky's in 1912. Cantor showed in 1878 that the number of points on an interval is the same as the number of points in a square, while in 1890 Peano showed that there is indeed a continuous curve that maps all points of a line onto all points of a square, although the curve exists only as a limit of very convoluted curves. This book discusses generalizations of Peano's solution and the properties that such curves must possess. It also discusses fractals in this context.
1,271 citations
TL;DR: Experimental results show that this three-dimensional baker map is 2–3 times faster than the two-dimensional one, showing its great potential in real-time image encryption applications.
Abstract: Symmetric block encryption schemes, designed on invertible two-dimensional chaotic maps on a torus or a square, prove feasible and secure for real-time image encryption according to the commonly used criteria given in the literature. In this paper, a typical map of this kind, namely, the baker map, is further extended to be three-dimensional and then used to speed up image encryption while retaining its high degree of security. The proposed algorithm is described in detail, along with its security analysis and implementation. Experimental results show that this three-dimensional baker map is 2–3 times faster than the two-dimensional one, showing its great potential in real-time image encryption applications.
590 citations
01 Jan 2011
TL;DR: A fast image encryption algorithm with combined permutation and diffusion is proposed and an efficient method for generating pseudorandom numbers from spatiotemporal chaos is suggested, which further increases the encryption speed.
Abstract: In recent years, various image encryption algorithms based on the permutation-diffusion architecture have been proposed where, however, permutation and diffusion are considered as two separate stages, both requiring image-scanning to obtain pixel values. If these two stages are combined, the duplicated scanning effort can be reduced and the encryption can be accelerated. In this paper, a fast image encryption algorithm with combined permutation and diffusion is proposed. First, the image is partitioned into blocks of pixels. Then, spatiotemporal chaos is employed to shuffle the blocks and, at the same time, to change the pixel values. Meanwhile, an efficient method for generating pseudorandom numbers from spatiotemporal chaos is suggested, which further increases the encryption speed. Theoretical analyses and computer simulations both confirm that the new algorithm has high security and is very fast for practical image encryption.
528 citations
TL;DR: The results of several experimental, statistical analysis and key sensitivity tests show that the proposed image encryption scheme based on Henon chaotic maps provides an efficient and secure way for image encryption.
Abstract: Recent researches of image encryption algorithms have been increasingly based on chaotic systems, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. This paper presents a new nonlinear chaotic algorithm (NCA) which uses power function and tangent function instead of linear function. Its structural parameters are obtained by experimental analysis. And an image encryption algorithm in a one-time-one-password system is designed. The experimental results demonstrate that the image encryption algorithm based on NCA shows advantages of large key space and high-level security, while maintaining acceptable efficiency. Compared with some general encryption algorithms such as DES, the encryption algorithm is more secure.
485 citations
TL;DR: These measures serve as a general tool for image matching that are applicable to other vision problems such as motion estimation and texture-based image retrieval and suggest the superiority of ordinal measures over existing techniques under nonideal conditions.
Abstract: We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference between intensity distributions are known to be fragile. Ordinal measures which are based on relative ordering of intensity values in windows-rank permutations-have demonstrable robustness. By using distance metrics between two rank permutations, ordinal measures are defined. These measures are independent of absolute intensity scale and invariant to monotone transformations of intensity values like gamma variation between images. We have developed simple algorithms for their efficient implementation. Experiments suggest the superiority of ordinal measures over existing techniques under nonideal conditions. These measures serve as a general tool for image matching that are applicable to other vision problems such as motion estimation and texture-based image retrieval.
414 citations