Analysis of achievable distances of BB84 and KMB09 QKD protocols

2020 ◽  
Vol 18 (06) ◽  
pp. 2050033
Author(s):  
Muhammad Mubashir Khan ◽  
Asad Arfeen ◽  
Usama Ahsan ◽  
Saneeha Ahmed ◽  
Tahreem Mumtaz
Keyword(s):  
Single Photon ◽  
Short Pulse ◽  
Practical Implementation ◽  
Secret Key ◽  
Single Photon Detector ◽  
Short Pulse Laser ◽  
Quantum Particles ◽  
Quantum Protocols ◽  
Secret Keys ◽  
Shared Secret

Quantum key distribution (QKD) is a proven secured way to transmit shared secret keys using quantum particles. Any adversarial attempt to intercept and eavesdrop secret key results in generating errors alerting the legitimate users. Since QKD is constrained by quantum mechanics principles, the practical transmission of the key at a greater distance is an issue. In this paper, we discover and analyze the key factors associated with transmission media, hardware components and protocol implementation of the QKD system that causes hindrance in distance range. Practical implementation of BB84 and KMB09 protocols is discussed to determine the achievable distance given current technology. We find that by using ultra low loss fiber, short-pulse laser and superconducting nanowire single photon detector the maximum achievable distance for both of the quantum protocols is 250[Formula: see text]km.

Two semi-quantum secure direct communication protocols based on Bell states

2019 ◽  
Vol 34 (01) ◽  
pp. 1950004 ◽  
Author(s):  
Yuhua Sun ◽  
Lili Yan ◽  
Yan Chang ◽  
Shibin Zhang ◽  
Tingting Shao ◽  
...  
Keyword(s):  
Quantum Communication ◽  
Communication Protocols ◽  
Quantum Secure Direct Communication ◽  
Bell States ◽  
Secret Key ◽  
Direct Communication ◽  
Quantum Protocols ◽  
Shared Secret ◽  
Full Quantum ◽  
Qubit Efficiency

Quantum secure direct communication allows one participant to transmit secret messages to another directly without generating a shared secret key first. In most of the existing schemes, quantum secure direct communication can be achieved only when the two participants have full quantum ability. In this paper, we propose two semi-quantum secure direct communication protocols to allow restricted semi-quantum or “classical” users to participate in quantum communication. A semi-quantum user is restricted to measure, prepare, reorder and reflect quantum qubits only in the classical basis [Formula: see text]. Both protocols rely on quantum Alice to randomly prepare Bell states, perform Bell basis measurements and publish the initial Bell states, but the semi-quantum Bob only needs to measure the qubits in classical basis to obtain secret information without quantum memory. Security and qubit efficiency analysis have been given in this paper. The analysis results show that the two protocols can avoid some eavesdropping attacks and their qubit efficiency is higher than some current related quantum or semi-quantum protocols.

scholarly journals Higher Rate Secret Key Formation (HRKF) based on Physical Layer for Securing Vehicle-to-Vehicle Communication

2020 ◽  
Vol 8 (1) ◽  
pp. 140-160
Author(s):  
Inka Trisna Dewi ◽  
Amang Sudarsono ◽  
Prima Kristalina ◽  
Mike Yuliana
Keyword(s):  
Polynomial Regression ◽  
Formation Rate ◽  
Physical Layer ◽  
Test Results ◽  
Secret Key ◽  
Vehicle Communication ◽  
V2v Communication ◽  
Vehicle To Vehicle ◽  
Secret Keys ◽  
Shared Secret

One effort to secure vehicle-to-vehicle (V2V) communication is to use a symmetrical cryptographic scheme that requires the distribution of shared secret keys. To reduce attacks on key distribution, physical layer-based key formation schemes that utilize the characteristics of wireless channels have been implemented. However, existing schemes still produce a low bit formation rate (BFR) even though they can reach a low bit error rate (BER). Note that V2V communication requires a scheme with high BFR in order to fulfill its main goal of improving road safety. In this research, we propose a higher rate secret key formation (HRKF) scheme using received signal strength (RSS) as a source of random information. The focus of this research is to produce keys with high BFR without compromising BER. To reduce bit mismatch, we propose a polynomial regression method that can increase channel reciprocity. We also propose a fixed threshold quantization (FTQ) method to maintain the number of bits so that the BFR increases. The test results show that the HRKF scheme can increase BFR from 40% up to 100% compared to existing research schemes. To ensure the key cannot be guessed by the attacker, the HRKF scheme succeeds in producing a key that meets the randomness of the NIST test.

A Quantum Technology-Based LiFi Security Using Quantum Key Distribution

2021 ◽  
pp. 104-116
Author(s):  
Vinoth Kumar ◽  
V. R. Niveditha ◽  
V. Muthukumaran ◽  
S.Satheesh Kumar ◽  
Samyukta D. Kumta ◽  
...  
Keyword(s):  
Secret Key ◽  
Computing Power ◽  
Security Issues ◽  
Cryptographic Algorithm ◽  
Encrypt Data ◽  
Secret Keys ◽  
Shared Secret ◽  
Particle Nature ◽  
Quantum Technology ◽  
Shared Secret Key

Light fidelity (Li-Fi) is a technology that is used to design a wireless network for communication using light. Current technology based on wireless fidelity (Wi-Fi) has some drawbacks that include speed and bandwidth limit, security issues, and attacks by malicious users, which yield Wi-Fi as less reliable compared to LiFi. The conventional key generation techniques are vulnerable to the current technological improvement in terms of computing power, so the solution is to introduce physics laws based on quantum technology and particle nature of light. Here the authors give a methodology to make the BB84 algorithm, a quantum cryptographic algorithm to generate the secret keys which will be shared by polarizing photons and more secure by eliminating one of its limitations that deals with dependency on the classical channel. The result obtained is sequence of 0 and 1, which is the secret key. The authors make use of the generated shared secret key to encrypt data using a one-time pad technique and transmit the encrypted data using LiFi and removing the disadvantage of the existing one-time pad technique.

scholarly journals ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH

2012 ◽  
Vol 04 (04) ◽  
pp. 1250053 ◽  
Author(s):  
YOSHIHIRO INDO ◽  
TAKAAKI MIZUKI ◽  
TAKAO NISHIZEKI
Keyword(s):  
Sufficient Condition ◽  
Computational Power ◽  
Necessary And Sufficient Condition ◽  
Secret Key ◽  
Secure Multicast ◽  
Multicast Protocol ◽  
Secret Keys ◽  
Shared Secret ◽  
Secure Message Transmission ◽  
Necessary And Sufficient

Assume that there are players and an eavesdropper Eve of unlimited computational power and that several pairs of players have shared secret keys beforehand. In a key sharing graph, each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players corresponding to the ends of the edge. Given a key sharing graph, a player wishes to send a message to another player so that the eavesdropper Eve and any other player can get no information on the message. In this paper, we first give a necessary and sufficient condition on a key sharing graph for the existence of such a unicast protocol. We then extend the condition to the case where a multiple number of players other than the sender and receiver passively collude. We finally give a sufficient condition for the existence of a secure multicast protocol.

AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT

2011 ◽  
Vol 22 (05) ◽  
pp. 1211-1227 ◽  
Author(s):  
TAKAAKI MIZUKI ◽  
SATORU NAKAYAMA ◽  
HIDEAKI SONE
Keyword(s):  
Probability Distribution ◽  
Key Agreement ◽  
Key Exchange ◽  
Secret Key ◽  
Exchange Graph ◽  
Secret Keys ◽  
Shared Secret ◽  
Secret Key Agreement

Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We regard each player as a vertex of a graph and regard each pair of players sharing a key as an edge. Consider the case where Eve knows some of the keys according to a certain probability distribution. In this paper, applying the technique of st-numbering, we propose a protocol which allows any two designated players to agree on a secret key through such a "partially leaked key exchange graph." Our protocol is optimal in the sense that Eve's knowledge about the secret key agreed on by the two players is as small as possible.

scholarly journals Public key cryptosystem based on multiple chaotic maps for image encryption

2021 ◽  
Vol 22 (3) ◽  
pp. 1457
Author(s):  
Yousif S. Najaf ◽  
Maher K. Mahmood Al-Azawi
Keyword(s):  
Chaotic Maps ◽  
Third Party ◽  
Public Key ◽  
Secret Key ◽  
Chebyshev Map ◽  
Key Space ◽  
Public Keys ◽  
Secret Keys ◽  
Shared Secret ◽  
Multiple Chaotic Maps

Image is one of the most important forms of information. In this paper, two public key encryption systems are proposed to protect images from various attacks. Both systems depend on generating a chaotic matrix (<em>I</em>) using multiple chaotic maps. The parameters for these maps are taken from the shared secret keys generated from Chebyshev map using public keys for Alice and secret key for Bob or vice versa. The second system has the feature of deceiving the third party for searching for fake keys. Analysis and tests showed that the two proposed systems resist various attacks and have very large key space. The results are compared with other chaos based systems to show the superiority of these two proposed systems.

scholarly journals A Double-Key Based Encryption-Decryption Process for Stronger Secured Message Transactions

2020 ◽  
Vol 6 (1) ◽  
pp. 75-80
Author(s):  
Md Ismail Jabiullah ◽  
AA Md Monzur Ul Akhir ◽  
Muhammed Rasheduzzaman
Keyword(s):  
Information Transfer ◽  
Message Authentication ◽  
Secret Key ◽  
Authentication Code ◽  
P 75 ◽  
Secret Keys ◽  
Shared Secret ◽  
Encryption Decryption ◽  
Python Programming ◽  
Shared Secret Key

A double-key based stronger secured electronic message transaction system has been designed and developed using Python programming language by performing encryption-decryption process. To do this, simple cryptographic encryption and decryption techniques are used with two keys avoiding vulnerabilities of a single key. First, the intended message is encrypted with the private key of sender (PRa) and the output is again encrypted with a shared secret key (K1) that generates ciphertext. The output ciphertext is again encrypted with another shared secret key (K2) that generates a code that serves as Message Authentication Code (MAC), which is concatenated with the ciphertext. And again encrypted them with shared secret key K1 that produced final ciphertext which is to be send to the intending recipient. The shared secret keys K1 and K2 are getting from the key distribution center (KDC). In the receiving end, receiver first decrypts the received information with the shared secret key K1 that gives the ciphertext and MAC of the ciphertext, and then decrypts only the MAC to generate a new ciphertext′and compare the new ciphertext′ with the received ciphertext that ensures the ciphertext authentication as well as message authentication; if ciphertexts are found same, then the ciphertext is decrypted with shared secret key K2 and again is decrypted with the sender’s public key (PUa) and retrieve the message; otherwise discarded. This proposed system ensures the stronger authenticated message transactions among the communicants. Finally, a comparative study with the existing systems has also been performed and measured stronger security. This technique can be applied for any secured electronic information transfer system with stronger security services. GUB JOURNAL OF SCIENCE AND ENGINEERING, Vol 6(1), Dec 2019 P 75-80

scholarly journals An optical scheme for quantum multi-service network

2012 ◽  
Vol 12 (7&8) ◽  
pp. 620-629
Author(s):  
Fabio Alencar Mendonca ◽  
Daniel Barbosa de Brito ◽  
Rubens Viana Ramos
Keyword(s):  
Optical Networks ◽  
Quantum Key Distribution ◽  
Single Photon ◽  
Quantum Secure Direct Communication ◽  
Quantum Secret Sharing ◽  
Optical Scheme ◽  
Single Photon Detector ◽  
Service Network ◽  
Quantum Protocols ◽  
Fiber Link

Several quantum protocols for data security having been proposed and, in general, they have different optical implementations. However, for the implementation of quantum protocols in optical networks, it is highly advantageous if the same optical setup can be used for running different quantum communication protocols. In this direction, here we show an optical scheme that can be used for quantum key distribution (QKD), quantum secure direct communication (QSDC) and quantum secret sharing (QSS). Additionally, it is naturally resistant to the attack based on single-photon detector blinding. At last, we show a proof-of-principle experiment in 1 km optical fiber link that shows the feasibility of the proposed scheme.

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.

Sign in / Sign up

Export Citation Format

Share Document