Improving data hiding within colour images using hue component of HSV colour space

Abstract

Data hiding technologies aim to hide the existence of secret information within digital covers such as images by causing unnoticeable degradation to their quality. Reducing the image distortion and increasing the embedding capacity are the main points that the data hiding techniques revolved around. This article proposes two high payload embedding methods with high stego image quality using the Hue-Saturation-Value (HSV) colour model. The first method is hue-based embedding (HBE) that employs the H plane for hiding one or two bits in non-grey pixels. The second method uses the three HSV components, so it is called three-planes embedding (TPE). In TPE, one bit is hidden in the least significant bit (LSB) of V of the grey pixels, one or two bits in H of the pixels having low saturation or low brightness and one bit in the LSB of S otherwise. The experiments were conducted on 25 images and the results show that HBE hides more data on average than TPE with its quality reaching 60 dB. TPE achieves quality up to 61 dB and capacity reaches 364 Kb. TPE scores the highest capacity among six state-ofthe-art techniques in Red-Green-Blue, HSV, Hue-Saturation-Intensity and YCbCr spaces with the highest average peak signal to noise ratio midst five of them. By embedding 60, 90, and 120 Kb, this TPE attains the best average quality amid all the methods.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

Novel Arabic e-Text Watermarking Supporting Partial Dishonesty Based on Counting-Based Secret Sharing

“…As an example, consider the generation and reconstruction of shares for a 12 bits secret key shown in Fig. 4a and b respectively, as principally discussed in [25] and [26]. The total number of shares that can be generated (n 5, is the number of 0 s available in the secret key) and the minimum number of shares required to reconstruct the key (k 4).…”

“…Fig.4a Key shares generation example for a 12 bits secret key and 5 shares, as related to[25] b Reconstructing secret key from 4 shares (k 4)[26] …”

Engineering Graphical Captcha and AES Crypto Hash Functions for Secure Online Authentication

“…Figure 7, shows our proposed methodology graphical CAPTCHA to illustrate this usability feature. This contradiction between distortion and robotic guessing made our proposed methodology have less distorted CAPTCHA images, but protected combining cryptography and hashing (Alotaibi et al, 2019) different than HSV colour space image security (Hassan & Gutub, 2021). Table 4 shows our list of images with user selection speed for proper CAPTCHA images.…”

Personal Privacy Evaluation of Smart Devices Applications Serving Hajj and Umrah Rituals

“…This study involved most needed Hajj and Umrah common features focusing on confidentiality and covering apps different languages, number of users, and user rating affected the social intellectual understanding as well as the groups personality and their collective influences. Therefore, for the open source convenience, the paper is currently directed to evaluate all possibly available apps published in "Google play "store at the time of research, which can be further used as privacy practical guide for any interested apps development (serving Hajj and Umrah) facilitations differently than general security technologies dedications platforms such as counting-based secret sharing (Gutub et al, 2019), or medical crypto security (Bin-Hureib, & Gutub, 2020) as well as image privacy (Hassan & Gutub, 2021), and language dedication confidentiality (Gutub & Fattani, 2007). This paper is organized as follows.…”