Secure Communication via Key Generation with Quantum Measurement Advantage in the Telecom Band

2013 ◽  
Author(s):  
Prem Kumar ◽  
Horace Yuen ◽  
Yu-Ping Huang
Keyword(s):  
Quantum Measurement ◽  
Secure Communication ◽  
Key Generation

scholarly journals DECOY STATE QUANTUM KEY DISTRIBUTION

2005 ◽  
Vol 03 (supp01) ◽  
pp. 143-143 ◽  
Author(s):  
HOI-KWONG LO
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Key Distribution ◽  
Generation Rate ◽  
Key Generation ◽  
Long Distance ◽  
Decoy State ◽  
Bb84 Protocol ◽  
High Loss ◽  
Statistical Fluctuations

Quantum key distribution (QKD) allows two parties to communicate in absolute security based on the fundamental laws of physics. Up till now, it is widely believed that unconditionally secure QKD based on standard Bennett-Brassard (BB84) protocol is limited in both key generation rate and distance because of imperfect devices. Here, we solve these two problems directly by presenting new protocols that are feasible with only current technology. Surprisingly, our new protocols can make fiber-based QKD unconditionally secure at distances over 100km (for some experiments, such as GYS) and increase the key generation rate from O(η2) in prior art to O(η) where η is the overall transmittance. Our method is to develop the decoy state idea (first proposed by W.-Y. Hwang in "Quantum Key Distribution with High Loss: Toward Global Secure Communication", Phys. Rev. Lett. 91, 057901 (2003)) and consider simple extensions of the BB84 protocol. This part of work is published in "Decoy State Quantum Key Distribution", . We present a general theory of the decoy state protocol and propose a decoy method based on only one signal state and two decoy states. We perform optimization on the choice of intensities of the signal state and the two decoy states. Our result shows that a decoy state protocol with only two types of decoy states—a vacuum and a weak decoy state—asymptotically approaches the theoretical limit of the most general type of decoy state protocols (with an infinite number of decoy states). We also present a one-decoy-state protocol as a special case of Vacuum+Weak decoy method. Moreover, we provide estimations on the effects of statistical fluctuations and suggest that, even for long distance (larger than 100km) QKD, our two-decoy-state protocol can be implemented with only a few hours of experimental data. In conclusion, decoy state quantum key distribution is highly practical. This part of work is published in "Practical Decoy State for Quantum Key Distribution", . We also have done the first experimental demonstration of decoy state quantum key distribution, over 15km of Telecom fibers. This part of work is published in "Experimental Decoy State Quantum Key Distribution Over 15km", .

Tango Binary Search Tree Based Asymmetric Cryptographic Sensor Node Authentication for Secured Communication in Wireless Sensor Networks

2020 ◽  
Vol 18 (1) ◽  
pp. 55-63
Author(s):  
Antony Cynthia ◽  
V. Saravanan
Keyword(s):  
Secure Communication ◽  
Sensor Node ◽  
Data Communication ◽  
Search Tree ◽  
Binary Search ◽  
Sensor Nodes ◽  
Binary Search Tree ◽  
Security Level ◽  
Key Generation ◽  
Data Packets

Wireless sensor network (WSN) comprises the group of sensor nodes distributed to sense and monitor the environments and collects the data. Due to the distributed nature of the sensor nodes, security is a major role to access the confidential data and protect the unauthorized access. In order to improve the secure communication, authentication is essential process in WSN. A Tango Binary Search Tree based Schmidt Cryptographic Sensor Node Authentication (TBST-SCSNA) technique is introduced for secured data communication in WSN with higher authentication accuracy. Initially, the trust values for each sensor nodes are calculated for increasing the security in data communication. The sensor nodes in WSN are arranged in tango binary search tree based on the trust value. The nodes in tree are inserted or removed based on their deployment. After that, the Schmidt-Samoa cryptographic technique is applied for node authentication and secure data communication. The cryptographic technique comprises three processes key generation, encryption and decryption. In key generation phase, the public key (i. e., node_ID) are generated and distributed for the sensor nodes and private key is kept secret using Schmidt-Samoa algorithm. The root node is embedded with a key during the deployment and it is controlled the entire the sensor nodes in the path. A Parent node generates the keys for child node based on the ID of parent node. After the key generation, the sender node encrypts the data packet and transmits to receiver node in the tree with the receiver node ID. After that, the receiver node enters their private key and verifies it with already stored key at the time of key generation. If both keys are same, then the node is said to be authentic node. Otherwise, the sensor node is said to be a malicious node. The authentic node only receives the original data packets. This process gets repeated till all the nodes in the path verify their identities and performs the secure communication. Simulation is carried out with different parameters such as authentication accuracy, authentication time and security level with respect to a number of sensor nodes and a number of data packets. The results observed that the TBST-SCSNA technique efficiently improves the node authentication accuracy, security level with minimum time than the state-of-the-art-methods.

scholarly journals Quantum Key Distribution Based-on Refraction and Polarization Entanglement

2020 ◽  
Vol 8 (6) ◽  
pp. 2911-2918
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Key Distribution ◽  
Public Key ◽  
Entangled State ◽  
Key Generation ◽  
Secret Key ◽  
The Public ◽  
Encryption And Decryption ◽  
Refraction Factor

Cryptography is the specialty of encoding and decoding messages and exists as extended as the individuals have doubted from one another and need secure correspondence. The traditional techniques for encryption naturally depend on any among public key or secret key approaches. In general, the public key encryption depends on two keys, for example, public key and private key. Since encryption and decryption keys are different, it isn't important to safely distribute a key. In this approach, the difficult of the numerical issues is assumed, not demonstrated. All the security will be easily compromised if proficient factoring algorithms are found. In secret key encryption two clients at first create secret key, which is a long string of arbitrarily selected bits and safely shares between them. At that point the clients can utilize the secret key along with the algorithms to encryption and decryption information. The procedures are complicated and also planned such a way that every bit of output is based on every bit of input. There are two fundamental issues with secret key encryption; first one is that by breaking down the openly known encoding algorithms, it gets simpler to decrypt the message. The subsequent one is that it experiences key-conveyance issue. As a result of the ongoing improvements in quantum processing and quantum data hypothesis, the quantum computers presents genuine difficulties to generally utilized current cryptographic strategy. The improvement of quantum cryptography beat the deficiencies of old style cryptography and achieves these huge accomplishments by using the properties of infinitesimal articles, for example, photon with its polarization and entangled state. In this paper, Polarization by refraction based quantum key distribution (PR-QKD) is proposed for quantum key generation and distribution. The proposed work considers three basis of polarization such as rectilinear (horizontal and vertical), circular (left-circular and right-circular), ellipse (left-ellipse and rightellipse) and refraction factor. This quantum key can be used for secure communication between two users who are spatially separated and also offer intrusion detection ability to detect attackers. The theoretical approach and conceptual results are discussed in this paper.

scholarly journals Secure Key Pre-distribution in Wireless Sensor Networks Using Combinatorial Design and Traversal Design Based Key Distribution

2012 ◽  
pp. 100-106
Author(s):  
Saba Khalid ◽  
Faiyaz Ahmad ◽  
Mohd. Rizwan Beg
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Secure Communication ◽  
Combinatorial Design ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Key Generation ◽  
Deterministic Approach ◽  
Distribution Scheme ◽  
Dynamic Key

Security is an indispensable concern in Wireless Sensor Network (WSN) due to the presence of potential adversaries. For secure communication in infrastructure less sensor nodes various key pre distribution have been proposed. In this paper we have evaluated various existing deterministic, probabilistic and hybrid type of key pre distribution and dynamic key generation algorithms for distributing pair-wise, group-wise and network-wise keys and we have propose a key pre distribution scheme using deterministic approach based on combinatorial design and traversal design which will improve the resiliency and achieve sufficient level of security in the network. This design can be used where large number of nodes are to be deployed in the WSN.

scholarly journals Modified Device Key Generation Algorithm and A* Algorithm to Optimize the Security Measures Based on Trust Value in Device-to-Device Communications

2021 ◽  
Author(s):  
Gayathri VM ◽  
Supraja p ◽  
Razia Sulthana A ◽  
Mukunthan P
Keyword(s):  
Communication Networks ◽  
Secure Communication ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Key Generation ◽  
Security Measures ◽  
Neighboring Node ◽  
Generation Algorithm ◽  
Trust Value ◽  
Qos Parameters

Abstract Security plays a vital role in communication networks. Since the nodes are mobile in Mobile Ad-hoc Networks (MANET), they are vulnerable to different types of attacks. Because of its mobility nature any node can enter the network at any time based on the coverage of the network. No centralized mechanism is found to verify or authenticate the nodes that are arriving/leaving the network. An algorithm is proposed for secure communication between source and destination based on the QoS parameters is called Modified Device Key Generation Algorithm (MDKGA). This algorithm elects an agent node based on the QoS parameters. Agent node is responsible for secure key generation and distribution of keys among the nodes. The neighboring node selection is based on trust value which acts as a heuristic function to select the node using A* algorithm.Various performance metrics are also analyzed. Comparison study has been carried out between the protocols of MANET.

Sign in / Sign up

Export Citation Format

Share Document