English
Related papers

Related papers: Noisy Feedback and Loss Unlimited Private Communic…

200 papers

Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting,…

Quantum Physics · Physics 2025-03-06 Francesco Anna Mele , Giovanni Barbarino , Vittorio Giovannetti , Marco Fanizza

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if…

Quantum Physics · Physics 2011-07-19 Nicolas J. Cerf

We consider the bosonic compound wiretap channel. A pair of lossy channels connects a sender with both a (legitimate) receiver and an eavesdropper. The sender and receiver have only partial information about the actual state of the…

Quantum Physics · Physics 2025-04-30 Florian Seitz , Janis Nötzel

The security of two-state quantum key distribution against individual attack is estimated when the channel has losses and noises. We assume that Alice and Bob use two nonorthogonal single-photon polarization states. To make our analysis…

Quantum Physics · Physics 2009-11-07 Kiyoshi Tamaki , Masato Koashi , Nobuyuki Imoto

We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the maximum latency and the average service time. Differently…

Information Theory · Computer Science 2020-02-20 Johan Östman , Rahul Devassy , Giuseppe Durisi , Erik G. Ström

We introduce an attack scheme for eavesdropping the ping-pong quantum communication protocol proposed by Bostr$\ddot{o}$m and Felbinger [Phys. Rev. Lett. \textbf{89}, 187902 (2002)] freely in a noise channel. The vicious eavesdropper, Eve,…

Quantum Physics · Physics 2009-11-11 Fu-Guo Deng , Xi-Han Li , Chun-Yan Li , Ping Zhou , Hong-Yu Zhou

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

We formulate and study a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob…

Information Theory · Computer Science 2011-10-27 László Czap , Vinod M. Prabhakaran , Suhas Diggavi , Christina Fragouli

In this paper we propose a two-way protocol of physical layer security using the method of privacy amplification against eavesdroppers. First we justify our proposed protocol by analyzing the physical layer security provided by the classic…

Information Theory · Computer Science 2022-04-26 Masahito Hayashi , Angeles Vazquez-Castro

In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

We consider point-to-point communication over $q$-ary adversarial channels with partial noiseless feedback. In this setting, a sender Alice transmits $n$ symbols from a $q$-ary alphabet over a noisy forward channel to a receiver Bob, while…

Information Theory · Computer Science 2023-05-25 Eric Ruzomberka , Yongkyu Jang , David J. Love , H. Vincent Poor

We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable…

Quantum Physics · Physics 2009-11-10 Qing-yu Cai , Bai-wen Li

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

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

This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general…

Information Theory · Computer Science 2025-10-30 Hadi Aghaee , Christian Deppe , Holger Boche

We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of…

Information Theory · Computer Science 2016-11-18 Manoj Mishra , Tanmay Sharma , Bikash K. Dey , Vinod M. Prabhakaran

Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…

Information Theory · Computer Science 2014-12-16 Assaf Ben-Yishai , Ofer Shayevitz

With the increasing demand for secure communication in optical space networks, it is essential to develop physical-layer scalable security solutions. In this context, we present the asymptotic security analysis of a keyless quantum private…

Quantum Physics · Physics 2024-09-12 Angeles Vazquez-Castro , Andreas Winter , Hugo Zbinden

We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett et al(1995)'s bound based on the R\'enyi entropy of order 2 because the bound…

Information Theory · Computer Science 2016-11-17 Masahito Hayashi

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two…

Information Theory · Computer Science 2016-11-15 Vinod M. Prabhakaran , Krishnan Eswaran , Kannan Ramchandran