Multi‐Party Semi‐Quantum Key Distribution Protocol With Four‐Particle Cluster States

2019 ◽  
Vol 531 (8) ◽  
pp. 1800520 ◽  
Author(s):  
Nan‐Run Zhou ◽  
Kong‐Ni Zhu ◽  
Xiang‐Fu Zou
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Particle Cluster ◽  
Cluster States ◽  
Quantum Key Distribution Protocol

scholarly journals Experimental verification of fault tolerant quantum key distribution protocol

2005 ◽  
Vol 13 (23) ◽  
pp. 9415 ◽  
Author(s):  
Yun-kun Jiang ◽  
Xiang-Bin Wang ◽  
Bao-Sen Shi ◽  
Akihisa Tomita
Keyword(s):  
Experimental Verification ◽  
Quantum Key Distribution ◽  
Fault Tolerant ◽  
Key Distribution ◽  
Quantum Key Distribution Protocol

scholarly journals Lightweight mediated semi-quantum key distribution protocol with a dishonest third party based on Bell states

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Chia-Wei Tsai ◽  
Chun-Wei Yang
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Trojan Horse ◽  
Bell States ◽  
Third Party ◽  
Research Issue ◽  
Important Research ◽  
Secret Keys ◽  
Quantum Key Distribution Protocol

AbstractThe mediated semi-quantum key distribution (MSQKD) protocol is an important research issue that lets two classical participants share secret keys securely between each other with the help of a third party (TP). However, in the existing MSQKD protocols, there are two improvable issues, namely (1) the classical participants must be equipped with expensive detectors to avoid Trojan horse attacks and (2) the trustworthiness level of TP must be honest. To the best of our knowledge, none of the existing MSQKD protocols can resolve both these issues. Therefore, this study takes Bell states as the quantum resource to propose a MSQKD protocol, in which the classical participants do not need a Trojan horse detector and the TP is dishonest. Furthermore, the proposed protocol is shown to be secure against well-known attacks and the classical participants only need two quantum capabilities. Therefore, in comparison to the existing MSQKD protocols, the proposed protocol is better practical.

scholarly journals The attack strategy for a quantum key distribution protocol based on Bell’s theorem

2021 ◽  
Vol 2056 (1) ◽  
pp. 012011
Author(s):  
Chan Myae Hein ◽  
T F Kamalov
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Bell’S Theorem ◽  
Bell's Theorem ◽  
Secret Key ◽  
Theoretical Concepts ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Quantum Key Distribution Protocol ◽  
Attack Strategy

Abstract A new eavesdropping strategy is proposed for the Quantum Key Distribution (QKD) protocol. This scheme represents a new kind of intercept/resend strategy based on Bell’s theorem. Quantum key distribution (QKD) provides the foremost reliable form of secure key exchange, using only the input-output statistics of the devices to realize information-theoretic security. In this paper, we present an improved QKD protocol that can simultaneously distribute the quantum secret key. We are already using the QKD protocol with simulated results matched completely with the theoretical concepts.

A qutrit quantum key distribution protocol using Bell inequalities with larger violation capabilities

2015 ◽  
Vol 15 (15&16) ◽  
pp. 1295-1306
Author(s):  
Zoe Amblard ◽  
Francois Arnault
Keyword(s):  
Quantum Key Distribution ◽  
Bell Inequality ◽  
Bell Inequalities ◽  
Key Distribution ◽  
Trojan Horse ◽  
Noise Resistance ◽  
The One ◽  
Trojan Horse Attack ◽  
Quantum Key Distribution Protocol

The Ekert quantum key distribution protocol [1] uses pairs of entangled qubits and performs checks based on a Bell inequality to detect eavesdropping. The 3DEB protocol [2] uses instead pairs of entangled qutrits to achieve better noise resistance than the Ekert protocol. It performs checks based on a Bell inequality for qutrits named CHSH-3 and found in [3, 4]. In this paper, we present a new protocol, which also uses pairs of entangled qutrits, but gaining advantage of a Bell inequality which achieves better noise resistance than the one used in 3DEB. The latter inequality is called here hCHSH-3 and was discovered in [5]. For each party, the hCHSH-3 inequality involves four observables already used in CHSH-3 but also two products of observables which do not commute. We explain how the parties can measure the observables corresponding to these products and thus are able to check the violation of hCHSH-3. In the presence of noise, this violation guarantees the security against a local Trojan horse attack. We also designed a version of our protocol which is secure against individual attacks.

Sign in / Sign up

Export Citation Format

Share Document