scholarly journals CLASSICAL CORRELATION IN QUANTUM DIALOGUE

2008 ◽  
Vol 06 (02) ◽  
pp. 325-329 ◽  
Author(s):  
YONG-GANG TAN ◽  
QING-YU CAI
Keyword(s):  
Quantum Mechanics ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Quantum States ◽  
Quantum Dialogue ◽  
Secret Message ◽  
Secret Key ◽  
Post Processing ◽  
Classical Correlation ◽  
Processing Procedure

Classical communications are used in the post-processing procedure of quantum key distribution. Since the security of quantum key distribution is based on the principles of quantum mechanics, intuitively, the secret key can only be derived from the quantum states. We find that classical communications are incorrectly used in the so-called quantum dialogue type protocols. In these protocols, public communications are used to transmit secret messages. Our calculations show that half of Alice's and Bob's secret message is leaked through the classical channel. By applying the Holevo bound, we can see that the quantum efficiency claimed in the quantum dialogue type of protocols is not achievable.

An Efficient Reconciliation in Removing Errors Using Bose, Chaudhuri, Hocquenghem Code for Quantum Key Distribution

2012 ◽  
pp. 13-19
Author(s):  
Riaz Ahmad Qamar ◽  
Mohd Aizaini Maarof ◽  
Subariah Ibrahim
Keyword(s):  
Bit Error Rate ◽  
Error Rate ◽  
Quantum Key Distribution ◽  
Error Probability ◽  
Key Distribution ◽  
Secret Key ◽  
Post Processing ◽  
Quantum Bit ◽  
Quantum Bit Error Rate ◽  
Quantum Key Distribution Protocol

A quantum key distribution protocol(QKD), known as BB84, was developed in 1984 by Charles Bennett and Gilles Brassard. The protocol works in two phases which are quantum state transmission and conventional post processing. In the first phase of BB84, raw key elements are distributed between two legitimate users by sending encoded photons through quantum channel whilst in the second phase, a common secret-key is obtained from correlated raw key elements by exchanging messages through a public channel e.g.; network or internet. The secret-key so obtained is used for cryptography purpose. Reconciliation is a compulsory part of post processing and hence of quantum key distribution protocol. The performance of a reconciliation protocol depends on the generation rate of common secret-key, number of bits disclosed and the error probability in common secrete-key. These characteristics of a protocol can be achieved by using a less interactive reconciliation protocol which can handle a higher initial quantum bit error rate (QBER). In this paper, we use a simple Bose, Chaudhuri, Hocquenghem (BCH) error correction algorithm with simplified syndrome table to achieve an efficient reconciliation protocol which can handle a higher quantum bit error rate and outputs a common key with zero error probability. The proposed protocol efficient in removing errors such that it can remove all errors even if QBER is 60%. Assuming the post processing channel is an authenticated binary symmetric channel (BSC).

scholarly journals Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs

2018 ◽  
Vol 16 (07) ◽  
pp. 1850055 ◽  
Author(s):  
Linda Anticoli ◽  
Masoud Gharahi Ghahi
Keyword(s):  
Quantum Mechanics ◽  
Quantum Information ◽  
Data Structures ◽  
Quantum Key Distribution ◽  
Quantum Teleportation ◽  
Key Distribution ◽  
Quantum States ◽  
Tripartite Entanglement ◽  
Quantum Protocols

The notion of entanglement is the most well-known nonclassical correlation in quantum mechanics, and a fundamental resource in quantum information and computation. This correlation, which is displayed by certain classes of quantum states, is of utmost importance when dealing with protocols, such as quantum teleportation, cryptography and quantum key distribution. In this paper, we exploit a classification of tripartite entanglement by introducing the concepts of entangled hypergraph and evolving entangled hypergraph as data structures suitable to model quantum protocols which use entanglement. Finally, we present a few examples to provide applications of this model.

scholarly journals Post-processing procedure for industrial quantum key distribution systems

2016 ◽  
Vol 741 ◽  
pp. 012081 ◽  
Author(s):  
Evgeny Kiktenko ◽  
Anton Trushechkin ◽  
Yury Kurochkin ◽  
Aleksey Fedorov
Keyword(s):  
Quantum Key Distribution ◽  
Distribution Systems ◽  
Key Distribution ◽  
Post Processing ◽  
Processing Procedure

scholarly journals Beyond the Limits of Shannon’s Information in Quantum Key Distribution

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 229
Author(s):  
Luis Adrián Lizama-Pérez ◽  
J. Mauricio López R. ◽  
Emmanuel H. Samperio
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Processing Method ◽  
Communication Model ◽  
Noisy Channel ◽  
Secret Key ◽  
Post Processing ◽  
Quantum Bits ◽  
Processing Software ◽  
Error Percentage

We present a new post-processing method for Quantum Key Distribution (QKD) that raises cubically the secret key rate in the number of double matching detection events. In Shannon’s communication model, information is prepared at Alice’s side, and it is then intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice’s transmitted quantum bits but in Bob’s basis measurement choices. Therefore, measured bits are publicly revealed, while bases selections remain secret. Our method implements sifting, reconciliation, and amplification in a unique process, and it just requires a round iteration; no redundancy bits are sent, and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post-processing software into QKD technologies already in use.

Study on Quantum Key Distribution

2013 ◽  
Vol 275-277 ◽  
pp. 2515-2518
Author(s):  
Xiao Qiang Guo ◽  
Cui Ling Luo ◽  
Yan Yan
Keyword(s):  
Quantum Mechanics ◽  
Quantum Key Distribution ◽  
Secure Communication ◽  
Key Distribution ◽  
Secret Key ◽  
Bb84 Protocol

Quantum key distribution (QKD) uses quantum mechanics to guarantee secure communication. It enables two parties to produce a shared random secret key known only to them, which can then be used to encrypt and decrypt messages. QKD is a research hotspot of international academia in recent years. We introduce some protocols: BB84 protocol, E91 protocol, SARG04 protocol.

QUANTUM KEY EVOLUTION AND ITS APPLICATIONS

2012 ◽  
Vol 10 (04) ◽  
pp. 1250044 ◽  
Author(s):  
D. J. GUAN ◽  
YUAN-JIUN WANG ◽  
E. S. ZHUANG
Keyword(s):  
Quantum Key Distribution ◽  
Quantum Secure Direct Communication ◽  
Key Distribution ◽  
Secret Message ◽  
Secret Key ◽  
Direct Communication ◽  
Message Transmission

Quantum key distribution (QKD) enables two authenticated parties to share a perfectly secure key. However, repeatedly using the same key to encrypt many different messages is not perfectly secure. A trivial method to update the key is to use QKD to re-establish a new key for each message. In this paper, we present a method, called quantum key evolution (QKE), to update the secret key using less qubits. Hence, it is more efficient for long messages. More precisely, we present a secure and efficient protocol, called quantum message transmission (QMT) protocol, to transmit long secret message using less qubits than the methods of incorporating QKD with one-time pad, as well as some quantum secure direct communication (QSDC) protocols.

scholarly journals Beyond the Limits of Shannon’s Information in Quantum Key Distribution

2020 ◽  
Author(s):  
Luis Adrian Lizama-Pérez ◽  
J. Mauricio López ◽  
Emmanuel H. Samperio
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Processing Method ◽  
Communication Model ◽  
Noisy Channel ◽  
Secret Key ◽  
Post Processing ◽  
Quantum Bits ◽  
Processing Software ◽  
Error Percentage

We present a new post-processing method for Quantum Key Distribution (QKD) that raise cubically the secret key rate in the number of double matching detection events. In Shannon’s communication model information is prepared at Alice’s side then it is intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice’s transmitted quantum bits but in Bob’s basis measurement choices. Therefore measured bits are publicly revealed while bases selections remain secret. Our method implements sifting, reconciliation and amplification in a unique process, it just require a round iteration, no redundancy bits are sent and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post processing software into QKD technologies already in use.

Knapsack encoding for secured quantum key distribution protocol

2020 ◽  
Vol 35 (36) ◽  
pp. 2050295
Author(s):  
Partha Sarathi Goswami ◽  
Tamal Chakraborty ◽  
Abir Chattopadhyay
Keyword(s):  
Quantum Mechanics ◽  
Network Security ◽  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Quantum States ◽  
Interesting Problem ◽  
Quantum Key Distribution Protocol

Quantum cryptography has of late opened up the possibilities of exploiting the characteristics of quantum mechanics in the realm of network security. An interesting problem in cryptography is the distribution of the encryption key between the two parties involved in communication. This paper proposes a secure quantum key distribution protocol using the properties of super increasing knapsack sequences. The mapping from the knapsack sequences to the quantum states is achieved by rotating a three-bit quantum tuple.

scholarly journals Efficient High-Dimensional Quantum Key Distribution with Hybrid Encoding

Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 80 ◽  
Author(s):  
Yonggi Jo ◽  
Hee Park ◽  
Seung-Woo Lee ◽  
Wonmin Son
Keyword(s):  
Angular Momentum ◽  
Quantum Key Distribution ◽  
Degrees Of Freedom ◽  
Single Photon ◽  
Key Distribution ◽  
Quantum States ◽  
High Dimensional ◽  
Practical Implementation ◽  
Secret Key ◽  
Optical Elements

We propose a schematic setup of quantum key distribution (QKD) with an improved secret key rate based on high-dimensional quantum states. Two degrees-of-freedom of a single photon, orbital angular momentum modes, and multi-path modes, are used to encode secret key information. Its practical implementation consists of optical elements that are within the reach of current technologies such as a multiport interferometer. We show that the proposed feasible protocol has improved the secret key rate with much sophistication compared to the previous 2-dimensional protocol known as the detector-device-independent QKD.

scholarly journals Efficiency in Quantum Key Distribution Protocols with Entangled Gaussian States

2007 ◽  
Vol 14 (01) ◽  
pp. 69-80 ◽  
Author(s):  
C. Rodó ◽  
O. Romero-Isart ◽  
K. Eckert ◽  
A. Sanpera
Keyword(s):  
Quantum Key Distribution ◽  
Figure Of Merit ◽  
Degrees Of Freedom ◽  
Key Distribution ◽  
Quantum States ◽  
Entangled States ◽  
Secret Key ◽  
Gaussian States ◽  
Quantum Strategies ◽  
Specific Quantum

Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.

Sign in / Sign up

Export Citation Format

Share Document