English
Related papers

Related papers: Quantum Byzantine Multiple Access Channels

200 papers

We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access channel where either user may deviate from the prescribed…

Information Theory · Computer Science 2021-05-10 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access channel where either user may deviate from the prescribed…

Information Theory · Computer Science 2024-09-26 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

We analyze arbitrarily varying classical-quantum wiretap channels.These channels are subject to two attacks at the same time: one passive (eavesdropping), and one active (jamming). We progress on previous works by introducing a reduced…

Information Theory · Computer Science 2019-06-06 Holger Boche , Minglai Cai , Christian Deppe , Janis Nötzel

We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be…

Information Theory · Computer Science 2023-09-12 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

Suppose that $m$ senders want to transmit classical information to $n$ receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among…

Quantum Physics · Physics 2009-06-25 Runyao Duan , Yaoyun Shi

The multi-access channels in quantum information theory are considered. Classical messages from independent sources, which are represented as some quantum states, are transported by a channel to one address. The messages can interact with…

Quantum Physics · Physics 2007-05-23 A. E. Allahverdyan , D. B. Saakian

It is pointed out that two separated quantum channels and three classical authenticated channels are sufficient resources to achieve detectable broadcast.

Quantum Physics · Physics 2009-11-10 S. Iblisdir , N. Gisin

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola

We consider the problem of trying to send a single classical bit through a noisy quantum channel when two transmissions through the channel are available as a resource. Classically, two transmissions add nothing to the receiver's capability…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Christopher A. Fuchs , John A. Smolin

We review a communication protocol recently proposed by us that makes use of a two-way quantum channel. We provide a characterization of such a protocol from a practical perspective, and consider the most relevant eavesdropping strategies…

Quantum Physics · Physics 2015-03-13 Marco Lucamarini , Stefano Mancini

In this paper we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties. The striking feature of our proposal in comparison to the existing protocols is that we do not use entanglement to achieve…

Cryptography and Security · Computer Science 2020-12-02 Xin Sun , Piotr Kulicki , Mirek Sopek

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…

Quantum Physics · Physics 2013-10-09 Holger Boche , Janis Noetzel

We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both…

Quantum Physics · Physics 2024-09-04 Longcheng Li , Xiaoming Sun , Jiadong Zhu

We present a device-independent quantum scheme for the {\em Byzantine Generals} problem. The protocol is for three parties. Party $C$ is to send two identical one bit messages to parties $A$ and $B$. The receivers $A$ and $B$ may exchange…

Quantum Physics · Physics 2015-10-07 Ramij Rahaman , Marcin Wieśniak , Marek Żukowski

In this paper we propose a new model for arbitrarily varying classical-quantum channels. In this model a jammer has side information. We consider two scenarios. In the first scenario the jammer knows the channel input, while in the second…

Information Theory · Computer Science 2018-02-01 Holger Boche , Minglai Cai , Ning Cai

We investigate two senders and one receiver multiparty communication scenario. Following Phys.Rev.A83, 062112 and arXiv : 2506.07699, we study multiparty communication bounded by dimension and distinguishability. We provide an explicit…

Quantum Physics · Physics 2025-12-08 Ankush Pandit

We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To…

Mathematical Physics · Physics 2019-03-27 Holger Boche , Gisbert Janßen , Sajad Saeedinaeeni

A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single…

Quantum Physics · Physics 2022-03-09 Yujie Zhang , Xinan Chen , Eric Chitambar

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is…

Information Theory · Computer Science 2011-10-25 Jon Yard , Igor Devetak , Patrick Hayden

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…

Quantum Physics · Physics 2011-10-25 Jon Yard , Patrick Hayden , Igor Devetak
‹ Prev 1 2 3 10 Next ›