A Chaos Based Robust and Secure Image Hashing Framework
18 Dec 2018-
TL;DR: A robust image hashing framework is presented using discrete cosine transformation and singular value decomposition that is resilient to different content-preserving image distortions such as geometric and filtering operations.
Abstract: In this paper, a robust image hashing framework is presented using discrete cosine transformation and singular value decomposition. Firstly, the input image is normalized using geometric moment and normalized coefficients are divided into non-overlapping blocks. The selected blocks based on a peace-wise non-linear chaotic map are transformed using discrete cosine transom followed by singular value decomposition. Then a feature matrix is constructed in reliance on Hessian matrix and the final hash values are obtained. The proposed hashing system is resilient to different content-preserving image distortions such as geometric and filtering operations. The simulated results demonstrate the efficiency proposed framework in terms of security and robustness.
Citations
More filters
04 Dec 2020
TL;DR: In this paper, a novel hashing framework is proposed using edge map and image normalization, the input image is normalized using geometric moments and an edge map is then employed using the canny edge detector, the estimated binary image is divided into nonoverlapping blocks and a chaotic map is used for random block selection.
Abstract: In this paper, a novel hashing framework is proposed using edge map and image normalization. In the proposed method, the input image is normalized using geometric moments and an edge map is then employed using the canny edge detector. The estimated binary image is divided into non-overlapping blocks and a chaotic map is used for random block selection. The singular value decomposition is carried out on the selected blocks for extracting the significant features followed by generation of hash value. The simulation results support the contention that the proposed technique is secure and considerately robust against a variety of image manipulations.
1Â citations
25 Nov 2022
TL;DR: In this article , hash based secure chaotic steganography technique for hiding secret information, into the cover image was proposed and shared memory implementation for faster execution of the proposed security technique has been done in OpenMP platform.
Abstract: This paper deals with hash based secure chaotic steganography technique for hiding secret information, into the cover image. Hash function has been used in the proposed work for computing the Non LSB positions for hiding the secret data bits. Secret is encoded with chaotic sequences and randomness of the sequences has been validated with NIST test suite. Shared memory implementation for faster execution of the proposed security technique has been done in OpenMP platform. Sequential and the parallel versions of the techniques have been implemented in C++, OpenMP and simulated in the Intel Haswell processor based multi-core environment. With the advantages offered by multicore processors the proposed technique ensures low time complexity. Significant speedup and linear scalability have been reported with increase in the number of threads. Standard statistical validation test results viz. PSNR, Euclidean distance, histogram analysis, SSIM index applied to validate the quality of stego image show satisfactory results.
25 Nov 2022
TL;DR: In this paper , hash based secure chaotic steganography technique for hiding secret information, into the cover image was proposed and shared memory implementation for faster execution of the proposed security technique has been done in OpenMP platform.
Abstract: This paper deals with hash based secure chaotic steganography technique for hiding secret information, into the cover image. Hash function has been used in the proposed work for computing the Non LSB positions for hiding the secret data bits. Secret is encoded with chaotic sequences and randomness of the sequences has been validated with NIST test suite. Shared memory implementation for faster execution of the proposed security technique has been done in OpenMP platform. Sequential and the parallel versions of the techniques have been implemented in C++, OpenMP and simulated in the Intel Haswell processor based multi-core environment. With the advantages offered by multicore processors the proposed technique ensures low time complexity. Significant speedup and linear scalability have been reported with increase in the number of threads. Standard statistical validation test results viz. PSNR, Euclidean distance, histogram analysis, SSIM index applied to validate the quality of stego image show satisfactory results.
References
More filters
Book•
01 Jan 1996TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.
13,597Â citations
TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Abstract: A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering. Its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Loeve transform, which is known to be optimal. The performances of the Karhunen-Loeve and discrete cosine transforms are also found to compare closely with respect to the rate-distortion criterion.
4,481Â citations
[...]
TL;DR: A novel image indexing technique that may be called an image hash function, which uses randomized signal processing strategies for a non-reversible compression of images into random binary strings, and is shown to be robust against image changes due to compression, geometric distortions, and other attacks.
Abstract: The proliferation of digital images creates problems for managing large image databases, indexing individual images, and protecting intellectual property. This paper introduces a novel image indexing technique that may be called an image hash function. The algorithm uses randomized signal processing strategies for a non-reversible compression of images into random binary strings, and is shown to be robust against image changes due to compression, geometric distortions, and other attacks. This algorithm brings to images a direct analog of message authentication codes (MACs) from cryptography, in which a main goal is to make hash values on a set of distinct inputs pairwise independent. This minimizes the probability that two hash values collide, even, when inputs are generated by an adversary.
585Â citations
"A Chaos Based Robust and Secure Ima..." refers methods in this paper
...[9] construct a perceptual hash function using random tiling on low frequency band in wavelet decomposition....
[...]
TL;DR: A novel algorithm for generating an image hash based on Fourier transform features and controlled randomization is developed and it is shown that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions.
Abstract: Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper develops a novel algorithm for generating an image hash based on Fourier transform features and controlled randomization. We formulate the robustness of image hashing as a hypothesis testing problem and evaluate the performance under various image processing operations. We show that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions. We introduce a general framework to study and evaluate the security of image hashing systems. Under this new framework, we model the hash values as random variables and quantify its uncertainty in terms of differential entropy. Using this security framework, we analyze the security of the proposed schemes and several existing representative methods for image hashing. We then examine the security versus robustness tradeoff and show that the proposed hashing methods can provide excellent security and robustness.
542Â citations
"A Chaos Based Robust and Secure Ima..." refers methods in this paper
...[12] proposed a hashing framework based on discrete Fourier transform (DFT)....
[...]
27 Mar 2000
TL;DR: Methods how robust hash functions can be built and how the hash bits has another application, the robust image digest can be used as a search index for an efficient image database search.
Abstract: Digital watermarks have been proposed for authentication of both video data and still images and for integrity verification of visual multimedia In such applications, the watermark has to depend on a secret key and on the original image It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust) Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations It is further required that two completely different images produce completely different bit-strings We discuss methods how such robust hash functions can be built We also show how the hash bits has another application, the robust image digest can be used as a search index for an efficient image database search
385Â citations
"A Chaos Based Robust and Secure Ima..." refers background in this paper
...[8] developed a hashing scheme for watermarking by projecting the image blocks onto the zero-mean random patterns based on some secret key....
[...]