Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0403172

Secure quantum cryptographic network based on quantum key distribution

Sora Choi, Soojoon Lee, Dong Pyo Chi

Published Mar 24, 2004• 0 citations
arXivHTMLPDF

Abstract

We present a protocol for quantum cryptographic network consisting of a quantum network center and many users, in which any pair of parties with members chosen from the whole users on request can secure a quantum key distribution by help of the center. The protocol is based on the quantum authentication scheme given by Barnum et al. [Proc. 43rd IEEE Symp. FOCS'02, p. 449 (2002)]. We show that exploiting the quantum authentication scheme the center can safely make two parties share nearly perfect entangled states used in the quantum key distribution. This implies that the quantum cryptographic network protocol is secure against all kinds of eavesdropping.

DOI
10.48550/arxiv.quant-ph/0403172

Related papers

Multi-user quantum key distribution based on Bell states with mutual authentication

Song Lin, Chuan Zhen Huang, Xiao-Fen Liu

A new multi-user quantum key distribution protocol with mutual authentication is proposed on a star network. Here, two arbitrary users are able to perform key distribution with the assistance of a semi-trusted center. Bell states are used as information carriers and transmitted in a quantum channel between the center and one user. A keyed hash function is utilized to ensure the identities of three parties. Finally, the security of this protocol with respect to various kinds of attacks is discussed.

Physica Scripta•Feb 18, 2013•13 citations

Quantum Authentication and Quantum Key Distribution Protocol

Hwayean Lee, Jongin Lim, Hyung-Jin Yang

We propose a quantum key distribution protocol with quantum based user authentication. Our protocol is the first one in which users can authenticate each other without previously shared secret and then securely distribute a key where the key may not be exposed to even a trusted third party. The security of our protocol is guaranteed by the properties of the entanglement.

arXiv:quant-ph/0510144•Oct 18, 2005•3 citations

Multi-user quantum key distribution with mutual authentication

Lin Son

Based on the entanglement feature of Greenberger-Horne-Zeilinger states, a multi-user quantum key distribution with mutual authentication is proposed. In the protocol, a semi-trusted third party, who may misbehave on its own but will conspire with none of the participants, is introduced to help arbitrary two users on a quantum network to achieve this secure task. Firstly, the third party prepares a three-particle entangled state. Then, he keeps one particle in his hand, and sends two particles to these two users respectively. Meanwhile, a keyed one-way hash function is utilized to generate an authentication message, in terms of which three parties respectively make an appropriate single-particle measurement on the particles in their hands. According to the measurement results, the third party can verify the identity of one user. It implies that one user is able to authenticate the other user with the assistance of the third party. After that, two participants use the remainder measurement results to generate a common session key. Moreover, the practical implementation of the presented protocol is discussed, which illustrates that this protocol is feasible under the current techniques. In the end, the security of the presented protocol is analyzed. It is shown that this protocol is secure in theory by proving that the presented protocol can stand against several common attacks.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Jan 1, 2015•0 citations

Secure Communication Using Two Party Authenticated Quantum key Distribution Protocols

S. Venkatramulu, S. Veena

This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, efficiency is improved as the proposed protocols contain the fewest number of communication rounds and two parties can share and use a long-term secret Key. Quantum cryptography is basically based on a trusted channel in communication between two parties compared to classical channel. Recently, Quantum Key Distribution (QKD) has become more secure transmission method used to transmit secret key between two legitimate parties. This paper discusses the implementation of (QKD) protocol with the existence of an eavesdropper. The implementation simulates the communication of two parties who wish to share a secret key with the existing of eavesdropper. The existing of eavesdropper is simulated with two kinds of attacks, which is used as parameter to measure the length of final key agreed by both authenticated parties at the end of the communication.

•Jan 1, 2010•5 citations

Efficient multiuser quantum cryptography network based on entanglement

Peng Xue, Kunkun Wang, Xiaoping Wang

We present an efficient quantum key distribution protocol with a certain entangled state to solve a special cryptographic task. Also, we provide a proof of security of this protocol by generalizing the proof of modified of Lo-Chau scheme. Based on this two-user scheme, a quantum cryptography network protocol is proposed without any quantum memory.

Scientific Reports•Apr 4, 2017•15 citations

Provably Secure Three-Party Authenticated Quantum Key Distribution Protocols

Tzonelih Hwang, Kuo-Chang Lee, Chuanming Li

This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, ushering in new directions in classical cryptography and quantum cryptography. Two three-party QKDPs, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay; 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing QKDPs; and 3) two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the unbiased-chosen basis (UCB) assumption

IEEE Transactions on Dependable and Secure Computing•Jan 1, 2007•89 citations
We present a protocol for quantum cryptographic network consisting of a quantum network center and many users, in which any pair of parties with members chosen from the whole users on request can secure a quantum key distribution by help of the center. The protocol is based on the quantum authentication scheme given by Barnum et al. [Proc. 43rd IEEE Symp. FOCS'02, p. 449 (2002)]. We show that exploiting the quantum authentication scheme the center can safely make two parties share nearly perfect entangled states used in the quantum key distribution. This implies that the quantum cryptographic network protocol is secure against all kinds of eavesdropping.
A new multi-user quantum key distribution protocol with mutual authentication is proposed on a star network. Here, two arbitrary users are able to perform key distribution with the assistance of a semi-trusted center. Bell states are used as information carriers and transmitted in a quantum channel between the center and one user. A keyed hash function is utilized to ensure the identities of three parties. Finally, the security of this protocol with respect to various kinds of attacks is discussed.
Based on the entanglement feature of Greenberger-Horne-Zeilinger states, a multi-user quantum key distribution with mutual authentication is proposed. In the protocol, a semi-trusted third party, who may misbehave on its own but will conspire with none of the participants, is introduced to help arbitrary two users on a quantum network to achieve this secure task. Firstly, the third party prepares a three-particle entangled state. Then, he keeps one particle in his hand, and sends two particles to these two users respectively. Meanwhile, a keyed one-way hash function is utilized to generate an authentication message, in terms of which three parties respectively make an appropriate single-particle measurement on the particles in their hands. According to the measurement results, the third party can verify the identity of one user. It implies that one user is able to authenticate the other user with the assistance of the third party. After that, two participants use the remainder measurement results to generate a common session key. Moreover, the practical implementation of the presented protocol is discussed, which illustrates that this protocol is feasible under the current techniques. In the end, the security of the presented protocol is analyzed. It is shown that this protocol is secure in theory by proving that the presented protocol can stand against several common attacks.
This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, efficiency is improved as the proposed protocols contain the fewest number of communication rounds and two parties can share and use a long-term secret Key. Quantum cryptography is basically based on a trusted channel in communication between two parties compared to classical channel. Recently, Quantum Key Distribution (QKD) has become more secure transmission method used to transmit secret key between two legitimate parties. This paper discusses the implementation of (QKD) protocol with the existence of an eavesdropper. The implementation simulates the communication of two parties who wish to share a secret key with the existing of eavesdropper. The existing of eavesdropper is simulated with two kinds of attacks, which is used as parameter to measure the length of final key agreed by both authenticated parties at the end of the communication.
This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, ushering in new directions in classical cryptography and quantum cryptography. Two three-party QKDPs, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay; 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing QKDPs; and 3) two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the unbiased-chosen basis (UCB) assumption