• Home
  • Search
  • Causal Adversarial Channels With Feedback Snooping
  • Cite Icon6
  • https://doi.org/10.1109/jsait.2022.3158230Copy DOI Icon

Causal Adversarial Channels With Feedback Snooping

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

With the advent of 5G and technologies such as cloud computing, Internet-of-Things (IoT), etc, future communication networks will consist of a large number of heterogeneous devices connected together. A critical aspect will be ensuring that communication is not only fast and reliable, but also resilient to malicious attack. As networks increasingly adopt zero-trust principles in their security frameworks, it is important to consider such attacks from a zero-trust perspective. Motivated by this, we consider the problem of communicating a message reliably across a binary erasure channel (BEC(<inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>)) or a binary symmetric channel (BSC(<inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>)) against an adversary actively injecting additional erasures or flips at the channel&#x2019;s input. The adversary can corrupt up to a fraction <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> of the transmitted bits and knows the transmission scheme agreed upon by the communicating terminals. Further, he has the capability to causally snoop in on both the transmitter and the receiver in real time, i.e., if <inline-formula> <tex-math notation="LaTeX">${\mathbf {x}}=(x_{1},x_{2},\ldots, x_{n})$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">${\mathbf {y}}=(y_{1},y_{2},\ldots, y_{n})$ </tex-math></inline-formula> denote the transmitted and the received codewords respectively, at each time <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>, he knows <inline-formula> <tex-math notation="LaTeX">$(x_{1},x_{2},\ldots, x_{k})$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$(y_{1},y_{2},\ldots, y_{k-1})$ </tex-math></inline-formula>. Using his side-information, the adversary is free to employ any attack that respects his constraint on the number of corruptible bits. We prove an information-theoretic tight capacity characterization as a function of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> for (i) the erasure adversary with a BEC(<inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>) and (ii) the bit-flip adversary with a BSC(<inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>). A unique feature of our models is the compounding of stochastic and adversarial noise sources. Our analysis reveals the worst-case adversarial attacks for both models and proves the existence of coding schemes that achieve rates equal to the capacity for any adversarial attack. In the case of bit-flips, we show that, interestingly, when <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> is below a certain threshold (that depends on <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>), the adversary is no worse than an i.i.d. memory-less noise source.

Similar Papers
  • Conference Article
  • Citations1

Internet of Things Security: We're Walking on Eggshells!

  • Jan 01, 2016
  • Aref Meddeb
  • Conference Article
  • Citations5

Bit-wise Sequential Coding with Feedback

  • Jun 01, 2018
  • Sung-En Chiu +2
  • Research Article
  • Citations13

Adversarial robust image processing in medical digital twin

  • Oct 11, 2024
  • Information Fusion
  • Samaneh Shamshiri +2
  • Conference Article
  • Citations10

A Survey on Security Issues and Secure Frameworks in Internet of Things (IoT)

  • Jan 20, 2022
  • Nilima Dongre +3
  • Book Chapter
  • Citations19

Secure Framework for Data Security in Cloud Computing

  • Nov 25, 2017
  • Nishit Mishra +3
  • PDF
  • Research Article
  • Citations55

A Holistic Review of Machine Learning Adversarial Attacks in IoT Networks

  • Jan 19, 2024
  • Future Internet
  • Hassan Khazane +3
  • Research Article
  • Citations61

A walkthrough of the emerging IoT paradigm: Visualizing inside functionalities, key features, and open issues

  • Jul 03, 2019
  • Journal of Network and Computer Applications
  • Abhishek Singh +2
  • Research Article
  • Citations173

On the interplay of Internet of Things and Cloud Computing: A systematic mapping study

  • Mar 21, 2016
  • Computer Communications
  • Everton Cavalcante +7
  • Conference Article
  • Citations11

Bounds on information combining for parity-check equations

  • Aug 24, 2004
  • I Land +2
  • Research Article
  • Citations34

Simulation of a Channel with Another Channel

  • Jan 01, 2016
  • IEEE Transactions on Information Theory
  • Farzin Haddadpour +4
  • Research Article
  • Citations9

Tree-Structured Expectation Propagation for LDPC Decoding over BMS Channels

  • Oct 01, 2013
  • IEEE Transactions on Communications
  • Luis Salamanca +3
  • Book Chapter
  • Citations3

Investigation of Wireless Sensor Network of the Internet of Things

  • Jan 01, 2019
  • Yibin Hou +1
  • Research Article

Edge, fog, and cloud computing in IoT-Significance and security concerns

  • Jan 01, 2023
  • i-manager’s Journal on Cloud Computing
  • Ahmad Kouchay Shouket
  • Research Article
  • Citations89

Internet of things intrusion detection model and algorithm based on cloud computing and multi-feature extraction extreme learning machine

  • Oct 05, 2022
  • Digital Communications and Networks
  • Haifeng Lin +3
  • Book Chapter

IoT in Healthcare: Using Cloud Computing and Natural Language Processing for a Superior Approach

  • Jan 01, 2022
  • Venkata Rao Dhulipalla +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.