We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate
Quantum Key Distribution (QKD) allows two legitimate parties to establish a secret key with informationtheoretic security. However, existing protocols have a very low noise tolerance, limiting their deployment in practical quantum channels with finite resources. We propose a novel QKD protocol based on entanglement swapping that achieves higher noise tolerance and improved key rates. In the proposed protocol, a six-bit symbol is encoded in a six-qubit state formed by randomly grouping the state into three pairs to form three Bell states. The proposed protocol maintains a positive secrecy rate for eavesdropper interception probabilities approaching 100 % under the intercept-and-resend attack model, significantly outperforming existing protocols in the literature.
Quantum cryptography is considered a solution for sharing secret information in a secure mode. Establishing a quantum security platform into an exciting system requires a package of stable processes. One of these processes is based on creating a Quantum Key Distribution (QKD) protocol or sharing a secret key. This paper presents a QKD protocol that utilizes two quantum channels to prepare a shared secret key. The first communication channel will be initiated by entanglement states, where the entangled photons will be emitted by a trusted third party. The second communication channel utilizes the superposition states that will be initiated by the one of the communicated parties. Moreover, the protocol produces a string of random qubits after verifying the communicated legitimate parties during entangled state channels. The produced string will reflect the shared secret key between the users.
Quantum key distribution is a sub topic under quantum cryptography where two parties distribute a shared random bit string known only to them and which can be used as a key to encrypt and decrypt messages. This paper proposes a novel method of QKD to distribute the secret key. The basic concept of QKD remains the same but the process by which the key is exchanged between the two parties is different and is much more secure than the existing QKD protocols. The proposed method exploits the concept of hamming weight.
Quantum key distribution (QKD) protocol techniques are used in the distribution of keys using the laws of physics.Quantum secret sharing (QSS), quantum secure direct communication, and quantum teleportation, which are all included under QKD, are used to share or distribute a secure key in a quantum environment.In QSS, we share a key based on the quantum properties of light.We emphasize cooperation between communicating parties to eliminate untrustworthy members and to improve the strength of the key.The results obtained showed that using the proposed method, it is difficult for eavesdroppers to obtain the key.
Multiparty quantum key distribution (QKD) is useful for many applications that involve secure communication or collaboration among multiple parties. While it can be achieved using pairwise QKD, a more efficient approach is to achieve it using multipartite entanglement distributed over quantum networks that connect the multiple parties. Existing studies on multipartite entanglement distribution, however, are not designed for multiparty QKD, and hence do not aim to maximize secret key generation rate. In this paper, we design efficient strategies for multiparty QKD over quantum networks. For 3-party QKD, we derive closed-form expressions for analyzing key distribution over quantum networks. We then use it to develop an efficient strategy for 3-party QKD by packing multiple stars that connect the 3 parties. For the general form of N-party QKD, we develop an approach that packs multiple trees to connect the N parties, while directly incorporating the estimated key rates on network paths. Extensive evaluation of our strategies, in both grid and random graphs, under a wide range of settings, demonstrates that our schemes achieve high key rate, which degrades gracefully when increasing the number of parties.