English
Related papers

Related papers: Optimal whitespace synchronization strategies

200 papers

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and…

Information Theory · Computer Science 2011-10-04 Aly El Gamal , O. Ozan Koyluoglu , Moustafa Youssef , Hesham El Gamal

Wireless secret sharing is crucial to information security in the era of Internet of Things. One method is to utilize the effect of the randomness of the wireless channel in the data link layer to generate the common secret between two…

Networking and Internet Architecture · Computer Science 2021-01-28 Lei Miao , Dingde Jiang

Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a…

Cryptography and Security · Computer Science 2020-01-22 Ke Li , Don Towsley , Dennis Goeckel

Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and…

Information Theory · Computer Science 2021-06-25 Qiaosheng Zhang , Mayank Bakshi , Sidharth Jaggi

Security and privacy are major concerns in modern communication networks. In recent years, the information theory of covert communications, where the very presence of the communication is undetectable to a watchful and determined adversary,…

Information Theory · Computer Science 2017-11-29 Ramin Soltani , Dennis Goeckel , Don Towsley , Amir Houmansadr

A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening…

Information Theory · Computer Science 2016-07-12 Pak Hou Che , Mayank Bakshi , Sidharth Jaggi

Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state $\rho_{ABE}$, such that Alice possesses the $A$ systems and Bob…

Quantum Physics · Physics 2020-02-12 Kunal Sharma , Eyuri Wakakuwa , Mark M. Wilde

Two legitimate parties, referred to as Alice and Bob, wish to generate secret keys from the wireless channel in the presence of an eavesdropper, referred to as Eve, in order to use such keys for encryption and decryption. In general, the…

Information Theory · Computer Science 2020-02-19 Nasser Aldaghri , Hessam Mahdavifar

Hiding the wireless communication by transmitter Alice to intended receiver Bob from a capable and attentive adversary Willie has been widely studied under the moniker "covert communications". However, when such covert communication is done…

Cryptography and Security · Computer Science 2023-07-18 Ali Mohammadi Teshnizi , Majid Ghaderi , Dennis Goeckel

We propose the problem of wiretapped commitment, where two parties, say committer Alice and receiver Bob, engage in a commitment protocol using a noisy channel as a resource, in the presence of an eavesdropper, say Eve. Noisy versions of…

Information Theory · Computer Science 2024-06-21 Anuj Kumar Yadav , Manideep Mamindlapally , Amitalok J. Budkuley

Inspired from quantum key distribution, we consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise…

Information Theory · Computer Science 2024-09-10 Masahito Hayashi

We study scenarios which arise when two spatially-separated observers, Alice and Bob, are try to identify a quantum state sampled from several possibilities. In particular, we examine their strategies for maximizing both the probability of…

Quantum Physics · Physics 2022-01-27 Andrey Boris Khesin , Peter Shor

Covert communication, also known as low probability of detection (LPD) communication, prevents the adversary from knowing that a communication is taking place. Recent work has demonstrated that, in a three-party scenario with a transmitter…

Information Theory · Computer Science 2017-11-29 Ramin Soltani , Boulat Bash , Dennis Goeckel , Saikat Guha , Don Towsley

In this paper, we study the problem of the 1-of-2 string oblivious transfer (OT) between Alice and Bob in the presence of a passive eavesdropper Eve. The eavesdropper Eve is not allowed to get any information about the private data of Alice…

Information Theory · Computer Science 2022-09-07 Tianyou Pei , Wei Kang , Nan Liu

This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling…

Information Theory · Computer Science 2009-08-27 Aly El Gamal , Moustafa Youssef , Hesham El Gamal

We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal…

Information Theory · Computer Science 2018-07-18 Linda Senigagliesi , Marco Baldi , Stefano Tomasin

A non-regenerative dual-hop wireless system based on a distributed space-time coding strategy is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of…

Information Theory · Computer Science 2016-11-18 Jamshid Abouei , Hossein Bagheri , Amir K. Khandani

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

Covert communication can prevent the adversary from knowing that a wireless transmission has occurred. In the additive white Gaussian noise channels, a square root law is obtained and the result shows that Alice can reliably and covertly…

Information Theory · Computer Science 2018-03-12 Zhihong Liu , Jiajia Liu , Yong Zeng , Li Yang , Jianfeng Ma

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead…

Networking and Internet Architecture · Computer Science 2019-11-12 Mehmet Karaca , Tansu Alpcan , Ozgur Ercetin
‹ Prev 1 2 3 10 Next ›