Image steganography based on color palette transformation in color space

In this paper, we present a novel image steganography method which is based on color palette transformation in color space. Most of the existing image steganography methods modify separate image pixels, and random noise appears in the image. By proposing a method, which changes the color palette of the image (all pixels of the same color will be changed to the same color), we achieve a higher user perception. Presented comparison of stegoimage quality metrics with other image steganography methods proved the new method is one of the best according to Structural Similarity Index (SSIM) and Peak Signal Noise Ratio (PSNR) values. The capability is average among other methods, but our method has a bigger capacity among methods with better SSIM and PSNR values. The color and pixel capability can be increased by using standard or adaptive color palette images with smoothing, but it will increase the embedding identification possibilityThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.The research had no specific funding and was implemented as a master thesis in Šiauliai Univesity with the supervisor from Vilnius Gediminas Technical Universit

A Secure Steganographic Algorithm Based on Frequency Domain for the Transmission of Hidden Information

This contribution proposes a novel steganographic method based on the compression standard according to the Joint Photographic Expert Group and an Entropy Thresholding technique. The steganographic algorithm uses one public key and one private key to generate a binary sequence of pseudorandom numbers that indicate where the elements of the binary sequence of a secret message will be inserted. The insertion takes eventually place at the first seven AC coefficients in the transformed DCT domain. Before the insertion of the message the image undergoes several transformations. After the insertion the inverse transformations are applied in reverse order to the original transformations. The insertion itself takes only place if an entropy threshold of the corresponding block is satisfied and if the pseudorandom number indicates to do so. The experimental work on the validation of the algorithm consists of the calculation of the peak signal-to-noise ratio (PSNR), the difference and correlation distortion metrics, the histogram analysis, and the relative entropy, comparing the same characteristics for the cover and stego image. The proposed algorithm improves the level of imperceptibility analyzed through the PSNR values. A steganalysis experiment shows that the proposed algorithm is highly resistant against the Chi-square attack

Security during Transmission of Data Using Web Steganography

The project entitled Steganography is to give security to a content record. Since the security of the data over the internet has raised a concern to the people. There are many methods to protect the data from going into the access of unauthorized people. Steganography can be used along with the encryption technique to secure the data. Steganography is used to hide the data or a secret message whereas cryptography is used to encrypt the message and make it difficult the people to read. So, the proposed system is to combine both steganography and cryptography for the secret data transmission. The transmission can be done by using an image as a carrier of data. This paper uses high-performance BMP steganography along with a substitution encryption methodology. The approach that is used here is IDEA (International Data Encryption Algorithm) algorithm which is used for encryption. The IDEA algorithm works as follows, it will take the TEXT document and mystery key as the input and gives the encrypted and BMP picture as the output for the sender side. There can additionally be “Voice Recognition System” framework so that it can use voice to decrypt the message. This is the future expansion or scope of this paper

Free vibration of symmetric angly-plane layered truncated conical shells under classical theory

Truncated conical shell finds wide ranging of engineering applications. They are used in space crafts, robots, shelters, domes, tanks, nozzles and in machinery devices. Thus, the study of their vibrational characteristics has long been of interest for the designers. The use of the lamination for the structures leads to design with the maximum reliability and minimum weight. Moreover, the study of free vibration of laminated conical shells has been treated by a number of researchers. Irie et al. (1982) studied free vibration of conical shells with variable thickness using Rayleigh-Ritz method of solution. Wu and Wu (2000) provided 3D elasticity solutions for the free vibration analysis of laminated conical shells by an asymptotic approach. Wu and Lee (2001) studied the natural frequencies of laminated conical shells with variable stiffness using the differential quadrature method under first-order shear deformation theory (FSDT). Tripathi et al. (2007) studied the free vibration of composite conical shells with random material properties of the finite element method. Civalek (2007) used the Discrete Singular Convolution (DSC) to investigate the frequency response of orthotropic conical and cylindrical shells. Sofiyez et al. (2009) studied the vibrations of orthotropic non-homogeneous conical shells with free boundary conditions. Ghasemi et al. (2012) presented their study of free vibration of composite conical shells which was investigated under various boundary conditions using the solution of beam function and Galerkin method. Viswanathan et al. (2007, 2011) studied free vibration of laminated cross-ply plates, including shear deformation, symmetric angle-ply laminated cylindrical shells of variable thickness with shear deformation theory using the spline collocation method. In the present work, free vibration of symmetric angle-ply laminated truncated conical shells is analyzed and displacement functions are approximated using cubic and quantic spline and collocation procedure is applied to obtain a set of field equations. The field equations along with the equations of boundary conditions yield a system of homogeneous simultaneous algebraic equations on the assumed spline coefficients which resulting to the generalized eigenvalue problem. This eigenvalue problem is solved using eigensolution technique to get as many eigenfrequencies as required. The effect of circumferential mode number, length ratio, cone angle, ply angles and number of layers under two boundary conditions on the frequency parameter is studied for three- and five- layered conical shells consisting of two types of layered materials

Hybrid chaotic map with L-shaped fractal Tromino for image encryption and decryption

Insecure communication in digital image security and image storing are considered as important challenges. Moreover, the existing approaches face problems related to improper security at the time of image encryption and decryption. In this research work, a wavelet environment is obtained by transforming the cover image utilizing integer wavelet transform (IWT) and hybrid discrete cosine transform (DCT) to completely prevent false errors. Then the proposed hybrid chaotic map with L-shaped fractal Tromino offers better security to maintain image secrecy by means of encryption and decryption. The proposed work uses fractal encryption with the combination of L-shaped Tromino theorem for enhancement of information hiding. The regions of L-shaped fractal Tromino are sensitive to variations, thus are embedded in the watermark based on a visual watermarking technique known as reversible watermarking. The experimental results showed that the proposed method obtained peak signal-to-noise ratio (PSNR) value of 56.82dB which is comparatively higher than the existing methods that are, Beddington, free, and Lawton (BFL) map with PSNR value of 8.10 dB, permutation substitution, and Boolean operation with PSNR value of 21.19 dB and deoxyribonucleic acid (DNA) level permutation-based logistic map with PSNR value of 21.27 dB

Schémas de tatouage d'images, schémas de tatouage conjoint à la compression, et schémas de dissimulation de données

In this manuscript we address data-hiding in images and videos. Specifically we address robust watermarking for images, robust watermarking jointly with compression, and finally non robust data-hiding.The first part of the manuscript deals with high-rate robust watermarking. After having briefly recalled the concept of informed watermarking, we study the two major watermarking families : trellis-based watermarking and quantized-based watermarking. We propose, firstly to reduce the computational complexity of the trellis-based watermarking, with a rotation based embedding, and secondly to introduce a trellis-based quantization in a watermarking system based on quantization.The second part of the manuscript addresses the problem of watermarking jointly with a JPEG2000 compression step or an H.264 compression step. The quantization step and the watermarking step are achieved simultaneously, so that these two steps do not fight against each other. Watermarking in JPEG2000 is achieved by using the trellis quantization from the part 2 of the standard. Watermarking in H.264 is performed on the fly, after the quantization stage, choosing the best prediction through the process of rate-distortion optimization. We also propose to integrate a Tardos code to build an application for traitors tracing.The last part of the manuscript describes the different mechanisms of color hiding in a grayscale image. We propose two approaches based on hiding a color palette in its index image. The first approach relies on the optimization of an energetic function to get a decomposition of the color image allowing an easy embedding. The second approach consists in quickly obtaining a color palette of larger size and then in embedding it in a reversible way.Dans ce manuscrit nous abordons l’insertion de données dans les images et les vidéos. Plus particulièrement nous traitons du tatouage robuste dans les images, du tatouage robuste conjointement à la compression et enfin de l’insertion de données (non robuste).La première partie du manuscrit traite du tatouage robuste à haute capacité. Après avoir brièvement rappelé le concept de tatouage informé, nous étudions les deux principales familles de tatouage : le tatouage basé treillis et le tatouage basé quantification. Nous proposons d’une part de réduire la complexité calculatoire du tatouage basé treillis par une approche d’insertion par rotation, ainsi que d’autre part d’introduire une approche par quantification basée treillis au seind’un système de tatouage basé quantification.La deuxième partie du manuscrit aborde la problématique de tatouage conjointement à la phase de compression par JPEG2000 ou par H.264. L’idée consiste à faire en même temps l’étape de quantification et l’étape de tatouage, de sorte que ces deux étapes ne « luttent pas » l’une contre l’autre. Le tatouage au sein de JPEG2000 est effectué en détournant l’utilisation de la quantification basée treillis de la partie 2 du standard. Le tatouage au sein de H.264 est effectué à la volée, après la phase de quantification, en choisissant la meilleure prédiction via le processus d’optimisation débit-distorsion. Nous proposons également d’intégrer un code de Tardos pour construire une application de traçage de traîtres.La dernière partie du manuscrit décrit les différents mécanismes de dissimulation d’une information couleur au sein d’une image en niveaux de gris. Nous proposons deux approches reposant sur la dissimulation d’une palette couleur dans son image d’index. La première approche consiste à modéliser le problème puis à l’optimiser afin d’avoir une bonne décomposition de l’image couleur ainsi qu’une insertion aisée. La seconde approche consiste à obtenir, de manière rapide et sûre, une palette de plus grande dimension puis à l’insérer de manière réversible

Image encryption techniques: A comprehensive review

This paper presents an exhaustive review of research within the field of image encryption techniques. It commences with a general introduction to image encryption, providing an overview of the fundamentals. Subsequently, it explores a comprehensive exploration of chaos-based image encryption, encompassing various methods and approaches within this domain. These methods include full encryption techniques as well as selective encryption strategies, offering insights into their principles and applications. The authors place significant emphasis on surveying prior research contributions, shedding light on noteworthy developments within the field. Additionally, the paper addresses emerging challenges and issues that have arisen as a consequence of these advancements

Sensor Data Integrity Verification for Real-time and Resource Constrained Systems

Sensors are used in multiple applications that touch our lives and have become an integral part of modern life. They are used in building intelligent control systems in various industries like healthcare, transportation, consumer electronics, military, etc. Many mission-critical applications require sensor data to be secure and authentic. Sensor data security can be achieved using traditional solutions like cryptography and digital signatures, but these techniques are computationally intensive and cannot be easily applied to resource constrained systems. Low complexity data hiding techniques, on the contrary, are easy to implement and do not need substantial processing power or memory. In this applied research, we use and configure the established low complexity data hiding techniques from the multimedia forensics domain. These techniques are used to secure the sensor data transmissions in resource constrained and real-time environments such as an autonomous vehicle. We identify the areas in an autonomous vehicle that require sensor data integrity and propose suitable water-marking techniques to verify the integrity of the data and evaluate the performance of the proposed method against different attack vectors. In our proposed method, sensor data is embedded with application specific metadata and this process introduces some distortion. We analyze this embedding induced distortion and its impact on the overall sensor data quality to conclude that watermarking techniques, when properly configured, can solve sensor data integrity verification problems in an autonomous vehicle.Ph.D.College of Engineering & Computer ScienceUniversity of Michigan-Dearbornhttp://deepblue.lib.umich.edu/bitstream/2027.42/167387/3/Raghavendar Changalvala Final Dissertation.pdfDescription of Raghavendar Changalvala Final Dissertation.pdf : Dissertatio

Entropy in Image Analysis II

Image analysis is a fundamental task for any application where extracting information from images is required. The analysis requires highly sophisticated numerical and analytical methods, particularly for those applications in medicine, security, and other fields where the results of the processing consist of data of vital importance. This fact is evident from all the articles composing the Special Issue "Entropy in Image Analysis II", in which the authors used widely tested methods to verify their results. In the process of reading the present volume, the reader will appreciate the richness of their methods and applications, in particular for medical imaging and image security, and a remarkable cross-fertilization among the proposed research areas

Teknik penyembunyian mesej dalam steganografi teks menggunakan pendekatan warna RGB dan penempatan rawak

Steganography is a technique that protects the confidentiality and integrity of data in a protective medium from suspicion of hidden data. The hiding of a message in a text medium can be performed on various text attributes such as type, style, size, and font color to generate a stego text. This study have identified two main problems that lead to the suspicion towards the stego text which is the obvious change of colors of the generated stego and the static representation of the secret message characters using sequential selection of hiding location. Therefore, the main objective of this study is to propose the use of specific value for each combination of Red, Green, Blue (RGB) color to reduce the generated stego text obvious color changes. This study also recommends a dynamic secret message representation method based on a randomly selected character location. A Homophonic Cipher Table was adapted as a method to generate the dynamic secret message characters. Besides, the Second Quotient Remainder Theorem was proposed to convert the secret message characters into a 3D representation by mapping (x,y,z) values to RGB color. The RGB color cube model values of RGB(0,0,0) to RGB(15,15,15) were used to format a selected cover text characters using the Pseudorandom Number Generator. The performance of stego text produced in this study was evaluated using three main measures namely capacity, imperceptibility, and robustness. The results revealed that the proposed method produces a better performance of secret message hiding by 41.31% increase in capacity and the Jaro Winkler's scale imperceptibility score of 1. The performance of stego text is proven to be robust as there is no difference compared to the cover text before and after the compression process. In conclusion, the proposed method has successfully reduced the generated stego text obviousness in the change of colors that lead to suspicion of existence of hidden message. Beside, this method also capable of producing dynamic secret messages using a single cover text