Key Agreement Method Research Articles

Crowd Monitoring System Based on Unmanned Aerial Vehicles: Secure Key Agreement Scheme

Unmanned Arial Vehicles (UAVs) can be applied to survey or for monitoring huge crowd where conventional monitoring systems fail. Even though UAVs is proven to be effective way for monitoring and surveying there present a threat of data getting leaked when it is being transferred to the user’s device. To lessen these dangers a secure channel amid the user and the UAVs needs to be determined. There are multiple key agreement methods which is already present but they are either heavy authentication type or less secure to the attacks from the unscrupulous parties. In this paper, we provide an approach to mitigate such threats using a public key cryptographic method with a session-based authentication. The above-mentioned method is simulated using NS2 software and it’s efficiency will be recorded at the end.

WITHDRAWN: Design of Group Key Agreement Method Based on Elliptic Curve Cryptography in New Energy Extensive Access Security Protection

Aiming at the security problem of power system communication network under the condition of extensive access of new energy, we design the group key agreement method based on elliptic curve cryptography in the security protection of new energy extensive access. Design the architecture of power system security protection network under the condition of extensive access to new energy. The network architecture adopts wireless communication technology to realize the transmission of new energy security monitoring information. For the data confidentiality problem in the wire communication technology, the group key agreement method based on elliptic curve cryptography is proposed, and the group key agreement model is constructed under the set conditions, and the group key is generated through the processes of main parameter selection, group composite public key distribution, group key agreement protocol design, group key update protocol for node joining event, and group key update protocol for members departure event, etc. The group key is utilized for the communication. The experimental results show that this method can generate the key with high randomness and excellent key sensitivity, which can effectively resist the attacks of character frequency statistics and information entropy and guarantee the security of communication information.

Key Agreement on IoT Devices With Echo Profiling

Secure Device-to-Device (D2D) communication is important for the Internet-of-Things (IoT) devices. Key agreement between devices is the important first step in building a secure D2D channel. Due to the lack of third-party certification, key agreement for IoT devices has to rely on the untrusted channel between them, which makes the pairing process vulnerable to attacks such as eavesdropping, jamming, and predictable channel attack. We solve this problem with a novel key agreement method named, where two nearby devices can generate a symmetric key independently, leveraging the ambient sound signal that can be locally collected by devices. The intuition of this idea is that the propagation delays of the ambient sounds and the echoes will carry fine-grained information about the spatial context of the receiving device, which can be transformed to a special key for that device. So, nearby devices which have similar spatial context will generate similar echo profiles. We implement a prototype of and evaluate its performance in resisting different attacks. The results tell that, with, the key agreement process is even undetectable by an attacker which is only 50cm away from the pairing devices, and is thus resistant to all attacks mentioned above.

Chaotic Map-Based Authentication Scheme Using Physical Unclonable Function for Internet of Autonomous Vehicle

Autonomous Vehicles (AVs) are a highly discussed topic owing to their great performance and convenience. However, some requirements limit their wider deployment. Specifically, AV should be controlled by remote users during emergencies. It may lead to AV’s system facing the risk of being intruded on by a malicious party, resulting in unreasonable decisions. We, therefore, design the Internet of autonomous vehicle (IoAV) model to mitigate the problems arising from these limitations. To promote a secure remote control of the AV, a reliable authentication scheme, which can be used in IoAV, must be performed. Our proposed chaotic map-based authenticated key agreement (CMAKA) method provides secure remote control features for AVs. In this method, users, data centers, and AV establish a secure communication channel through the negotiation of three independent session keys. Furthermore, a physical unclonable function (PUF) is employed to produce a trusted private key during the authentication. The security of our scheme is evaluated using game hopping through the widespread Real-or-Random (ROR) model. Compared with other existing three-factor authentication schemes, the performance of our protocol is higher in both security requirements and total cost.

Development of A Novel Block Design Based Key Agreement Protocol for Cloud Environment to Improve Efficient Performance and Security

Cloud computing is one of the recent emerging technologies. Heavy data sharing among multiple users is an open issue. Data sharing in cloud computing enables multiple participants to freely share the group data, which improves the efficiency of work in cooperative environments and has widespread potential applications. However, how to ensure the security of data sharing within a group and how to efficiently share the outsourced data in a group manner are formidable challenges. In this paper we focused on security issues with the help of key agreement protocols to perform efficient data sharing in cloud environment. We proposed a novel block design based key agreement method in support of symmetric balanced incomplete block design (SBIBD). The main objective of this method is to supports multiple participants, which can flexibly extend the number of participants in a cloud environment according to the structure of the block design. Based on the proposed group data sharing model, we present general formulas for generating the common conference key K for multiple participants. In addition, the fault tolerance property of our protocol enables the group data sharing in cloud computing to withstand different key attacks, which is similar to Yi’s protocol.

A Lightweight Certificateless Group Key Agreement Method without Pairing Based on Blockchain for Smart Grid

In smart grids, the access verification of a large number of intelligent gateways and terminal devices has become one of the main concerns to ensure system security. This means that smart grids need a new key management method that is safe and efficient and has a low computational cost. Although a large number of scholars have conducted relevant research, most of these schemes cannot balance the computational overhead and security. Therefore, we propose a lightweight and secure key management method, having a low computational overhead, based on blockchain for smart grids. Firstly, we redesigned the architecture of the smart grid based on blockchain and completed the division of various entities. Furthermore, we designed a pairing-free certification authenticated group key agreement method based on blockchain under the architecture. Finally, we achieved higher security attributes, and lower authentication delay and computational overhead, compared to the traditional schemes, as shown in performance analysis and comparison.

Implementing lightweight key exchange solutions for WSN with LoRa connectivity

The emerging applications of wireless sensor networks and internet of things (IoT) require providing IP connectivity to any node in the network, which makes security a crucial issue to take into consideration. Due to the limited resources of connected nodes, new challenges taking into account these constraints have to be overcome. In this work, we investigate authenticated key agreement as a part of providing end-to-end security solutions for wireless sensor networks using LoRa connectivity. We present, along the way, a primer that describes general aspects of security in wireless sensor networks and IoT at different levels. We then discuss the investigated methods for authenticated key agreement. Particularly, we study and implement lightweight key agreement methods based on the standardised internet key exchange protocol. The evaluation is performed through experimentation to present a more realistic assessment that demonstrates communication costs in terms of power consumption and memory usage.

How is your Wi-Fi connection today? DoS attacks on WPA3-SAE

WPA3-Personal renders the Simultaneous Authentication of Equals (SAE) password-authenticated key agreement method mandatory. The scheme achieves forward secrecy and is highly resistant to offline brute-force dictionary attacks. Given that SAE is based on the Dragonfly handshake, essentially a simple password exponential key exchange, it remains susceptible to clogging type of attacks at the Access Point side. To resist such attacks, SAE includes an anti-clogging scheme. To shed light on this contemporary and high-stakes issue, this work offers a full-fledged empirical study on Denial of Service (DoS) against SAE. By utilizing both real-life modern Wi-Fi 6 certified and non-certified equipment and the OpenBSD’s hostapd, we expose a significant number of novel DoS assaults affecting virtually any AP. No less important, more than a dozen of vendor-depended and severe zero-day DoS assaults are manifested, showing that the implementation of the protocol by vendors is not yet mature enough. The fallout of the introduced attacks to the associated stations ranges from a temporary loss of Internet connectivity to outright disconnection. To our knowledge, this work provides the first wholemeal appraisal of SAE’s mechanism endurance against DoS, and it is therefore anticipated to serve as a basis for further research in this timely and intriguing area.

Efficient and Secure Biometric-Based User Authenticated Key Agreement Scheme with Anonymity

At present, a number of users employ an authentication protocol so as to enjoy protected electronic transactions in wireless networks. In order to establish an efficient and robust the transaction system, numerous researches have been conducted relating to authentication protocols. Recently, Kaul and Awasthi presented an user authentication and key agreement scheme, arguing that their scheme is able to resist various types of attacks and preserve diverse security properties. However, this scheme possesses critical vulnerabilities. First, the scheme cannot prevent two kinds of attacks, including off-line password guessing attacks and user impersonation attacks. Second, user anonymity rule cannot be upheld. Third, session key can be compromised by an attacker. Fourth, there is high possibility that the time synchronization trouble occurs. Therefore, we suggest an upgraded version of the user authenticated key agreement method that provides enhanced security. Our security and performance analysis shows that compared, to other associated protocols, our method not only improves the security level but also ensures efficiency.

사물인터넷에서 장치 사이의 부가 채널에 대한 안전도를 고려한 비밀키 설정 방법

사물인터넷에서 장치 사이의 부가 채널에 대한 안전도를 고려한 비밀키 설정 방법

A Self-Authentication and Deniable Efficient Group Key Agreement Protocol for VANET

With the rapid development of vehicular ad hoc Network (VANET), it is gaining significant popularity and receiving increasing attentions from academics and industry in security and efficiency. To address security and efficiency issues, a self-authentication and deniable efficient group key agreement protocol is proposed in this paper. This scheme establishes a group between road-side unit (RSU) and vehicles by using self-authentication without certification authority, and enhances certification efficiency by using group key (GK) transmission method. At the same time, to avoid the attacker to attack the legal vehicle by RSU, we adopt deniable group key agreement method to negotiation session key (sk) and use it to transmit GK between RSU. In addition, vehicles not only broadcast messages to other vehicles, but also communicate with other members in the same group. So group communication is necessary in VANET. Finally, the security and performance analysis shown that our scheme is security, meanwhile the verification delay, transmission overheard and message delay are more efficient than other related schemes in authentication, transmission and communication.

A robust and efficient bilinear pairing based mutual authentication and session key verification over insecure communication

Remote mutual authentication provides an efficient platform through which an user accesses several resources of the remote serve at anytime over insecure channel and makes their life more comfortable. In this context, lot of key agreement methods have been put forward for enhancing securities. Preserving complete security requirements of the authentication scheme are now becoming challenging research. Hsu et al. proposed similar type of work using bilinear pairing for improving the security weaknesses of the Fang’s scheme, and Das et al.’s scheme. We have studied Hsu et al.’s scheme and pointed out that the scheme is ill-suited since off-line password guessing and new smartcard issue attacks are possible in this scheme. It is our further study that Hsu et al.’s scheme is not preserving session key negotiation and mutual authentication. The same problems also exist in Fang’s scheme and Das et al.’s scheme. The objective of this article is to provide an efficient scheme, which resolves all the existing problems. The AVISPA simulation results on our scheme ensured that active and passive attacks are protected. The informal security discussion claims that the scheme resists all kinds of security attacks. We have shown that the performance of our scheme is relatively superior in comparison with existing works. As an application area, anyone can execute our protocol in multimedia big data environment for making secure connection between the client and server.

CPSec DLP: Kernel‐Level Content Protection Security System of Data Leakage Prevention

Data leakage prevention (DLP) is very important for sensitive or unauthorized data protection, however, most current DLP technologies are based on content monitor, detection and filtering, which can be easily bypassed or cheated. We propose a thorough and highlevel Content protection secure scheme of DLP (CPSec DLP) based on kernel-level mandatory encryption, in which we proposed mutual authentication and key agreement method between client and server, and we adopted SM2 algorithm for session key management; and we propose kernel-level mandatory secure middleware for unstructured data protection, in which the secure middleware works in File system driver (FSD) layer supporting for “write-encryption, open-decryption” operation, once the data is written to storage space either in hard-disk or USB disk the data is mandatorily encrypted, while when the data is open the mandatory secure middleware decrypts the data to plain in system memory. Moreover we propose data share and delivery among domain internal users and external customers. In the CPSec DLP scheme, the encryption algorithms, security policy and rules can be dynamically parameterized when necessary, while in the lifecycle the data management can only be used according to its usage control rules, such as read-only, write, save, print, export, backup rights. Upon the proposed CPSec DLP, we implemented the CPSec DLP system in kernel-level driver layer based on FSD, which supports parameterized process and document format for unstructured data leakage protection. Large amount of experiments manifest the proposed scheme is secure, reliable, extendible and efficient for kinds of format unstructured data leakage protection.

Securing Mobile Ad Hoc Networks Using Enhanced Identity-Based Cryptography

Recent developments in identity-based cryptography (IBC) have provided new solutions to problems related to the security of mobile ad hoc networks (MANETs). Although many proposals to solve problems related to the security of MANETs are suggested by the research community, there is no one solution that fits all. The interdependency cycle between secure routing and security services makes the use of IBC in MANETs very challenging. In this paper, two novel methods are proposed to eliminate the need for this cycle. One of these methods utilizes a key pool to secure routes for the distribution of cryptographic materials, while the other adopts a pairing-based key agreement method. Furthermore, our proposed methods utilize threshold cryptography for shared secret and private key generation to eliminate the “single point of failure” and distribute cryptographic services among network nodes. These characteristics guarantee high levels of availability and scalability for the proposed methods. To illustrate the effectiveness and capabilities of the proposed methods, they are simulated and compared against the performance of existing methods.

A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays

These days, with the emergence of the concept of ubiquitous computing, sensor networks that collect, analyze and process all the information through the sensors have become of huge interest. However, sensor network technology fundamentally has wireless communication infrastructure as its foundation and thus has security weakness and limitations such as low computing capacity, power supply limitations and price. In this paper, and considering the characteristics of the sensor network environment, we propose a group key agreement method using a keyset pre-distribution of two-dimension arrays that should minimize the exposure of key and personal information. The key collision problems are resolved by utilizing a polygonal shape’s center of gravity. The method shows that calculating a polygonal shape’s center of gravity only requires a very small amount of calculations from the users. The simple calculation not only increases the group key generation efficiency, but also enhances the sense of security by protecting information between nodes.

A Family of Key Agreement Mechanisms for Mission Critical Communications for Secure Mobile Ad Hoc and Wireless Mesh Internetworking

Future wireless networks like mobile ad hoc networks and wireless mesh networks are expected to play important role in demanding communications such as mission critical communications. MANETs are ideal for emergency cases where the communication infrastructure has been completely destroyed and there is a need for quick set up of communications among the rescue/emergency workers. In such emergency scenarios wireless mesh networks may be employed in a later phase for providing advanced communications and services acting as a backbone network in the affected area. Internetworking of both types of future networks will provide a broad range of mission critical applications. While offering many advantages, such as flexibility, easy of deployment and low cost, MANETs and mesh networks face important security and resilience threats, especially for such demanding applications. We introduce a family of key agreement methods based on weak to strong authentication associated with several multiparty contributory key establishment methods. We examine the attributes of each key establishment method and how each method can be better applied in different scenarios. The proposed protocols support seamlessly both types of networks and consider system and application requirements such as efficient and secure internetworking, dynamicity of network topologies and support of thin clients.