scholarly journals Increasing The Capacity of Headstega Based on Bitwise Operation

2021 ◽  
Vol 14 (2) ◽  
pp. 113-126
Author(s):  
Hasmawati Hasmawati ◽  
Ari Moesriami Barmawi
Keyword(s):  
Modular Function ◽  
Secret Message ◽  
Random Numbers ◽  
Binary Representation ◽  
Embedding Capacity ◽  
Email Address ◽  
Bitwise Operations

Headstega (Head steganography) is a noiseless steganography that used email headers as a cover for concealing messages. However, it has less embedding capacity and it raises suspicion. For overcoming the problem, bitwise operation is proposed.  In the proposed method, the message was embedded into the cover by converting the message and the cover into binary representation based on a mapping table that was already known by the sender and the receiver. Furthermore, XOR bitwise operations were applied to the secret message and cover bits based on random numbers that were generated using a modular function. Moreover, the result was converted into characters that represent the secret message bits. After embedding the message into the cover, an email alias was generated to camouflage the secret message characters. Finally, the sender sends the embedded cover and the email alias to the recipient. Using the proposed method, the embedding capacity is 89% larger than using the original Headstega. For reducing the adversary’s suspicion, the existing email address was used instead of creating a new email address.

scholarly journals Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

2021 ◽  
Vol 11 (15) ◽  
pp. 6741
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang ◽  
Wen-Chi Chang
Keyword(s):  
Data Hiding ◽  
Free Space ◽  
Reversible Data Hiding ◽  
Secret Message ◽  
Embedding Capacity ◽  
Absolute Moment ◽  
Compressed Images ◽  
High Embedding Capacity ◽  
Significant Attention ◽  
Efficiency Rate

Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion. In this paper, a novel, efficient reversible data hiding scheme is proposed for absolute moment block truncation code (AMBTC) compressed images. The proposed scheme is based on the high correlation of neighboring values in two mean tables of AMBTC-compressed images to further losslessly encode these values and create free space for containing a secret message. Experimental results demonstrated that the proposed scheme obtained a high embedding capacity and guaranteed the same PSNRs as the traditional AMBTC algorithm. In addition, the proposed scheme achieved a higher embedding capacity and higher efficiency rate than those of some previous schemes while maintaining an acceptable bit rate.

scholarly journals A Distortion-Free Data Hiding Scheme for Triangular Meshes Based on Recursive Subdivision

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yuan-Yu Tsai
Keyword(s):  
Principal Component Analysis ◽  
Data Hiding ◽  
Similarity Transformation ◽  
Principal Component ◽  
Secret Message ◽  
Subdivision Scheme ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Free Data ◽  
Reversible Data Embedding

This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret message is embedded into the newly added vertices. The topology of added vertex is constructed by connecting it with the vertices of located triangle. For further raising the total embedding capacity, a recursive subdivision mechanism, terminated by a given criterion, is employed. Finally, a principal component analysis can make the stego model against similarity transformation and vertex/triangle reordering attacks. Our proposed algorithm can provide a high and adjustable embedding capacity with reversibility. The experimental results demonstrate the feasibility of our proposed algorithm.

scholarly journals A Novel High-Capacity Behavioral Steganographic Method Combining Timestamp Modulation and Carrier Selection Based on Social Networks

Symmetry ◽  
2022 ◽  
Vol 14 (1) ◽  
pp. 111
Author(s):  
Mingliang Zhang ◽  
Zhenyu Li ◽  
Pei Zhang ◽  
Yi Zhang ◽  
Xiangyang Luo
Keyword(s):  
Social Networks ◽  
High Frequency ◽  
High Capacity ◽  
Extraction Process ◽  
Secret Message ◽  
Covert Communication ◽  
Embedding Capacity ◽  
Carrier Selection ◽  
Text Steganography

Behavioral steganography is a method used to achieve covert communication based on the sender’s behaviors. It has attracted a great deal of attention due to its robustness and wide application scenarios. Current behavioral steganographic methods are still difficult to apply in practice because of their limited embedding capacity. To this end, this paper proposes a novel high-capacity behavioral steganographic method combining timestamp modulation and carrier selection based on social networks. It is a steganographic method where the embedding process and the extraction process are symmetric. When sending a secret message, the method first maps the secret message to a set of high-frequency keywords and divides them into keyword subsets. Then, the posts containing the keyword subsets are retrieved on social networks. Next, the positions of the keywords in the posts are modulated as the timestamps. Finally, the stego behaviors applied to the retrieved posts are generated. This method does not modify the content of the carrier, which ensures the naturalness of the posts. Compared with typical behavioral steganographic methods, the embedding capacity of the proposed method is 29.23∼51.47 times higher than that of others. Compared to generative text steganography, the embedding capacity is improved by 16.26∼23.94%.

scholarly journals USAGE OF THE STEGANOGRAPHIC ALGORITHMS FOR TEXT INFORMATION HIDING

2018 ◽  
pp. 49-56
Author(s):  
A. Lagun
Keyword(s):  
Secret Message ◽  
Binary Representation ◽  
Text File ◽  
Left Edge ◽  
Amount Of Information ◽  
Variable Quantity ◽  
Cryptographic Keys ◽  
System User ◽  
Text Information ◽  
Replacement Algorithms

Today cryptographic and steganographic systems provide the best information security of society. Cryptography transforms information into the incomprehensible form with using the cryptographic keys and algorithms. Steganography hides the secret information in unknown place of object. The steganographic algorithms, which hide message in text container, are researched in the article. For process of hiding are used the text file-container properties. The hide message converts to the binary numbers system. User puts ones or zeros into the defined places of text file-container. These places have special characteristics. There may be two types of hiding: insertion and replacement. In case of insertion the hiding message adds to file-container with using invisible characters in viewing mode of text file. Then the size of full container with hided message is bigger than size of empty container. If used the replacing method then the characters of file-container replace to other characters that are almost the same as the first ones. For example, anyone is possible replacement of characters that have the same appearance in different languages. In this case the sizes of the empty and filled container remain the same. One of the simplest hiding methods is insertion the variable quantity of the space characters between words of text file. Suppose, that zero of hidden message is coded by one space character and one - is coded by two space characters. Therefore, depending on hidden message one or two space characters are located in different places of the text. Also, the author considers another hiding type, which uses the same view of some characters of different languages. If you look at the characters in Ukrainian and English, than the 18 characters in the each language is the same – 'a','c','e','i','o','p','x','A','B','C','E','H','I','K','O','P','T','X'. When hiding for the values of zeros in hidden message the file-container remains the same, and for the values of ones in hidden message the characters of language file-container replace to the same characters of another language (Ukrainian-English).The results of the algorithm work show us, that when using characters from different languages in the hiding process, the full file-container is much smaller than when encoding the space characters. The last algorithm which is considered in work uses tail space characters. It forms a filled container with enlarged text strings depending on the number of space characters which the hidden message determines. One character of hidden message is written in two file-container text strings. In particular the binary representation of each character is divided into two parts with four bits, and at the end of each text string is written no more than 15 space characters. The number of space characters corresponds to the decimal value of each part. To ensure hiding of secret message full container has the form aligned to the left edge of the text. Considered algorithms of hiding message in text container are used for the confidential information defense. Algorithms, which use insertion of invisible characters, allow hiding the amount of information that corresponds to the number of space characters with certain characteristics. The most of replacement algorithms hide more information than insertion algorithms. Also replacement algorithms do not change file-container size. For example, algorithm, which replace characters of different alphabets, hides such amount of information, which depends on the statistics of used languages. The most problem of using text containers is providing its steganographic defense. In particular, if user enables the unprintable character view in a text editor, then could see the some statistic of location invisible symbols added by the insertion methods. Therefore decoding of hidden message is simplified. The hidden message with using replacement algorithms is more defensible, but using of compression algorithms to the full container deletes the hidden information.

scholarly journals A Text Steganographic System Based on Word Length Entropy Rate

2017 ◽  
Vol 5 (3) ◽  
pp. 71
Author(s):  
Francis Xavier Kofi Akotoye
Keyword(s):  
Word Length ◽  
Entropy Rate ◽  
Secret Message ◽  
Embedding Capacity ◽  
Secret Key ◽  
Text Document ◽  
Electronic Distribution ◽  
Starting Point ◽  
Hidden Data ◽  
Space Encoding

<p class="0abstract">The widespread adoption of electronic distribution of material is accompanied by illicit copying and distribution. This is why individuals, businesses and governments have come to think of how to protect their work, prevent such illicit activities and trace the distribution of a document. It is in this context that a lot of attention is being focused on steganography. Implementing steganography in text document is not an easy undertaking considering the fact that text document has very few places in which to embed hidden data. Any minute change introduced to text objects can easily be noticed thus attracting attention from possible hackers. This study investigates the possibility of embedding data in text document by employing the entropy rate of the constituent characters of words not less than four characters long. The scheme was used to embed bits in text according to the alphabetic structure of the words, the respective characters were compared with their neighbouring characters and if the first character was alphabetically lower than the succeeding character according to their ASCII codes, a zero bit was embedded otherwise 1 was embedded after the characters had been transposed. Before embedding, the secret message was encrypted with a secret key to add a layer of security to the secret message to be embedded, and then a pseudorandom number was generated from the word counts of the text which was used to paint the starting point of the embedding process. The embedding capacity of the scheme was relatively high compared with the space encoding and semantic method.</p>

A High-Capacity Covering Code for Voice-Over-IP Steganography

2015 ◽  
Vol 10 (3) ◽  
pp. 46-63
Author(s):  
Hui Tian ◽  
Jie Qin ◽  
Yongfeng Huang ◽  
Xu An Wang ◽  
Jin Liu ◽  
...  
Keyword(s):  
High Capacity ◽  
Voice Over Ip ◽  
Experimental Results ◽  
Secret Message ◽  
Embedding Capacity ◽  
Good Balance ◽  
Covering Code ◽  
Conflicting Objectives ◽  
Embedding Distortion

Although steganographic transparency and embedding capacity are considered to be two conflicting objectives in the design of steganographic systems, it is possible and necessary to strike a good balance between them in Voice-over-IP steganography. In this paper, to improve steganographic transparency while maintaining relatively large embedding capacity, the authors present a (2n-1, 2n) covering code, which can hide 2n-1 bits of secret messages into 2n bits of cover messages with not more than n-bit changed. Specifically, each (2n-1)-bit secret message is first transformed into two 2n-bit candidate codewords. In embedding process, the cover message is replaced with the optimal codeword more similar with it. In this way, the embedding distortion can be largely reduced. The proposed method is evaluated by comparing with existing ones with a large number of ITU-T G.729a encoded speech samples. The experimental results show that the authors' scheme can provide good performance on both steganographic transparency and embedding capacity, and achieve better balance between the two objectives than the existing ones.

scholarly journals Video Steganography Using Knight Tour Algorithm and LSB Method for Encrypted Data

2019 ◽  
Vol 29 (1) ◽  
pp. 1216-1225 ◽  
Author(s):  
Zeyad Safaa Younus ◽  
Ghada Thanoon Younus
Keyword(s):  
Superior Performance ◽  
Secret Message ◽  
Random Numbers ◽  
Least Significant Bit ◽  
Video File ◽  
Encrypted Data ◽  
Video Steganography ◽  
Large Size ◽  
Encryption Method ◽  
Selection Of

Abstract This paper aims to propose a method for data hiding in video by utilizing the least significant bit (LSB) method and improving it by utilizing the knight tour algorithm for concealing the data inside the AVI video file and using a key function encryption method for encrypting the secret message. First, the secret message is encrypted by utilizing a mathematical equation. The key used in the equation is a set of random numbers. These numbers differ in each implementation to warrant the safety of the hidden message and to increase the security of the secret message. Then, the cover video was converted from a set of frames into separated images to take the advantage of the large size of video file. Afterward, the knight tour algorithm is utilized for random selecting of the pixels inside the frame utilized for embedding the secret message inside it to overcome the shortcoming of the conventional LSB method that utilized the serial selection of pixel and to increase the robustness and security of the proposed method. Afterward, the encrypted secret message is embedded inside the selected pixels by utilizing the LSB method in bits (7 and 8). The observational results have drawn that the proposed method has a superior performance compared to the previous steganography method in terms of quality by a high PSNR of 67.3638 dB and the lowest MSE of 0.2578. Furthermore, this method preserves the security where the secret message cannot be drawn out without knowing the decoding rules.

scholarly journals High-Capacity Robust Behavioral Steganography Method Based on Timestamp Modulation across Social Internet of Things

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Mingliang Zhang ◽  
Xiangyang Luo ◽  
Pei Zhang ◽  
Hao Li ◽  
Yi Zhang ◽  
...  
Keyword(s):  
Social Networks ◽  
Internet Of Things ◽  
Data Privacy ◽  
Common Property ◽  
High Capacity ◽  
Secret Message ◽  
Embedding Capacity ◽  
Social Internet Of Things ◽  
High Embedding Capacity ◽  
Interaction Behaviors

Social Internet of Things (SIoT) is an emerging field that combines IoT and Internet, which can provide many novel and convenient application scenarios but still faces challenges in data privacy protection. In this paper, we propose a robust behavioral steganography method with high embedding capacity across social networks based on timestamp modulation. Firstly, the IoT devices on the sending end modulate the secret message to be embedded into a timestamp by using the common property on social networks. Secondly, the accounts of multiple social networks are used as the vertices, and the timestamp mapping relationship generated by the interaction behaviors between them is used as the edges to construct a directed secret message graph across social networks. Then, the frequency of interaction behaviors generated by users of mainstream social networks is analyzed; the corresponding timestamps and social networks are used to implement interaction behaviors based on the secret message graph and the frequency of interaction behaviors. Next, we analyze the frequency of interaction behaviors generated by users in mainstream social networks, implement the interaction behaviors according to the secret message graph and the frequency of interaction behaviors in the corresponding timestamps and social networks, and combine the redundant mapping control to complete the embedding of secret message. Finally, the receiver constructs the timestamp mapping relationship through the shared account, key, and other parameters to achieve the extraction of secret message. The algorithm is robust and does not have the problem that existing multimedia-based steganography methods are difficult to extract the embedded messages completely. Compared with existing graph theory-based social network steganography methods, using timestamps and behaviors frequencies to hide message in multiple social networks increases the cost of detecting covert communication and improves concealment of steganography. At the same time, the algorithm uses a directed secret message graph to increase the number of bits carried by each behavior and improves the embedding capacity. A large number of tests have been conducted on mainstream social networks such as Facebook, Twitter, and Weibo. The results show that the proposed method successfully distributes secret message to multiple social networks and achieves complete extraction of embedded message at the receiving end. The embedding capacity is increased by 1.98–4.89 times compared with the existing methods SSN, NGTASS, and SGSIR.

scholarly journals Information Hiding Based on Histogram and Pixel Pattern

2017 ◽  
Author(s):  
Ari Moesriami Barmawi ◽  
Deden Pradeka
Keyword(s):  
Information Hiding ◽  
Information Exchange ◽  
High Capacity ◽  
Cover Image ◽  
Secret Message ◽  
Embedding Capacity ◽  
Stego Image ◽  
Image Histogram ◽  
Pixel Value ◽  
Value Changes

Recently, information exchange using internet is increasing, such that information security is necessary for securing confidential information because it is possible to eavesdrop the information. There are several methods for securing the exchanged information such as was proposed by Rejani et al. Rejani’s method can be noiseless in low capacity but noisy in high capacity. In the case of high capacity, it will raise suspicion. This research proposed a method based on histogram and pixel pattern for keeping the stego image noiseless while still keeping the capacity high. Secret information can be embedded into the cover by evaluating the histogram and map the characters used in the secret message to the consecutive intensity in the cover image histogram. The map of the characters is sent to the recipient securely. Using the proposed method there is no pixel value changes during the embedding process. Based on the result of the experiments, it is shown that in noiseless condition, the proposed method has higher embedding capacity than Rejani’s especially when using cover image with sizes larger than 128 × 128. Thus, in noiseless condition the embedding capacity using the proposed method is higher than Rejani’s method in noiseless condition.  

scholarly journals A Hybrid Method for Payload Enhancement in Image Steganography Based on Edge Area Detection

2021 ◽  
Vol 21 (3) ◽  
pp. 97-107
Author(s):  
Nadia A. Mohsin ◽  
Huda A. Alameen
Keyword(s):  
Hybrid Method ◽  
Binary Operation ◽  
Secret Message ◽  
Embedding Capacity ◽  
Least Significant Bit ◽  
Stego Image ◽  
New Approach ◽  
Detection Techniques ◽  
Prewitt Edge Detection

Abstract In this research a new method for increasing the embedding capacity in images based on the edge area is proposed. The new approach combines Canny and Prewitt edge detection techniques using OR binary operation. The secret message is concealed using the Least Significant Bit (LSB) method. Embedding capacity, PSNR, SSIM, and MSE values are used as evaluation metrics. Based on the resulted values, the proposed method showed higher embedding capacity while keeping the PSNR, SSIM, MSE values without major changes of other methods which means keeping the imperceptibility quality of the stego image.

Sign in / Sign up

Export Citation Format

Share Document