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 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

Hiding Data in Plain Sight: Towards Provably Unbreakable Encryption with Short Secret Keys and One-Way Functions

2021 ◽  
Author(s):  
Mircea-Adrian Digulescu
Keyword(s):  
Encryption Scheme ◽  
Secret Key ◽  
Small Probability ◽  
Random Data ◽  
Computing Power ◽  
Plain Text ◽  
Secret Keys ◽  
The One ◽  
One Way Function ◽  
The Cost

It has long been known that cryptographic schemes offering provably unbreakable security exist, namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.

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.

FORMAL VERIFICATION OF BUNDLE AUTHENTICATION MECHANISM IN OSGi SERVICE PLATFORM: BAN LOGIC

2006 ◽  
Vol 16 (02) ◽  
pp. 153-173 ◽  
Author(s):  
YOUNG-GAB KIM ◽  
CHANG-JOO MOON ◽  
DONGWON JEONG ◽  
DOO-KWON BAIK
Keyword(s):  
Formal Verification ◽  
Service Provider ◽  
Exchange Mechanism ◽  
Ban Logic ◽  
Secret Key ◽  
Home Gateway ◽  
Authentication Mechanism ◽  
Shared Secret ◽  
Bundle Authentication ◽  
Shared Secret Key

Security is critical in a home gateway environment. Robust secure mechanisms must be put in place for protecting information transferred through a central location. In considering characteristics for the home gateway environment, this paper proposes a bundle authentication mechanism. We designed the exchange mechanism for transferring a shared secret key. This transports a service bundle safely in the bootstrapping step, by recognizing and initializing various components. In this paper, we propose a bundle authentication mechanism based on a MAC that uses a shared secret key created in the bootstrapping step. In addition, we verify the safety of the key exchange mechanism and bundle authentication mechanism using BAN Logic. From the verified result, we achieved goals of authentication. That is, the operator can trust the bundle provided by the service provider. The user who uses the service gateway can also express trust and use the bundle provided by the operator.

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.

scholarly journals A Shared Secret Key Initiated by EPR Authentication and Qubit Transmission Channels

IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 17753-17763 ◽  
Author(s):  
Abdulbast A. Abushgra ◽  
Khaled M. Elleithy
Keyword(s):  
Secret Key ◽  
Transmission Channels ◽  
Shared Secret ◽  
Shared Secret Key

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.

Sign in / Sign up

Export Citation Format

Share Document