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

IEEE Journal of Selected Topics in Quantum Electronics

New Efficient Three-Party Quantum Key Distribution Protocols

Han-Cheng Shih, Kuo-Chang Lee, Tzonelih Hwang

Published Jan 1, 2009• 62 citations
Publisher

Abstract

Most of the existing quantum key distribution protocols (QKDPs) assume that every communicating party is equipped with quantum devices (QDs), e.g., the qubit generating machine, or the quantum memory, or the qubit measuring machine. However, in the practical situation, these QDs are expensive, and a center may be the only party that affords to own these devices. Though Phoenix first realize the idea, their scheme only has 13% of qubit efficiency. This paper proposes two three-party QKDPs. The first QKDP with an honest center allows communicants to share a session key by only performing unitary operations. Moreover, considering the trustworthiness of the center, this paper further proposes the second QKDP without the assumption of a trusted center. Besides, the proposed three-party QKDPs provide better qubit efficiency than the other QKDPs due to the use of the quantum memory and the use of one-way hash function for the eavesdropping check, and the security of proposed QKDPs is shown in the ¿sequence-of-games approach¿.

DOI
10.1109/jstqe.2009.2019617

Related papers

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

A Three Party Authentication for Key Distributed Protocol Using Classical and Quantum Cryptography

Suganya Ranganathan, R. Nagarajan, S. Karthick +4 more

In the existing study of third party authentication, for message transformation has less security against attacks such as man-in-the-middle, efficiency and so on. In this approach, we at hand give a Quantum Key Distribution Protocol (QKDP) to safeguard the security in larger networks, which uses the combination of merits of classical cryptography and quantum cryptography. Two three-party QKDPs, one implemented with implicit user authentication and the other with explicit mutual authentication, which include the following: 1. Security against such attacks as the man-in-themiddle, eavesdropping and replay. 2. Efficiency is improved as the proposed protocols contain the fewest number of communication rounds among the existing QKDPs. 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.

•Jan 1, 2010•4 citations

Three-Party Authenticated Quantum Key Distribution Protocols based Security in WLANs

KAMINI, V V S NARAYANA MURTHY; CHAITANYA INSTITUTE OF SCIENCE & TECHNOLOGY,JNTU, KAKINADA, Raju, Amudala Ratna, M. Vamsi Krishna

Abstract— 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. Index Terms—Quantum cryptography, three-party key distribution protocol, provable security

•Nov 30, 2012•0 citations

Efficient Three-Party Quantum Secret Sharing with Single Photons

Ping Zhou, Xihan Li, Deng Fu-Guo +1 more

A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.

Chinese Physics Letters•Jul 26, 2007•26 citations

Three-Party Authentication using Quantum Key Distribution Protocols

P. Kalamani, Sujith nair.P

This project presents Quantum Key Distribution Protocols (QKDPs) to safeguard security in massive networks, by mistreatment DES algorithmic rule for secret writing and decryption of .txt file. In this project, secure communication between the sender and also the receiver is being created attainable through a trusted center by mistreatment secret key authentication. The trustworthy Center distributes a quantum key to each the sender and also the receiver when the verification of the secret key. The sender encrypts the info and sends to the receiver side solely when getting the quantum key from the Trusted Center. Similarly the decoding method happens. RSA algorithmic rule is getting used for quantum key distribution. and the input txt file is retrieved on the receiver aspect.

Journal of Emerging Technologies and Innovative Research•Feb 1, 2019•0 citations

Provably Dwindling Three-Party Spurious Classical and Quantum Key Distribution Protocols

V. Sathya, Kirankumar Manivannan, P. Prema +2 more

This chapter 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.

Advances in systems analysis, software engineering, and high performance computing book series•Mar 3, 2023•1 citation
Most of the existing quantum key distribution protocols (QKDPs) assume that every communicating party is equipped with quantum devices (QDs), e.g., the qubit generating machine, or the quantum memory, or the qubit measuring machine. However, in the practical situation, these QDs are expensive, and a center may be the only party that affords to own these devices. Though Phoenix first realize the idea, their scheme only has 13% of qubit efficiency. This paper proposes two three-party QKDPs. The first QKDP with an honest center allows communicants to share a session key by only performing unitary operations. Moreover, considering the trustworthiness of the center, this paper further proposes the second QKDP without the assumption of a trusted center. Besides, the proposed three-party QKDPs provide better qubit efficiency than the other QKDPs due to the use of the quantum memory and the use of one-way hash function for the eavesdropping check, and the security of proposed QKDPs is shown in the ¿sequence-of-games approach¿.
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
In the existing study of third party authentication, for message transformation has less security against attacks such as man-in-the-middle, efficiency and so on. In this approach, we at hand give a Quantum Key Distribution Protocol (QKDP) to safeguard the security in larger networks, which uses the combination of merits of classical cryptography and quantum cryptography. Two three-party QKDPs, one implemented with implicit user authentication and the other with explicit mutual authentication, which include the following: 1. Security against such attacks as the man-in-themiddle, eavesdropping and replay. 2. Efficiency is improved as the proposed protocols contain the fewest number of communication rounds among the existing QKDPs. 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.
Abstract— 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. Index Terms—Quantum cryptography, three-party key distribution protocol, provable security
A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.
This project presents Quantum Key Distribution Protocols (QKDPs) to safeguard security in massive networks, by mistreatment DES algorithmic rule for secret writing and decryption of .txt file. In this project, secure communication between the sender and also the receiver is being created attainable through a trusted center by mistreatment secret key authentication. The trustworthy Center distributes a quantum key to each the sender and also the receiver when the verification of the secret key. The sender encrypts the info and sends to the receiver side solely when getting the quantum key from the Trusted Center. Similarly the decoding method happens. RSA algorithmic rule is getting used for quantum key distribution. and the input txt file is retrieved on the receiver aspect.
This chapter 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.