中文
相关论文

相关论文: Noisy Feedback and Loss Unlimited Private Communic…

200 篇论文

In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp,…

信息论 · 计算机科学 2022-12-14 Meghal Gupta , Venkatesan Guruswami , Rachel Yun Zhang

We investigate the quantum-secure covert-communication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels:…

量子物理 · 物理学 2020-09-29 Christos N. Gagatsos , Michael S. Bullock , Boulat A. Bash

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

信息论 · 计算机科学 2009-11-24 Xiang He , Aylin Yener

We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve. In addition to the privacy goals of oblivious transfer between Alice…

信息论 · 计算机科学 2016-11-17 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

信息论 · 计算机科学 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder

We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and…

量子物理 · 物理学 2024-09-25 Minglai Cai , Andreas Winter

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…

信息论 · 计算机科学 2022-09-07 Tianyou Pei , Wei Kang , Nan Liu

A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work…

量子物理 · 物理学 2016-03-22 Mark M. Wilde , Joseph M. Renes , Saikat Guha

We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or…

信息论 · 计算机科学 2014-03-25 Boulat A. Bash , Saikat Guha , Dennis Goeckel , Don Towsley

We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the…

信息论 · 计算机科学 2014-04-29 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…

量子物理 · 物理学 2025-07-08 Pete Rigas

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate…

量子物理 · 物理学 2025-12-18 Giuseppe Ortolano , Stefano Pirandola , Leonardo Banchi

The growing need for reliable communication over untrusted networks has caused a renewed interest in adversarial channel models, which often behave much differently than traditional stochastic channel models. Of particular practical use is…

信息论 · 计算机科学 2021-04-16 Vinayak Suresh , Eric Ruzomberka , David J. Love

We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3.…

数据结构与算法 · 计算机科学 2015-01-06 Klim Efremenko , Ran Gelles , Bernhard Haeupler

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also feedback channel with independent additive Gaussian noise, and the transmitter observes without delay all outputs of the…

信息论 · 计算机科学 2012-08-15 M. V. Burnashev , H. Yamamoto

The secret-key rate measures the rate at which Alice and Bob can extract secret bits from sampling a joint probability distribution, unknown to an eavesdropper Eve. The secret-key rate has been bounded above by the intrinsic information and…

信息论 · 计算机科学 2023-10-10 Andrey Boris Khesin , Andrew Tung , Karthik Vedula

An information-theoretic confidential communication is achievable if the eavesdropper has a degraded channel compared to the legitimate receiver. In wireless channels, beamforming and artificial noise can enable such confidentiality.…

信息论 · 计算机科学 2023-12-25 Stefan Roth , Aydin Sezgin

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…

信息论 · 计算机科学 2024-06-21 Anuj Kumar Yadav , Manideep Mamindlapally , Amitalok J. Budkuley

A new paradigm for secure communication, based on quantum illumination, is proposed. Alice uses spontaneous parametric down-conversion to send Bob a set of signal modes over a pure-loss channel while retaining the set of idler modes with…

量子物理 · 物理学 2009-04-28 Jeffrey H. Shapiro

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…

‹ 上一页 1 2 3 10 下一页 ›