Search arXivSearch

arXiv · 2312.04593

Cluster Shift Keying: Covert Transmission of Information via Cluster Synchronization in Chaotic Networks

Abstract

A network of chaotic systems can be designed in such a way that the cluster patterns formed by synchronous nodes can be controlled through the coupling parameters. We present a novel approach to exploit such a network for covert communication purposes, where controlled clusters encode the symbols spatio-temporally. The cluster synchronization network is divided into two subnetworks as transmitter and receiver. First, we specifically design the network whose controlled parameters reside in the transmitter. Second, we ensure that the nodes of the links connecting the transmitter and receiver are not in the same clusters for all the control parameters. The former condition ensures that the control parameters changed at the transmitter change the whole clustering scheme. The second condition enforces the transmitted signals are always continuous and chaotic. Hence, the transmitted signals are not modulated by the information directly, but distributed over the links connecting the subnetworks. The information cannot be deciphered by eavesdropping on the channel links without knowing the network topology. The performance has been assessed by extensive simulations of bit error rates under noisy channel conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zekeriya Sarı, Serkan Günel. 2023-12-05. Cluster Shift Keying: Covert Transmission of Information via Cluster Synchronization in Chaotic Networks. https://arxiv.org/abs/2312.04593

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT