scholarly journals A Novel Approach Covert Channel for Secret Communications

2014 ◽  
Vol 14 (2) ◽  
pp. 5479-5486
Author(s):  
Ali Hussein Hadi
Keyword(s):  
Social Network ◽  
Public Service ◽  
Communication Channel ◽  
Secret Message ◽  
Covert Channel ◽  
Covert Communication ◽  
Application Layer ◽  
Video Frames ◽  
Novel Approach ◽  
Two Phases

This paper presents a novel covert channel for secret communications. It implements a new application layer covert channel, by applying multimedia steganography techniques to hide secret messages. This new channel method (called Under Your Radar (UYR)) provides a stealthiness method for the communication channel and an efficient method for hiding messages, as proved by our investigations. Such a covert channel will be used for transferring secret messages in two phases. In phase one, the message characters will be embedded randomly into the pixels of video frames. The choice of pixels is dependent on finding an identical value of the character ASCII representation from one of the pixel channels. The positions of pixels will form the steganography key, which will be used later to extract the message. Also, the steganography key will be embedded in an image using the LSB steganography technique. In phase two, the secret message will be exchanged between the sender and the receiver by sharing the video along with the steganography key over a public service (e.g.  a social network), which serves as the new covert communication channel. The experiments outcomes have showed an improvement on the success of the proposed covert channel in exchanging secret messages without rising suspicion by observers or detection tools.

scholarly journals A Novel Approach for Arabic Text Steganography Based on the “BloodGroup” Text Hiding Method

2017 ◽  
Vol 7 (2) ◽  
pp. 1482-1485
Author(s):  
S. Malalla ◽  
F. R. Shareef
Keyword(s):  
Blood Group ◽  
Time Complexity ◽  
Third Party ◽  
Secret Message ◽  
Covert Communication ◽  
Arabic Text ◽  
Hiding Capacity ◽  
Novel Approach ◽  
Text Steganography

Steganography is the science of hiding certain messages (data) in groups of irrelevant data possibly of other form. The purpose of steganography is covert communication to hide the existence of a message from an intermediary. Text Steganography is the process of embedding secret message (text) in another text (cover text) so that the existence of secret message cannot be detected by a third party. This paper presents a novel approach for text steganography using the Blood Group (BG) method based on the behavior of blood group. Experimentally it is found that the proposed method got good results in capacity, hiding capacity, time complexity, robustness, visibility, and similarity which shows its superiority as compared to most several existing methods.

scholarly journals Merge and Split approach incolor image Steganography using Run Length Encoding and LSB Techniques

2020 ◽  
Vol 22 (12) ◽  
Author(s):  
Rajput G ◽  
◽  
Ramesh Chavan ◽  
Keyword(s):  
Communication Channel ◽  
Third Parties ◽  
Color Images ◽  
Audio Signals ◽  
Multiple Images ◽  
Run Length ◽  
Video Frames ◽  
Novel Approach ◽  
Other Information ◽  
And Performance

The purpose of steganography is to communicate secret messages between the sender and intended recipient in such a way that no one suspects the very existence of the message. The techniques aim to protect the secret information from third parties by embedding them into other information such as text, audio signals, images, and video frames. In this paper we propose a novel approach of hiding secret messages in multiple images (a cover image)using run length encoding and LSB techniques and communicate the message to intended person over the communication channel by transmitting individual images.Experiments are performed on a set of color images and performance of the proposed system is presented.

scholarly journals Distributed data hiding in multi-cloud storage environment

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
Leonel Moyou Metcheka ◽  
René Ndoundam
Keyword(s):  
Cloud Storage ◽  
Network Protocols ◽  
Secret Message ◽  
Covert Channel ◽  
Distributed Data ◽  
Comparison Results ◽  
Major Interest ◽  
Cloud Storage Environment ◽  
Audio Video ◽  
Multi Cloud

AbstractClassical or traditional steganography aims at hiding a secret in cover media such as text, image, audio, video or even in network protocols. Recent research has improved this approach called distributed steganography by fragmenting the secret message and embedding each secret piece into a distinct cover media. The major interest of this approach is to make the secret message detection extremely difficult. However, these file modifications leave fingerprints which can reveal a secret channel to an attacker. Our contribution is a new steganography paradigm transparent to any attacker and resistant to the detection and the secret extraction. Two properties contribute to achieve these goals: the files do not undergo any modification while the distribution of the secret in the multi-cloud storage environment allows us to hide the existence of the covert channel between the communicating parties. Information’s are usually hidden inside the cover media. In this work, the covert media is a pointer to information. Therefore the file carries the information without being modified and the only way to access it is to have the key. Experiments show interesting comparison results with remarkable security contributions. The work can be seen as a new open direction for further research in the field.

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

scholarly journals Cognitive Covert Traffic Synthesis Method Based on Generative Adversarial Network

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Zhangguo Tang ◽  
Junfeng Wang ◽  
Huanzhou Li ◽  
Jian Zhang ◽  
Junhao Wang
Keyword(s):  
Loss Function ◽  
Learning Algorithm ◽  
Synthesis Method ◽  
Covert Channel ◽  
Covert Communication ◽  
New Paradigm ◽  
Generative Adversarial Network ◽  
Good Convergence ◽  
Adversarial Network ◽  
Activity Loss

In the intelligent era of human-computer symbiosis, the use of machine learning method for covert communication confrontation has become a hot topic of network security. The existing covert communication technology focuses on the statistical abnormality of traffic behavior and does not consider the sensory abnormality of security censors, so it faces the core problem of lack of cognitive ability. In order to further improve the concealment of communication, a game method of “cognitive deception” is proposed, which is aimed at eliminating the anomaly of traffic in both behavioral and cognitive dimensions. Accordingly, a Wasserstein Generative Adversarial Network of Covert Channel (WCCGAN) model is established. The model uses the constraint sampling of cognitive priors to construct the constraint mechanism of “functional equivalence” and “cognitive equivalence” and is trained by a dynamic strategy updating learning algorithm. Among them, the generative module adopts joint expression learning which integrates network protocol knowledge to improve the expressiveness and discriminability of traffic cognitive features. The equivalent module guides the discriminant module to learn the pragmatic relevance features through the activity loss function of traffic and the application loss function of protocol for end-to-end training. The experimental results show that WCCGAN can directly synthesize traffic with comprehensive concealment ability, and its behavior concealment and cognitive deception are as high as 86.2% and 96.7%, respectively. Moreover, the model has good convergence and generalization ability and does not depend on specific assumptions and specific covert algorithms, which realizes a new paradigm of cognitive game in covert communication.

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 Video steganography based on DCT psychovisual and object motion

2020 ◽  
Vol 9 (3) ◽  
pp. 1015-1023 ◽  
Author(s):  
Muhammad Fuad ◽  
Ferda Ernawan
Keyword(s):  
Video Quality ◽  
Object Motion ◽  
Multimedia Data ◽  
Secret Message ◽  
Hiding Capacity ◽  
Video Steganography ◽  
Limited Bandwidth ◽  
Video Frames ◽  
Dct Coefficients ◽  
Video Reconstruction

Steganography is a technique of concealing the message in multimedia data. Multimedia data, such as videos are often compressed to reduce the storage for limited bandwidth. The video provides additional hidden-space in the object motion of image sequences. This research proposes a video steganography scheme based on object motion and DCT-psychovisual for concealing the message. The proposed hiding technique embeds a secret message along the object motion of the video frames. Motion analysis is used to determine the embedding regions. The proposed scheme selects six DCT coefficients in the middle frequency using DCT-psychovisual effects of hiding messages. A message is embedded by modifying middle DCT coefficients using the proposed algorithm. The middle frequencies have a large hiding capacity and it relatively does not give significant effect to the video reconstruction. The performance of the proposed video steganography is evaluated in terms of video quality and robustness against MPEG compression. The experimental results produce minimum distortion of the video quality. Our scheme produces a robust of hiding messages against MPEG-4 compression with average NC value of 0.94. The proposed video steganography achieves less perceptual distortion to human eyes and it's resistant against reducing video storage.

scholarly journals Application Layer Packet Processing Using PISA Switches

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 8010
Author(s):  
Ismail Butun ◽  
Yusuf Tuncel ◽  
Kasim Oztoprak
Keyword(s):  
Streaming Data ◽  
The Novel ◽  
Application Layer ◽  
Domain Specific ◽  
Switch Architecture ◽  
Novel Approach ◽  
Data Processor ◽  
Application Identification ◽  
The Cost ◽  
Telecommunication Operators

This paper investigates and proposes a solution for Protocol Independent Switch Architecture (PISA) to process application layer data, enabling the inspection of application content. PISA is a novel approach in networking where the switch does not run any embedded binary code but rather an interpreted code written in a domain-specific language. The main motivation behind this approach is that telecommunication operators do not want to be locked in by a vendor for any type of networking equipment, develop their own networking code in a hardware environment that is not governed by a single equipment manufacturer. This approach also eases the modeling of equipment in a simulation environment as all of the components of a hardware switch run the same compatible code in a software modeled switch. The novel techniques in this paper exploit the main functions of a programmable switch and combine the streaming data processor to create the desired effect from a telecommunication operator perspective to lower the costs and govern the network in a comprehensive manner. The results indicate that the proposed solution using PISA switches enables application visibility in an outstanding performance. This ability helps the operators to remove a fundamental gap between flexibility and scalability by making the best use of limited compute resources in application identification and the response to them. The experimental study indicates that, without any optimization, the proposed solution increases the performance of application identification systems 5.5 to 47.0 times. This study promises that DPI, NGFW (Next-Generation Firewall), and such application layer systems which have quite high costs per unit traffic volume and could not scale to a Tbps level, can be combined with PISA to overcome the cost and scalability issues.

A method of hidden messages embedding in graphlike structures of a social network

2018 ◽  
Author(s):  
И.В. Нечта
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Main Idea ◽  
The Other ◽  
Secret Message ◽  
Automatic Registration ◽  
Connected Component ◽  
Single Node ◽  
Empty Container ◽  
First Time

Предложен новый метод передачи скрытых сообщений в социальных сетях на примере сети “Вконтакте”, позволяющий через структуру графа друзей пользователя внедрять секретные сообщения. Получены количественные оценки объема внедряемого сообщения в графы различного размера. Показана необходимость добавления избыточности во внедряемое сообщение. Представленный метод позволяет использовать другие графоподобные структуры социальной сети для внедрения скрытых сообщений. Purpose. This article addresses the construction of a new method for transmission of hidden messages in social networks. Methodology. The research employs methods of information theory, probability theory and mathematical statistics The Shannon entropy is used as the statistics for the analysis of an embedded message. Findings. The author proposed using the graphical structures of social networks as a container for the secret message transmission for the first time. As an example, the popular Vkontakte network is considered. The main idea of the method involves using the structure of the user’s friends graph to embed a secret message. Based on the available vertices (friends’ accounts), a complete graph is constructed, and its edges are enumerated. Each edge of the graph corresponds to one bit of the message being embedded: the bit is “1”, if the edge is present in the graph (one account in friends of the other), the bit is “0” if the edge is missing. To transfer the graph from one person to another, a key vertex is used. The specified vertex is connected by an edge with each connected component of the graph, which allows the graph to be transmitted using a single node and take into account all the vertices (including isolated ones). When retrieving a message, the key vertex and the edges connected to it are not considered. Conclusions. During the experimental research, it was shown that messages extracted from an empty container differ from the encrypted message by the probability distribution of bits. The necessity of adding redundancy to transmitted secret messages is shown with the purpose of “leveling” the statistical properties of an empty and filled container. The results of the experiment have showed that this method of steganography allows embedding a large amount of information into various social network structures represented in the form of a graph. It was noted in the paper that potentially “narrow” place of the algorithm is registration of new accounts. The restrictions imposed by the administration of some social networks for security purposes do not always allow automatic registration of new accounts, which makes the process of message embedding more difficult.

Aspects of Various Community Detection Algorithms in Social Network Analysis

2019 ◽  
pp. 327-341
Author(s):  
Nicole Belinda Dillen ◽  
Aruna Chakraborty
Keyword(s):  
Social Network ◽  
Social Network Analysis ◽  
Network Analysis ◽  
Community Detection ◽  
Overlapping Community Detection ◽  
Detection Algorithms ◽  
Novel Approach ◽  
Recent Developments ◽  
Overlapping Community ◽  
Related Individuals

One of the most important aspects of social network analysis is community detection, which is used to categorize related individuals in a social network into groups or communities. The approach is quite similar to graph partitioning, and in fact, most detection algorithms rely on concepts from graph theory and sociology. The aim of this chapter is to aid a novice in the field of community detection by providing a wider perspective on some of the different detection algorithms available, including the more recent developments in this field. Five popular algorithms have been studied and explained, and a recent novel approach that was proposed by the authors has also been included. The chapter concludes by highlighting areas suitable for further research, specifically targeting overlapping community detection algorithms.

Sign in / Sign up

Export Citation Format

Share Document