Related papers: The Cut and Dominating Set Problem in A Steganogra…
Image segmentation is a fundamental task in image analysis and clinical practice. The current state-of-the-art techniques are based on U-shape type encoder-decoder networks with skip connections, called U-Net. Despite the powerful…
Steganography embraces several hiding techniques which spawn across multiple domains. However, the related terminology is not unified among the different domains, such as digital media steganography, text steganography, cyber-physical…
Network visualization is essential for many scientific, societal, technological and artistic domains. The primary goal is to highlight patterns out of nodes interconnected by edges that are easy to understand, facilitate communication and…
A fundamental problem in mathematics and network analysis is to find conditions under which a graph can be partitioned into smaller pieces. The most important tool for this partitioning is the Fiedler vector or discrete Cheeger inequality.…
We consider the problem of performing community detection on a network, while maintaining privacy, assuming that the adversary has access to an auxiliary correlated network. We ask the question "Does there exist a regime where the network…
Quantum steganography is the study of hiding secret quantum information by encoding it into what an eavesdropper would perceive as an innocent-looking message. Here we study an explicit steganographic encoding for a sender, Alice, to hide a…
We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The…
In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting…
A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s-t max-flow problem. Several algorithms for the min-cut problem are…
We consider the distributed weight balancing problem in networks of nodes that are interconnected via directed edges, each of which is able to admit a positive integer weight within a certain interval, captured by individual lower and upper…
This paper presents experimental results of the implementation of network steganography method called RSTEG (Retransmission Steganography). The main idea of RSTEG is to not acknowledge a successfully received packet to intentionally invoke…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
The art of information hiding has been around nearly as long as the need for covert communication. Steganography, the concealing of information, arose early on as an extremely useful method for covert information transmission. Steganography…
Steganography refers to the art of concealing secret messages within multiple media carriers so that an eavesdropper is unable to detect the presence and content of the hidden messages. In this paper, we firstly propose a novel…
Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of…
The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the largest disruption? More formally, given a graph, which…
Steganography usually modifies cover media to embed secret data. A new steganographic approach called generative steganography (GS) has emerged recently, in which stego images (images containing secret data) are generated from secret data…
Steganography is the process of hiding secret information by embedding it in an "innocent" message. We present protocols for hiding quantum information in a codeword of a quantum error-correcting code passing through a channel. Using either…
In this work, we mainly study the mechanism of learning the steganographic algorithm as well as combining the learning process with adversarial learning to learn a good steganographic algorithm. To handle the problem of embedding secret…
In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set MTDS) problem which have many applications in real world. We propose a new idea to compute approximate MDS and MTDS. Next, we give an…