Dynamic Quantum Group Key Agreement via Tree Key Graphs
- URL: http://arxiv.org/abs/2312.04107v1
- Date: Thu, 7 Dec 2023 07:45:59 GMT
- Title: Dynamic Quantum Group Key Agreement via Tree Key Graphs
- Authors: Qiang Zhao, Zhuohua Li, John C.S. Lui
- Abstract summary: We propose two dynamic Quantum Group Key Agreement protocols for a join or leave request in group communications.
The number of qubits required per join or leave only increases logarithmically with the group size.
- Score: 36.47236890715043
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum key distribution (QKD) protocols are essential to guarantee
information-theoretic security in quantum communication. Although there was
some previous work on quantum group key distribution, they still face many
challenges under a ``\textit{dynamic}'' group communication scenario. In
particular, when the group keys need to be updated in real-time for each user
joining or leaving to ensure secure communication properties, i.e., forward
confidentiality and backward confidentiality. However, current protocols
require a large amount of quantum resources to update the group keys, and this
makes them impractical for handling large and dynamic communication groups. In
this paper, we apply the notion of ``{\em tree key graph}'' to the quantum key
agreement and propose two dynamic Quantum Group Key Agreement (QGKA) protocols
for a join or leave request in group communications. In addition, we analyze
the quantum resource consumption of our proposed protocols. The number of
qubits required per join or leave only increases logarithmically with the group
size. As a result, our proposed protocols are more practical and scalable for
large and dynamic quantum group communications.
Related papers
- Towards efficient and secure quantum-classical communication networks [47.27205216718476]
There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC)
We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution.
We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
arXiv Detail & Related papers (2024-11-01T23:36:19Z) - The Evolution of Quantum Secure Direct Communication: On the Road to the
Qinternet [49.8449750761258]
Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing.
We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
arXiv Detail & Related papers (2023-11-23T12:40:47Z) - Boosted quantum and semi-quantum communication protocols [0.0]
We show that it is possible to reduce the number of such runs by a suitable design of the key generation rule.
We illustrate this advantage by proposing quantum and semi-quantum key distribution protocols.
arXiv Detail & Related papers (2023-03-24T12:33:22Z) - Conference key agreement in a quantum network [67.410870290301]
Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state.
In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
arXiv Detail & Related papers (2022-07-04T18:00:07Z) - Anonymous conference key agreement in linear quantum networks [0.29998889086656577]
Conference key agreement (CKA) is an extension of key distribution to multiple parties.
CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity.
We propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting.
arXiv Detail & Related papers (2022-05-18T18:38:52Z) - Improved Semi-Quantum Key Distribution with Two Almost-Classical Users [1.827510863075184]
We revisit a mediated semi-quantum key distribution protocol introduced by Massa et al.
We show how this protocol may be extended to improve its efficiency and also its noise tolerance.
We evaluate the protocol's performance in a variety of lossy and noisy channels.
arXiv Detail & Related papers (2022-03-20T14:41:14Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Anonymous Conference Key Agreement in Quantum Networks [0.0]
Quantum Conference Key Agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key.
We provide the first protocol for Anonymous Quantum Conference Key Agreement.
arXiv Detail & Related papers (2020-07-15T21:17:41Z) - High key rate quantum conference key agreement with unconditional
security [13.32599647155171]
Quantum conference key agreement (CKA) is an important cryptographic primitive of quantum cryptography.
We propose a quantum CKA protocol of three users with information-theoretic security.
Our scheme can be widely implemented in the approaching large-scale quantum network.
arXiv Detail & Related papers (2020-06-18T01:47:17Z) - Experimental quantum conference key agreement [55.41644538483948]
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale.
Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement.
We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
arXiv Detail & Related papers (2020-02-04T19:00:31Z)
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.