English
Related papers

Related papers: Secure Communication with Unreliable Entanglement …

200 papers

We consider the problem of covert communication over a state-dependent channel when the channel state is available either non-causally, causally, or strictly causally, either at the transmitter alone or at both transmitter and receiver.…

Information Theory · Computer Science 2021-05-24 Hassan ZivariFard , Matthieu R. Bloch , Aria Nosratinia

Anonymous communication networks have emerged as crucial tools for obfuscating communication pathways and concealing user identities. However, their practical deployments face significant challenges, including susceptibility to artificial…

Cryptography and Security · Computer Science 2025-08-05 Chao Ge , Wei Yuan , Ge Chen , Yanbin Pan , Yuan Shen

A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process…

Quantum Physics · Physics 2012-08-27 Fu-Guo Deng , Hong-Yu Zhou andGui Lu Long

Standard quantum cryptographic protocols are not secure if one assumes that nonlocal hidden variables exist and can be measured with arbitrary precision. The security can be restored if one of the communicating parties randomly switches…

Quantum Physics · Physics 2009-11-11 Diederik Aerts , Marek Czachor , Marcin Pawlowski

Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver share secret key, which they use to encrypt communication and ensure distortion at an adversary. A model is…

Information Theory · Computer Science 2015-04-14 Curt Schieler , Paul Cuff

In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper.…

Information Theory · Computer Science 2015-03-20 Fan Cheng , Raymond W. Yeung , Kenneth W. Shum

Two deterministic secure quantum communication schemes are proposed, one based on pure entangled states and the other on $d$-dimensional single-photon states. In these two schemes, only single-photon measurements are required for the two…

Quantum Physics · Physics 2007-05-23 Xi-Han Li , Fu-Guo Deng , Chun-Yan Li , Yu-Jie Liang , Ping Zhou , Hong-Yu Zhou

Communication is secret if a message is independent of the state; however, the receiver's subsequent action may still reveal that she has acted on hidden information. This paper studies when secret communication can also provide plausible…

Theoretical Economics · Economics 2026-05-12 Xiaoyu Cheng , Yonggyun Kim , Michael P. H. Tam

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

Information Theory · Computer Science 2017-02-14 Shahid M. Shah , Vinod Sharma

It is a common belief that quantum key distribution systems are the one and only information-theoretically secure physical layer security protocol that enables secure data transmission without a need for the legitimate parties to have any…

Quantum Physics · Physics 2024-11-18 Florian Seitz , Matteo Rosati , Ángeles Vázquez-Castro , Janis Nötzel

Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined, both with and without key assistance, and an achievable region…

Quantum Physics · Physics 2021-09-15 Uzi Pereg , Roberto Ferrara , Matthieu R. Bloch

We consider the problem of constructing an unconditionally secure cipher with a short key for the case where the probability distribution of encrypted messages is unknown. Note that unconditional security means that an adversary with no…

Cryptography and Security · Computer Science 2023-03-28 Boris Ryabko

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Ivana Maric , Roy D. Yates , Predrag Spasojevic

In the secure groupcast problem, a transmitter wants to securely groupcast a message with the maximum rate to the first $N$ of $K$ receivers by broadcasting with the minimum bandwidth, where the $K$ receivers are each equipped with a key…

Information Theory · Computer Science 2020-06-11 Hua Sun

We demonstrate that secure communication using coherent states is possible. The optimal eavesdropping strategy for an M-ry ciphering scheme shows that the minimum probability of error in a measurement for bit determination can be made…

This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…

Information Theory · Computer Science 2018-10-29 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

A quantum network is constructed via maximum entangled coherent states. The possibility of using this network to achieve communication between multi-participants is investigated. We showed that the probability of teleported unknown state…

Quantum Physics · Physics 2015-05-20 A. El Allati , Y. Hassouni , N. Metwally

Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information…

Emerging Technologies · Computer Science 2024-06-14 Amit Kumar Bhuyan , Hrishikesh Dutta

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

Uncertain wiretap channels are introduced. Their zero-error secrecy capacity is defined. If the sensor-estimator channel is perfect, it is also calculated. Further properties are discussed. The problem of estimating a dynamical system with…