DYST (Did You See That?): An Amplified Covert Channel That Points To Previously Seen Data

• URL: http://arxiv.org/abs/2212.11850v4
• Date: Fri, 7 Jun 2024 15:00:48 GMT
• Title: DYST (Did You See That?): An Amplified Covert Channel That Points To Previously Seen Data
• Authors: Steffen Wendzel, Tobias Schmidbauer, Sebastian Zillien, Jörg Keller,
• Abstract summary: We introduce a new class of covert channels that we call history covert channels. History covert channels can communicate by pointing to unaltered legitimate traffic created by regular network nodes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Covert channels are stealthy communication channels that enable manifold adversary and legitimate scenarios, ranging from malware communications to the exchange of confidential information by journalists and censorship circumvention. We introduce a new class of covert channels that we call history covert channels. We further present a new paradigm: covert channel amplification. All covert channels described until now need to craft seemingly legitimate flows or need to modify third-party flows, mimicking unsuspicious behavior. In contrast, history covert channels can communicate by pointing to unaltered legitimate traffic created by regular network nodes. Only a negligible fraction of the covert communication process requires the transfer of covert information by the covert channel's sender. This information can be sent through different protocols/channels. Our approach allows an amplification of the covert channel's message size, i.e., minimizing the fraction of actually transferred secret data by a covert channel's sender in relation to the overall secret data being exchanged. Further, we extend the current taxonomy for covert channels to show how history channels can be categorized. We describe multiple scenarios in which history covert channels can be realized, analyze the characteristics of these channels, and show how their configuration can be optimized.

Related papers

• Distilling Channels for Efficient Deep Tracking [68.13422829310835]
  This paper presents a novel framework termed channel distillation to facilitate deep trackers. We show that an integrated formulation can turn feature compression, response map generation, and model update into a unified energy minimization problem. The resulting deep tracker is accurate, fast, and has low memory requirements.
  arXiv  Detail & Related papers  (2024-09-18T08:09:20Z)
• Security for adversarial wiretap channels [4.383205675898942]
  We analyze information-theoretically secure coding schemes which use the inverse of an extractor and an error-correcting code. We show that this also holds for certain channel types with memory.
  arXiv  Detail & Related papers  (2024-04-02T09:22:40Z)
• ABC-Channel: An Advanced Blockchain-based Covert Channel [19.925437637883917]
  We make the first effort to achieve a full-lifecycle covert channel, a novel blockchain-based covert channel named ABC-Channel. We tackle a series of challenges, such as off-chain contact dependency, increased masquerading difficulties as growing transaction volume. We develop a working prototype to validate ABC-Channel and conduct extensive tests on the Bitcoin testnet.
  arXiv  Detail & Related papers  (2024-03-10T16:57:53Z)
• Experimental Communication Through Superposition of Quantum Channels [0.0]
  Coherently controlling channels necessitates a non-trivial expansion of the channel description. We show that the expanded qutrit channel description in itself is sufficient to explain the capacity enhancement without any use of superposition.
  arXiv  Detail & Related papers  (2023-02-28T18:18:10Z)
• Age of Information in Deep Learning-Driven Task-Oriented Communications [78.84264189471936]
  This paper studies the notion of age in task-oriented communications that aims to execute a task at a receiver utilizing the data at its transmitter. The transmitter-receiver operations are modeled as an encoder-decoder pair of deep neural networks (DNNs) that are jointly trained.
  arXiv  Detail & Related papers  (2023-01-11T04:15:51Z)
• Uncovering the Dark Side of Telegram: Fakes, Clones, Scams, and Conspiracy Movements [67.39353554498636]
  We perform a large-scale analysis of Telegram by collecting 35,382 different channels and over 130,000,000 messages. We find some of the infamous activities also present on privacy-preserving services of the Dark Web, such as carding. We propose a machine learning model that is able to identify fake channels with an accuracy of 86%.
  arXiv  Detail & Related papers  (2021-11-26T14:53:31Z)
• Privacy-Aware Communication Over the Wiretap Channel with Generative Networks [34.6578234382717]
  We study privacy-aware communication over a wiretap channel using end-to-end learning. We propose a data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC)
  arXiv  Detail & Related papers  (2021-10-08T12:47:24Z)
• Noisy Channel Language Model Prompting for Few-Shot Text Classification [87.23056864536613]
  We introduce a noisy channel approach for language model prompting in few-shot text classification. Instead of computing the likelihood of the label given the input, channel models compute the conditional probability of the input given the label. We use channel models for recently proposed few-shot learning methods with no or very limited updates to the language model parameters.
  arXiv  Detail & Related papers  (2021-08-09T15:06:26Z)
• Channel-wise Knowledge Distillation for Dense Prediction [73.99057249472735]
  We propose to align features channel-wise between the student and teacher networks. We consistently achieve superior performance on three benchmarks with various network structures.
  arXiv  Detail & Related papers  (2020-11-26T12:00:38Z)
• Channel Leakage, Information-Theoretic Limitations of Obfuscation, and Optimal Privacy Mask Design for Streaming Data [23.249999313567624]
  We first introduce the notion of channel leakage as the minimum mutual information between the channel input and channel output. In a broad sense, it can be viewed as a dual concept of channel capacity, which characterizes the maximum information transmission to the targeted receiver. We then utilize this notion to investigate the fundamental limitations of obfuscation in terms of privacy-distortion tradeoffs.
  arXiv  Detail & Related papers  (2020-08-11T17:55:47Z)
• Video-based Person Re-Identification using Gated Convolutional Recurrent Neural Networks [89.70701173600742]
  In this paper, we introduce a novel gating mechanism to deep neural networks. Our gating mechanism will learn which regions are helpful for person re-identification and let these regions pass the gate. Experimental results on two major datasets demonstrate the performance improvements due to the proposed gating mechanism.
  arXiv  Detail & Related papers  (2020-03-21T18:15:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.