Gaussian Noise Attacks Research Articles

Multi-user visible light communication based on computational temporal ghost imaging and code division multiple access with wide field of view and encryption

In this paper, we propose a wide field of view optical encrypted communication based on computational temporal ghost imaging (CTGI) and code division multiple access (CDMA) with a violet series-biased micro-light-emitting diode (micro-LED) in visible light communication (VLC) system. Using CDMA to achieve multi-user communication, and CTGI to achieve secure transmission and improve signal quality, it is demonstrated that the algorithm ensures the transmission of LED under large field of view (FOV), with error-free communication at a wide angle of 120°. In terms of anti-interference encryption, correct demodulation can be achieved under 45% occlusion attack or 80% Gaussian noise attack, with a total of 6.16×10216 possibilities to ensure the security of user's information, providing an approach for the practical application of VLC system.

A SURF and SVD-based robust zero-watermarking for medical image integrity.

Medical image security is paramount in the digital era but remains a significant challenge. This paper introduces an innovative zero-watermarking methodology tailored for medical imaging, ensuring robust protection without compromising image quality. We utilize Sped-up Robust features for high-precision feature extraction and singular value decomposition (SVD) to embed watermarks into the frequency domain, preserving the original image's integrity. Our methodology uniquely encodes watermarks in a non-intrusive manner, leveraging the robustness of the extracted features and the resilience of the SVD approach. The embedded watermark is imperceptible, maintaining the diagnostic value of medical images. Extensive experiments under various attacks, including Gaussian noise, JPEG compression, and geometric distortions, demonstrate the methodology's superior performance. The results reveal exceptional robustness, with high Normalized Correlation (NC) and Peak Signal-to-noise ratio (PSNR) values, outperforming existing techniques. Specifically, under Gaussian noise and rotation attacks, the watermark retrieved from the encrypted domain maintained an NC value close to 1.00, signifying near-perfect resilience. Even under severe attacks such as 30% cropping, the methodology exhibited a significantly higher NC compared to current state-of-the-art methods.

Enhancement of DWT-SVD digital image watermarking against noise attack using time–frequency representation

Information security has been defined as one of the most critical issues in the information era, as it is utilized to protect confidential information during transfers in real-world applications. In the case of image encryption, a variety of information security approaches were used. Domain spatial and domain frequency are two domains in which such techniques can be classified. This study uses a combination of the singular value de-composition (SVD) and discrete wavelet transformation (DWT) to construct an encryption method based on a traditional watermarking system. Compared with other traditional methods, the proposed DWT-SVD approach has excellent robustness, and it has been strengthened for having high degree of the robustness against the additive white Gaussian noise (AWGN) attacks by utilizing a de-noising strategy based upon S-transform approach. Compared with DWT algorithm denoising approach, the results reveal that the S-transform denoising algorithm that has been deployed in the present article has a robust protection towards the Gaussian noise attack for mean squared error (MSE) around 0.005 and peak signal to noise ratio (PSNR) around 24 dB.

A Semi-Fragile, Inner-Outer Block-Based Watermarking Method Using Scrambling and Frequency Domain Algorithms

Image watermarking is most often used to prove that an image belongs to someone and to make sure that the image is the same as was originally produced. The type of watermarking used for the detection of originality and tampering is known as authentication-type watermarking. In this paper, a blind semi-fragile authentication watermarking method is introduced. Although the main concern in this paper is authenticating the image, watermarking for proving ownership is additionally implemented. The method considers the image as two main parts: an inner part and an outer part. The inner and outer parts are divided into non-overlapping blocks. The block size of the inner and outer part are different. The outer blocks have a greater area than the inner blocks so that their watermark-holding capacity is greater, providing enough robustness for semi-fragility. The method is semi-fragile and the watermarked image is authenticated despite the JPEG being compressed to 75% quality. The embedded watermark also survives innocent types of image operations, such as intensity adjustment, histogram equalization and gamma correction. Semi-fragile and selectively fragile authentication is valuable and in high demand specifically because it survives these innocent image operations while detecting ill-intentioned tampering. In this work, we embed a binary watermark into the inner and outer parts of images using a scrambling algorithm, discrete wavelet transform (DWT) and discrete cosine transform (DCT) in the blocks. The proposed methodology has high image quality after watermarking, with a PSNR value of 40.577, and high quality is also achieved after JPEG compression. The embedding process provides acceptable image quality after tamper attacks, including JPEG compression, Gaussian noise, average filtering, and scaling attacks with PSNR values greater than 29. Experimental results obtained show that the proposed semi-fragile watermarking algorithm is more robust, secure and resistant than other algorithms in the literature.

A Novel CDMA-Based Secret Message Multiplexing Scheme by Image Data Hiding

In this paper, based on the concept of Code Division Multiple Access (CDMA), we propose an innovative secret message multiplexing scheme by digital image data hiding. Multiple secret messages distributed for several participants are encoded into a CDMA codeword through CDMA multiplexing and then embedded into a grayscale image. At the receiving side, each intended recipient will be assigned a distinct spreading code as the secret key for data extraction. In this way, even the authorized user can only extract his or her own secret message using an exclusive secret key and has no knowledge about other user’s secret. This characteristic helps to ensure data security. Experimental results demonstrate that the scheme is also resistant to Gaussian noise attack, salt-and-pepper noise attack, and cropping attacks. Those merits sustain the feasibility of the proposed scheme.

A DCT Fractional Bit Replacement Based Dual Watermarking Algorithm for Image Authentication

Abstract: Watermarking is a process of embedding a message inside a digital signal like an image, video or text. It is used for several key reasons such as authenticity verification, ownership recognition and hidden communication. In this paper, we discuss about image watermarking, where secret messages are stored in images. Introduction: We propose a dual watermarking approach, which is based on Discrete Cosine Transform, Discrete Wavelet Transform and Singular Value Decomposition methods. This paper considers one watermark as robust and other water mark as fragile. Method: The robust watermark is embedded in Discrete Wavelet Transform- Singular Value Decomposition - domain and is used to transmit hidden messages. The fragile watermark is embedded in Discrete Cosine Transform domain and is used for verification of secret message of the robust watermark. The proposed algorithm is tested in the experimental results section and shows promising results against denoising, rotation, translation and cropping attacks. Result: The results show that the performance of the proposed algorithm in terms of mean squared error, structural similarity and peak signal to noise ratio is S4considerable as compared with the existing methods. Discussion: We present the comparison results with Himanshu et. al. in table 10, from which we can see that our method performs better with gaussian noise and rotational attack only lacking with Salt and Pepper noise. Fig. 7 and Fig. 8, in terms of resulting PSNR shows the variation of noise variance and degree of rotation. From the graphs it is evident that out method performs better against Gaussian and rotational attack. Conclusion: In this paper a dual watermarking method is proposed in which one watermark is fragile which is called as authentication watermark whereas the other watermark is robust and is called as the information watermark. The authentication watermark is embedded in the fractional part of DCT domain in the cover image and the information watermark is embedded in the diagonal vector of the LL sub-band.

Multiplicative Watermarking Method with the Visual Saliency Model Using Contourlet Transform

We have proposed an image adaptive watermarking method by using contourlet transform. Firstly, we have selected high-energy image blocks as the watermark embedding space through segmenting the original image into nonoverlapping blocks and designed a watermark embedded strength factor by taking advantage of the human visual saliency model. To achieve dynamic adjustability of the multiplicative watermark embedding parameter, the relationship between watermark embedded strength factor and watermarked image quality is developed through experiments with the peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM), respectively. Secondly, to detect the watermark information, the generalized Gaussian distribution (GGD) has been utilized to model the contourlet coefficients. Furthermore, positions of the blocks selected, watermark embedding factor, and watermark size have been used as side information for watermark decoding. Finally, several experiments have been conducted on eight images, and the results prove the effectiveness of the proposed watermarking approach. Concretely, our watermarking method has good imperceptibility and strong robustness when against Gaussian noise, JPEG compression, scaling, rotation, median filtering, and Gaussian filtering attack.

Lattice-Based Minimum-Distortion Data Hiding

Lattices have been conceived as a powerful tool for data hiding. While conventional studies and applications focus on achieving the optimal robustness versus distortion tradeoff, in some applications such as data hiding in medical/physiological signals, the primary concern is to achieve a minimum amount of distortion to the cover signal. In this paper, we revisit the celebrated quantization index modulation (QIM) scheme and propose a minimum-distortion version of it, referred to as MD-QIM. The crux of MD-QIM is to move the data point to only the boundary of the Voronoi region of the lattice point indexed by a message, which suffices for subsequent correct decoding. At any fixed code rate, the scheme achieves the minimum amount of distortion by sacrificing the robustness to the additive white Gaussian noise (AWGN) attacks. Simulation results confirm that our scheme significantly outperforms QIM in terms of mean square error (MSE), peak signal to noise ratio (PSNR) and percentage residual difference (PRD).

Digital Watermarking For Medical Images Using Dwt And Svd Technique

In the modern world with developing technologies, all the information are collected and stored digitally. In medical field also the diagnostic information are recorded digitally and transmitted. While transferring the information digitally, security and authenticity is the main aspect to be concentrated. Watermarking is the technology which ensures the authenticity and security of the medical images, information about patient and diagnostic details. In this paper, hybrid watermarking technique by the combination of Discrete Wavelet Transform and Singular Value Decomposition is implemented, because of its high security and efficiency as compared with other frequency domain watermarking. The images have been tested against attacks like salt and pepper noise, Gaussian noise, and filtering attack. Efficiency and performance of this hybrid technique are evaluated based on PSNR, SSIM and NC. From the simulation results, PSNR is above 37 dB, which ensures better imperceptibility and shows better robustness with NC values near to 1 against image attacks during transmission.

Chaos-based Video Steganography Method in Discrete Cosine Transform Domain

Due to the technological advancements in digital communication, the amount of multimedia content over the internet has increased manifold in past decade. This has renewed the internet of researchers in the area of privacy and secure communication. This paper presents a secure and robust video steganography method in discrete cosine transform (DCT) domain. In order to enhance the security of the proposed algorithm, the frame selection process is randomized and the secret data are pre-treated using Arnold’s cat map. The secret data are embedded in the middle band DCT coefficient using two pseudo random sequences. These sequences are generated using a chaotic map. We analyze the proposed algorithm in terms of peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), multi-scale structural similarity index (MSSIM) and video quality metric (VQM). The evaluation has been done on 107 video sequences. The experimental results demonstrate that the algorithm maintains acceptable video quality. The robustness of the proposed method is tested under Gaussian and salt and pepper noise attack using correlation between original and recovered images. The proposed algorithm is able to recover 90.60% data without error under salt and pepper noise ([Formula: see text]) attack and 87.23% data correctly under Gaussian noise attack with mean [Formula: see text] and variance [Formula: see text].

A robust Plenoptic image watermarking method using graph-based transform

Numerous methods have been introduced for digital images watermarking. But there are fewer studies on plenoptic images. This image has more information (such as depth) and costs more than regular digital images. So, protecting the ownership of plenoptic is important. In this paper a robust plenoptic image watermarking has been introduced which is based on Graph-based Transform (GBT). Also, in order to maximizing the robustness of watermarking an optimization has been used to find the best graph structure of GBT. This optimization has done using a Genetic Algorithm. One of the common ways to robust the watermarking is the use of discrete cosine transform (DCT). In this study, we have shown that the proposed method is much more powerful than DCT. The proposed method is tested on three plenoptic images namely Alley, Basic Shapes and Coffee Table and the results show that the proposed method is more robust to similar methods such as DCT methods. Watermarking was evaluated using BER, SSIM and PSNR criteria and Gaussian noise attacks with varying intensities.

Relationship between manifold smoothness and adversarial vulnerability in deep learning with local errors* *Project supported by the National Key R&D Program of China (Grant No. 2019YFA0706302), the start-up budget 74130-18831109 of the 100-talent-program of Sun Yat-sen University, and the National Natural Science Foundation of China (Grant No. 11805284).

Artificial neural networks can achieve impressive performances, and even outperform humans in some specific tasks. Nevertheless, unlike biological brains, the artificial neural networks suffer from tiny perturbations in sensory input, under various kinds of adversarial attacks. It is therefore necessary to study the origin of the adversarial vulnerability. Here, we establish a fundamental relationship between geometry of hidden representations (manifold perspective) and the generalization capability of the deep networks. For this purpose, we choose a deep neural network trained by local errors, and then analyze emergent properties of the trained networks through the manifold dimensionality, manifold smoothness, and the generalization capability. To explore effects of adversarial examples, we consider independent Gaussian noise attacks and fast-gradient-sign-method (FGSM) attacks. Our study reveals that a high generalization accuracy requires a relatively fast power-law decay of the eigen-spectrum of hidden representations. Under Gaussian attacks, the relationship between generalization accuracy and power-law exponent is monotonic, while a non-monotonic behavior is observed for FGSM attacks. Our empirical study provides a route towards a final mechanistic interpretation of adversarial vulnerability under adversarial attacks.

Improved anti-noise attack ability of image encryption algorithm using de-noising technique

Information security is considered as one of the important issues in the information age used to preserve the secret information through out transmissions in practical applications. With regard to image encryption, a lot of schemes related to information security were applied. Such approaches might be categorized into 2 domains; domain frequency and domain spatial. The presented work develops an encryption technique on the basis of conventional watermarking system with the use of singular value decomposition (SVD), discrete cosine transform (DCT), and discrete wavelet transform (DWT) together, the suggested DWT-DCT-SVD method has high robustness in comparison to the other conventional approaches and enhanced approach for having high robustness against Gaussian noise attacks with using denoising approach according to DWT. MSE in addition to the peak signal-to-noise ratio (PSNR) specified the performance measures which are the base of this study’s results, as they are showing that the algorithm utilized in this study has high robustness against Gaussian noise attacks.

Double image encryption based on symmetry of 2D-DFT and equal modulus decomposition

This paper introduces a double image encryption scheme mainly based on symmetry of two-dimensional discrete Fourier transform (2D-DFT) and equal modulus decomposition (EMD). Firstly, the plural form is adopted to encode double image as a whole and the 2D-DFT is performed. To obtain matrices satisfying property of conjugate symmetry, the spectra are implemented addition and subtraction. Followed by truncation-superposition operations, another complex value matrix is attained and equal modulus decomposition is carried out to get two phase templates, which are further gyrator transformed to enhance security. With an orthogonal matrix, the real and imaginary parts are shared and spliced together to produce a real-valued cipherimage, which aims to make storage and transmission convenient. The initial states of 2D logistic map are closely related to the plaintext images and is employed to generate phase mask, rotation angles as well as the input of Gaussian matrix, which ensures the high level of security. Experimental results have demonstrated the feasibility and validity of the proposal in restituting plaintext images, security and resisting Gaussian noise attack.

Optical and digital double color-image encryption algorithm using 3D chaotic map and 2D-multiple parameter fractional discrete cosine transform

This paper proposes a new encryption and decryption method for optical and digital double color-images using 2D-multiple parameter fractional discrete cosine transform (MPFrDCT) and 3D-logistic chaotic map (3D-LCM). The double color-images to be encrypted are converted to their indexed formats by extracting their color maps. A 3D-LCM is used for generate a keystream and this keystream is used in scrambling the indexed images. The second scrambled image is normalized and then multiplied by a random phase mask (RPM) generated by 3D-LCM. The first scrambled image and the second modified image are treated as amplitude and phase of a complex signal and this complex signal is encrypted using 2D-MPFrDCT. The Encrypted image is obtained after separating the amplitude and phase parts of this signal. To enhance security, a substitution method is applied in the intermediate image using another keystream generated by 3D-LCM. The decryption method is the same but in reverse order. We have also given a setup for the encryption and decryption of optical double images using this method. The keyspace for the proposed method is also discussed in this paper. The experimental results and the security analysis of the proposed method are given to validate the feasibility and robustness of the proposed method. The statistical analysis like histogram, correlation, entropy analysis, and randomness test confirm the robustness of the proposed method against statistical attacks. The experimental results also show that the proposed method is resistant to a brute-force attack. The proposed method has the ability to resist the occlusion attack, differential attack, and Gaussian random noise attack.

Color image encryption based on discrete trinion Fourier transform and random-multiresolution singular value decomposition

With more and more color images are spread and shared in the untrusted cloud server remotely over the open Internet, some private or confidential information may be contained, it is necessary to develop cryptosystem for these images to free from serious threats. This paper investigates a secure and robust cryptosystem for color image based on discrete trinion Fourier transform and random-multiresolution singular value decomposition. Firstly, a color image is represented into a trinion matrix by precoding and followed by block-wise discrete trinion Fourier transform. Then a mapping from trinion number domain to real number domain is implemented to facilitate random-multiresolution singular value decomposition. To further enhance the randomness of the transformed data, the scrambling based on chaotic sequence is applied to obtain the cipherimage. Experimental results have demonstrated that the proposed color image encryption algorithm is feasible. The adoption of logistic map ensures that the proposed cryptosystem attains high level security. Furthermore, the quality of the retrieved image is better than that of the algorithm based on single color channel processing separately and quaternion matrix based algorithms when it is decrypted correctly or under Gaussian noise and shear attacks. Moreover, employing a trinion matrix to represent a color image is more compact than using quaternion matrix. It would have potential applications in digital image protection.

Robust and blind image watermarking via circular embedding and bidimensional empirical mode decomposition

In this paper, a robust and blind image watermarking algorithm via circular embedding and bidimensional empirical mode decomposition (BEMD) is developed. First, the watermark image is scrambled by Arnold transform to increase the security of the algorithm. Second, the Hilbert curve is adopted to reduce the scrambled 2D watermark image to one-dimensional watermark signal. Third, the host image is decomposed by BEMD to obtain the multi-scale representation in the forms of intrinsic mode functions (IMFs) and a residue. Then, the extreme points of the IMFs are extracted as the embedding locations. Finally, the one-dimensional watermark signal is repeatedly and cyclically embedded in the extreme locations of the first IMF according to the texture masking characteristics of the human visual system, which greatly improves the ability of our algorithm against various attacks. The final watermarked image is reconstructed by combining the modified first IMF and the residual. The watermark can be successfully extracted without resorting to the original host image. Furthermore, image correction can be applied before image watermarking extraction if there are geometric attacks in watermarked image. A large number of experimental results and thorough evaluations confirm that our method can obtain higher imperceptibility and robustness under different types of attacks, and achieve better performance than the current state-of-the-art watermarking algorithms, especially in large-scale cropping attack, JPEG compression, Gaussian noise, sharpening, Gamma correction, scaling, histogram equalization, and rotation attacks.

An embedded novel compact feature profile image in speech signal for teledermoscopy system.

Teledermoscopy is a promising telemedicine service for remote diagnosis and treatment of skin diseases using dermoscopy images. It requires high quality transmission services, efficient utilization of channel bandwidth, effective storage, and security. Thus, this work develops an improved teledermoscopy system that guarantees the efficient and secure transmission of the dermoscopy images. It proposed a novel feature-based secure diagnostic system that supports the automated classification of malignant melanoma and benign nevus at the receiver side (i.e. medical facility). To overcome the transmission of the original dermoscopy images having large size, a novel representation of the dermoscopy images is proposed, namely the compact feature profile (CFP). The proposed CFP represents the dermoscopy image only using its significant features. For security purpose, the CFP is embedded as a watermark in a speech signal using singular value decomposition (SVD) watermarking at the transmitter. Then, the de-embedding/reconstruction process is performed at the receiver end using a proposed modified SVD technique. Finally, the extracted CFP is fed into a classifier for diagnosis at the receiver. To evaluate the robustness of the proposed system, an additive white Gaussian noise (AWGN) attack was employed during the transmission process. To improve the immunity against the AWGN attack, a novel speech signal weight factor is proposed at the watermarking process. Moreover, a compensation factor is calculated at the training phase to compensate the effect of the channel AWGN attack at the receiver. In addition, the superior transform domain and embedding positions of the CFP in the speech signal were studied. The experimental results established that the proposed CFP diagnostic system achieved high classification accuracy, sensitivity, specificity, and F-measure for classifying the two skin cancer classes with the presence of signal-to-noise ratio (SNR) ranging from 10 to 25dB. This work established that the newly proposed CFP watermarked in speech signal using the DWT-based modified SVD followed by single-level decomposition Db1 with hard thresholding wavelet denoising achieved efficient diagnostic teledermoscopy system.

Imperceptible digital watermarking scheme combining 4-level discrete wavelet transform with singular value decomposition

An imperceptible digital watermarking algorithm based on 4-level discrete wavelet transform, discrete cosine transform and singular value decomposition is designed. In this method, the 4-level diagonal sub-band image is obtained by performing the 4-level two-dimensional wavelet transform on the original image, and then a coefficient matrix is produced by applying the discrete cosine transform on the 4-level diagonal sub-band image. A diagonal matrix is constructed by performing the singular value decomposition on the coefficient matrix. The watermark is scrambled by Arnold transform and Logistic map, then the scrambled watermark is processed by the singular value decomposition. Later, the encryption process is completed by embedding the scrambled watermark singular value into the singular value of the coefficient matrix. Simulation results demonstrate that the proposed digital watermarking algorithm could resist JPEG compression attack, Salt and Pepper noise attack, Gaussian noise attack, filter attack, brightness change attack, geometric attack, cut attack, etc.

Secure image encryption technique based on jigsaw transform and chaotic scrambling using digital image watermarking

In this paper, an enhanced symmetric hybrid digital cryptosystem method based on jigsaw transform, digital domain watermarking using discrete cosine domain is proposed. To further enhance the security of the cryptosystem chaotic scrambling with sorting technique is used in order to create chaos. In proposed technique, watermark image is scrambled using jigsaw transform. The plain image is watermarked in discrete cosine domain using jigsawed watermark, then the resultant image is scrambled using chaotic scrambling algorithm. The security of system is strengthened by using additional parameters i.e. jigsaw technique, watermarking and chaotic scrambling using sorting thereby increasing complexity and key space that makes hard for the cyber hacker to derive the secret key to and retrieve the original image. The proposed cryptosystem is designed for 2D gray scale images. The proposed system is implemented digitally and watermark has good imperceptibility and robustness. The real strength of proposed methodology is investigated on the basis of different criteria using Matlab R2018a for experimental results. The computed values of mean squared error, correlation coefficient, peak signal-to-noise ratio, structural similarity Index, between recovered and the original image shows the efficiency of the suggested scheme. The experimental results and numerical simulations are given to highlight the key ruggedness and strength of proposed methodology. Therefore, the obtained simulation results demonstrate that the proposed cryptosystem is robust against known attacks, such as statistical attack (uniform histograms of different encrypted images, Correlation coefficients between plain and the encrypted image is as low as 0.01, brute force attack (large keyspace). Moreover, the ruggedness of the watermark is also proved against Geometric attack, Compression attack, statistical attack (correlation coefficients between the original and encrypted watermark is as low as 0.01) and gaussian noise attack, plaintext attack (secret keys are also encrypted thereby increasing robustness). The proposed method can be used in secure image transmission in healthcare, multimedia transmission etc.