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:1301.5014 · Journal of Quantum Information Science

Quantum Key Distribution with Qubit Pairs

Mohd Asad Siddiqui, Tabish Qureshi

Published Jan 1, 2014• 3 citations
arXivHTMLPDF

Abstract

We propose a new Quantum Key Distribution method in which Alice sends pairs of qubits to Bob; each is in one of four possible states. Bob uses one qubit to generate a secure key and the other to generate an auxiliary key. For each pair he randomly decides which qubit to use for which key. The auxiliary key has to be added to Bob’s secure key in order to match Alice’s secure key. This scheme provides an additional layer of security over the standard BB84 protocol.

DOI
10.4236/jqis.2014.43014

Related papers

Quantum Key Distribution with Qubits Encoded in Qutrit

Rupesh Kumar, Rafał Demkowicz-Dobrzański, Konrad Banaszek

We present a novel one-way quantum key distribution protocol based on 3-dimensional quantum state, a qutrit, that encodes two qubits in its 2-dimensional subspaces. The qubits hold the classical bit information that has to be shared between the legitimate users. Alice sends such a qutrit to Bob where he decodes one of the qubit and measures it along the random Pauli basis. This scheme has higher secure key rate at longer transmission distance than the standard BB84 protocol.

arXiv:1202.0456•Feb 2, 2012•0 citations

Master Key Secured Quantum Key Distribution

Tabish Qureshi, Tabish Shibli, Aditi Sheel

A new scheme of Quantum Key Distribution is proposed using three entangled particles in a GHZ state. Alice holds a 3-particle source and sends two particles to Bob, keeping one with herself. Bob uses one particle to generate a secure key, and the other to generate a master-key. This scheme should prove to be harder to break in non-ideal situations as compared to the standard protocols BB84 and Eckert. The scheme uses the concept of Quantum Disentanglement Eraser. Extension to multi-partite scheme has also been investigated.

arXiv:1301.5015•Jan 17, 2013•2 citations

A quantum key distribution protocol based on challenge-response mechanism

Wang Hai-hon

A quantum key distribution protocol based on BB84 protocol and a challenge-response mechanism was proposed.Through a secure channel,Alice and Bob have pre-shared three different Hash functions(denoted by H_1,H_2 and H_3) and a random bit string S_O~(AB).Every time,Alice first generates two random bit strings S_r~A(challenge) and S_k~A(key),then prepares a photon sequence S_p~A based on BB84 protocol using S_r~B,S_k~B,S_O~(AB) and H_1.Alice sends S_r~A and S_p~A to Bob and Bob receives the corresponding S_r~B and S_p~B.Bob measures S_p~B according to BB84 protocol and gets corresponding S_k~B.In the ideal case,S_k~A should be the same as S_k~B.Bob uses S_r~B,S_k~B,S_O~(AB) and H_2 to generate S_2~B(response).At last,Alice and Bob use their own sequences and H_3 to generate S_O~A and S_O~B respectively,then they update their own S_O~(AB).In the proposed protocol,the utilization rate of photons is 100%.The security of the protocol is similar as that of the BB84 protocol.Furthermore,it is a one-way identification authentication protocol.

Chinese Journal of Quantum Electronics•Jan 1, 2015•1 citation

Quantum Key Distribution Scheme Based on Dense Encoding in Entangled States

Zhang Xiaolong, Yuexia Zhang, Kelin Gao

A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode,two classical bits information into one of the four one-qubit unitary operations implemented by Alice and the Bell states measurement implemented by Bob in stead of direct measuring the previously shared Einstein-Podolsky-Rosen pairs by both of the distant parties, Alice and Bob Considering the practical application we can get the conclusion that our protocol has some advantages. It not only simplifies the measurement which may induce potential errors, but also improves the effectively transmitted rate of the generated qubits by the raw key. Here we also discuss eavesdropping attacks against the scheme and the channel loss.

Communications in Theoretical Physics•Apr 1, 2005•7 citations

The BB84 protocol

Gilles Van Assche

The publication of the BB84 protocol by Bennett and Brassard in 1984 [10] marks the beginning of quantum key distribution. Since then, many other protocols have been invented. Yet, BB84 keeps a privileged place in the list of existing protocols: it is the one most analyzed and most often implemented, including those used in commercial products, e.g., [91, 113]. In this chapter, I define the BB84 protocol, although I already described it informally in Section 1.1. The physical implementation is then investigated. Finally, I analyze the eavesdropping strategies against BB84 and deduce the secret key rate. Description Alice chooses binary key elements randomly and independently, denoted by the random variable X ∈ χ = {0, 1}. In this protocol, there are two encoding rules, numbered by i ∈ {1, 2}. Alice randomly and independently chooses which encoding rule she uses for each key element. In case 1, Alice prepares a qubit from the basis {|0〉, |1〉} as In case 2, Alice prepares a qubit from the basis {|+〉, |−〉} as On his side, Bob measures either Z or X , yielding the result Y Z or Y X , choosing at random which observable he measures. After sending a predefined number of qubits, Alice reveals to Bob the encoding rule for each of them. They proceed with sifting, that is, they discard the key elements for which Alice used case 1 (or case 2) and Bob measured Z (or X ). For the remaining (sifted) key elements, we denote Bob's sifted measurements by Y .

Cambridge University Press eBooks•Jun 29, 2006•4 citations

A random quantum key distribution achieved by using Bell states

Chong Li, He‐Shan Song, Ling Zhou +1 more

We propose a new scheme for quantum key distribution based on entanglement swapping. By this protocol, Alice can securely share a random quantum key with Bob, without transporting any particle.

arXiv:quant-ph/0302193•Journal of Optics B Quantum and Semiclassical Optics•Feb 28, 2003•36 citations
We propose a new Quantum Key Distribution method in which Alice sends pairs of qubits to Bob; each is in one of four possible states. Bob uses one qubit to generate a secure key and the other to generate an auxiliary key. For each pair he randomly decides which qubit to use for which key. The auxiliary key has to be added to Bob’s secure key in order to match Alice’s secure key. This scheme provides an additional layer of security over the standard BB84 protocol.
A new scheme of Quantum Key Distribution is proposed using three entangled particles in a GHZ state. Alice holds a 3-particle source and sends two particles to Bob, keeping one with herself. Bob uses one particle to generate a secure key, and the other to generate a master-key. This scheme should prove to be harder to break in non-ideal situations as compared to the standard protocols BB84 and Eckert. The scheme uses the concept of Quantum Disentanglement Eraser. Extension to multi-partite scheme has also been investigated.
A quantum key distribution protocol based on BB84 protocol and a challenge-response mechanism was proposed.Through a secure channel,Alice and Bob have pre-shared three different Hash functions(denoted by H_1,H_2 and H_3) and a random bit string S_O~(AB).Every time,Alice first generates two random bit strings S_r~A(challenge) and S_k~A(key),then prepares a photon sequence S_p~A based on BB84 protocol using S_r~B,S_k~B,S_O~(AB) and H_1.Alice sends S_r~A and S_p~A to Bob and Bob receives the corresponding S_r~B and S_p~B.Bob measures S_p~B according to BB84 protocol and gets corresponding S_k~B.In the ideal case,S_k~A should be the same as S_k~B.Bob uses S_r~B,S_k~B,S_O~(AB) and H_2 to generate S_2~B(response).At last,Alice and Bob use their own sequences and H_3 to generate S_O~A and S_O~B respectively,then they update their own S_O~(AB).In the proposed protocol,the utilization rate of photons is 100%.The security of the protocol is similar as that of the BB84 protocol.Furthermore,it is a one-way identification authentication protocol.
A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode,two classical bits information into one of the four one-qubit unitary operations implemented by Alice and the Bell states measurement implemented by Bob in stead of direct measuring the previously shared Einstein-Podolsky-Rosen pairs by both of the distant parties, Alice and Bob Considering the practical application we can get the conclusion that our protocol has some advantages. It not only simplifies the measurement which may induce potential errors, but also improves the effectively transmitted rate of the generated qubits by the raw key. Here we also discuss eavesdropping attacks against the scheme and the channel loss.
The publication of the BB84 protocol by Bennett and Brassard in 1984 [10] marks the beginning of quantum key distribution. Since then, many other protocols have been invented. Yet, BB84 keeps a privileged place in the list of existing protocols: it is the one most analyzed and most often implemented, including those used in commercial products, e.g., [91, 113]. In this chapter, I define the BB84 protocol, although I already described it informally in Section 1.1. The physical implementation is then investigated. Finally, I analyze the eavesdropping strategies against BB84 and deduce the secret key rate. Description Alice chooses binary key elements randomly and independently, denoted by the random variable X ∈ χ = {0, 1}. In this protocol, there are two encoding rules, numbered by i ∈ {1, 2}. Alice randomly and independently chooses which encoding rule she uses for each key element. In case 1, Alice prepares a qubit from the basis {|0〉, |1〉} as In case 2, Alice prepares a qubit from the basis {|+〉, |−〉} as On his side, Bob measures either Z or X , yielding the result Y Z or Y X , choosing at random which observable he measures. After sending a predefined number of qubits, Alice reveals to Bob the encoding rule for each of them. They proceed with sifting, that is, they discard the key elements for which Alice used case 1 (or case 2) and Bob measured Z (or X ). For the remaining (sifted) key elements, we denote Bob's sifted measurements by Y .