English
Related papers

Related papers: Protocol-independent Detection of "Messaging Order…

200 papers

We study message identification over a q-ary uniform permutation channel, where the transmitted vector is permuted by a permutation chosen uniformly at random. For discrete memoryless channels(DMCs), the number of identifiable messages…

Information Theory · Computer Science 2024-09-23 Abhishek Sarkar , Bikash Kumar Dey

This paper considers the problem of covert communication with mismatched decoding, in which a sender wishes to reliably communicate with a receiver whose decoder is fixed and possibly sub-optimal, and simultaneously to ensure that the…

Information Theory · Computer Science 2021-11-11 Qiaosheng Zhang , Vincent Y. F. Tan

Full-packet encryption is a technique used by modern evasive Virtual Private Networks (VPNs) to avoid protocol-based flagging from censorship models by disguising their traffic as random noise on the network. Traditional methods for…

Cryptography and Security · Computer Science 2025-01-08 Amy Iris Parker

We consider the on-time transmissions of a sequence of packets over a fading channel.Different from traditional in-time communications, we investigate how many packets can be received $\delta$-on-time, meaning that the packet is received…

Information Theory · Computer Science 2022-02-18 Yan Li , Yunquan Dong , Byonghyo Shim

We use the term protocol coding to denote the communication strategies in which information is encoded through the actions taken by a certain communication protocol. In this work we investigate strategies for protocol coding via…

Information Theory · Computer Science 2012-02-03 Petar Popovski , Zoran Utkovski , Kasper F. Trillingsgaard

The design and analysis of communication systems typically rely on the development of mathematical models that describe the underlying communication channel, which dictates the relationship between the transmitted and the received signals.…

Machine Learning · Computer Science 2017-08-01 Nariman Farsad , Andrea Goldsmith

This paper studies noisy index coding problems over single-input single-output broadcast channels. The codewords from a chosen index code of length $N$ are transmitted after $2^N$-PSK modulation over an AWGN channel. In "Index Coded PSK…

Information Theory · Computer Science 2023-05-23 Navya Saxena , Anjana A. Mahesh , B. Sundar Rajan

We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'.…

Information Theory · Computer Science 2013-05-08 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi , Rodney Kennedy

Covert channels are communication channels used by attackers to transmit information from a compromised system when the access control policy of the system does not allow doing so. Previous work has shown that CPU frequency scaling can be…

Cryptography and Security · Computer Science 2020-07-15 Manuel Kalmbach , Mathias Gottschlag , Tim Schmidt , Frank Bellosa

Covert communication offers a method to transmit messages in such a way that it is not possible to detect that the communication is happening at all. In this work, we report an experimental demonstration of covert communication that is…

We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…

Information Theory · Computer Science 2009-03-26 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

Packing is an obfuscation technique widely used by malware to hide the content and behavior of a program. Much prior research has explored how to detect whether a program is packed. This research includes a broad variety of approaches such…

Cryptography and Security · Computer Science 2021-05-04 Charles-Henry Bertrand Van Ouytsel , Thomas Given-Wilson , Jeremy Minet , Julian Roussieau , Axel Legay

In this paper, we propose a MIMO receiver algorithm that exploits {\em channel hardening} that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the ${\bf H}^H{\bf H}$ matrix become…

Information Theory · Computer Science 2014-01-13 T. Lakshmi Narasimhan , A. Chockalingam

Covert channel attacks represent a significant threat to system security, leveraging shared resources to clandestinely transmit information from highly secure systems, thereby violating the system's security policies. These attacks exploit…

Cryptography and Security · Computer Science 2024-04-10 Shariful Alam , Jidong Xiao , Nasir U. Eisty

This paper considers the covert identification problem in which a sender aims to reliably convey an identification (ID) message to a set of receivers via a binary-input discrete memoryless channel (BDMC), and simultaneously to guarantee…

Information Theory · Computer Science 2021-06-04 Qiaosheng Zhang , Vincent Y. F. Tan

Anomaly detection (such as telecom fraud detection and medical image detection) has attracted the increasing attention of people. The complex interaction between multiple entities widely exists in the network, which can reflect specific…

Machine Learning · Computer Science 2024-06-10 Xu Yuan , Na Zhou , Shuo Yu , Huafei Huang , Zhikui Chen , Feng Xia

Nowadays, IoT devices have been widely deployed for enabling various smart services, such as, smart home or e-healthcare. However, security remains as one of the paramount concern as many IoT devices are vulnerable. Moreover, IoT malware…

Cryptography and Security · Computer Science 2019-12-30 Mustafizur Rahman Shahid , Gregory Blanc , Zonghua Zhang , Hervé Debar

We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite…

Quantum Physics · Physics 2013-11-13 C. Macchiavello , M. Rossi

We study message identification over the noisy permutation channel. For discrete memoryless channels (DMCs), the number of identifiable messages grows doubly exponentially, and the maximum second-order exponent is same as the Shannon…

Information Theory · Computer Science 2025-06-18 Abhishek Sarkar , Bikash Kumar Dey

Due to the vital role of security in online communications and this fact that attackers are developing their tools, modernizing the security tools is an essential. The efficiency of crypto systems has been proven after years, however one…

Cryptography and Security · Computer Science 2020-04-01 Mahboubeh Nazari , Sousan Tarahomi , Sobhan Aliabady