One-to-Many Simultaneous Secure Quantum Information Transmission
- URL: http://arxiv.org/abs/2311.02530v1
- Date: Sun, 5 Nov 2023 00:41:55 GMT
- Title: One-to-Many Simultaneous Secure Quantum Information Transmission
- Authors: Theodore Andronikos and Alla Sirokofskich
- Abstract summary: This paper presents a new quantum protocol designed to simultaneously transmit information from one source to many recipients.
The proposed protocol is completely distributed and is provably information-theoretically secure.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper presents a new quantum protocol designed to simultaneously
transmit information from one source to many recipients. The proposed protocol,
which is based on the phenomenon of entanglement, is completely distributed and
is provably information-theoretically secure. Numerous existing quantum
protocols guarantee secure information communication between two parties but
are not amenable to generalization in situations where the source must transmit
information to two or more parties, so they must be applied sequentially two or
more times in such a setting. The main novelty of the new protocol is its
extensibility and generality to situations involving one party that must
simultaneously communicate different, in general, messages to an arbitrary
number of spatially distributed parties. This is achieved by the special way
employed to encode the transmitted information in the entangled state of the
system, one of the distinguishing features compared to previous protocols. This
protocol can prove expedient whenever an information broker, say, Alice, must
communicate distinct secret messages to her agents, all in different
geographical locations, in one go. Due to its relative complexity, compared to
similar cryptographic protocols, as it involves communication among $n$
parties, and relies on $GHZ_{n}$ tuples, we provide an extensive and detailed
security analysis so as to prove that it is information-theoretically secure.
Finally, in terms of its implementation, the prevalent characteristic of the
proposed protocol is its uniformity and simplicity because it only requires
CNOT and Hadamard gates, and the local quantum circuits are identical for all
information recipients.
Related papers
- Communication-Efficient Collaborative Perception via Information Filling with Codebook [48.087934650038044]
Collaborative perception empowers each agent to improve its perceptual ability through the exchange of perceptual messages with other agents.
To address this bottleneck issue, our core idea is to optimize the collaborative messages from two key aspects: representation and selection.
By integrating these two designs, we propose CodeFilling, a novel communication-efficient collaborative perception system.
arXiv Detail & Related papers (2024-05-08T11:12:37Z) - Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC)
We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
arXiv Detail & Related papers (2024-02-13T12:12:39Z) - Verifying the security of a continuous variable quantum communication protocol via quantum metrology [1.6632263048576381]
Quantum mechanics offers the possibility of unconditionally secure communication between multiple remote parties.
Security proofs for such protocols typically rely on bounding the capacity of the quantum channel in use.
In this work we establish a connection between these two areas.
arXiv Detail & Related papers (2023-11-09T14:15:42Z) - Practical quantum secure direct communication with squeezed states [55.41644538483948]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.
This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - Semi-device independent nonlocality certification for near-term quantum
networks [46.37108901286964]
Bell tests are the most rigorous method for verifying entanglement in quantum networks.
If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used.
We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
arXiv Detail & Related papers (2023-05-23T14:39:08Z) - Absolutely Secure Distributed Superdense Coding: Entanglement
Requirement for Optimality [0.0]
A superdense coding method is optimal when its capacity reaches Holevo bound.
We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob.
We construct a distributed dense coding method, which completely depicts absolutely secure one way quantum communication between many to one party.
arXiv Detail & Related papers (2021-11-01T16:29:04Z) - Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations [0.0]
Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations.
This paper proposes a novel SQSS protocol based on multi-particle GHZ states.
arXiv Detail & Related papers (2021-09-03T08:52:17Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Quasi-Equivalence Discovery for Zero-Shot Emergent Communication [63.175848843466845]
We present a novel problem setting and the Quasi-Equivalence Discovery algorithm that allows for zero-shot coordination (ZSC)
We show that these two factors lead to unique optimal ZSC policies in referential games.
QED can iteratively discover the symmetries in this setting and converges to the optimal ZSC policy.
arXiv Detail & Related papers (2021-03-14T23:42:37Z) - Client-Server Identification Protocols with Quantum PUF [1.4174475093445233]
We propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs)
The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice-versa.
Unlike existing identification protocols based on Quantum Read-out PUFs which rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties.
arXiv Detail & Related papers (2020-06-08T12:35:09Z) - Twin-field quantum digital signatures [4.503555294002338]
Digital signature is a key technique in information security, especially for identity authentications.
Quantum digital signatures (QDSs) provide a considerably higher level of security, i.e., information-theoretic security.
arXiv Detail & Related papers (2020-03-25T08:04:59Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.