scholarly journals Two-Party Attribute-Based Key Agreement Protocol with Constant-Size Ciphertext and Key

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Jiguo Li ◽  
Shengzhou Hu ◽  
Yichen Zhang
Keyword(s):  
Key Agreement ◽  
Provable Security ◽  
Mutual Authentication ◽  
Session Key ◽  
Fine Grained ◽  
Key Agreement Protocol ◽  
Constant Size ◽  
Diffie Hellman ◽  
The Standard Model ◽  
The Cost

Based on mutual authentication, the session key is established for communication nodes on the open network. In order to satisfy fine-grained access control for cloud storage, the two-party attribute-based key agreement protocol (TP-AB-KA) was proposed. However, the existing TP-AB-KA protocol is high in the cost of computation and communication and is not unfit for application in a mobile cloud setting because mobile devices are generally resource constrained. To solve the above issue, we propose a TP-AB-KA protocol with constant-size ciphertext and key. Our TP-AB-KA protocol is provable security in the standard model. The concrete proof is given under the augmented multisequence of exponents' decisional Diffie-Hellman (aMSE-DDH) hypothesis in the attribute-based BJM model (AB-BJM). Compared with the existing TP-AB-KA protocols, the computation cost and communication cost of our protocol are largely reduced.

scholarly journals A Systematic Dynamic Key Agreement Mechanism for LTE Advanced Networks in the Internet of Things

2019 ◽  
Vol 9 (2S3) ◽  
pp. 302-307
Keyword(s):  
Elliptic Curve ◽  
Key Agreement ◽  
Mutual Authentication ◽  
Session Key ◽  
Machine Type ◽  
Key Agreement Protocol ◽  
Diffie Hellman ◽  
Communication Device ◽  
Lte Advanced ◽  
Machine Type Communication

Of late, Session Initiation Protocol (SIP) has become one of the popular signaling protocols especially for the multimedia communication system. Various protocols have been proposed by researchers to ensure access independence, authentication, and Key Agreement security characteristic. With the extensive growth of cellular networks, mobile traffic connected with the advancements of the wireless communication channel. In this scenario, Machine Type Communication (MTC) plays a crucial role in line with Long Term Evaluation-Advanced Networks as their communication happened between Machine to machine without human intervention. In order to reach Mobile Type Transmission (MTT) security condition, the access verification process required to pursue the verification and Key Agreement protocol. Moreover, the development of Group premised communication and individual authentication mechanisms to every Machine Type Communication device (MTTD) would lead to signal-congestion in real-time networking scenarios. Jinguo et al. proposed a Group-Based Verification and Key-Agreement protocol with dynamically updating policy for mutual authentication. Especially, they chose an asynchronous secret shared key merged to work with Diffie-Hellman protocol for establishing disjoint verification and session-key establishment across LTE Advanced Networks. However, the DH algorithm could not provide message integrity to upgrade the security feature namely integrity. In this paper, the algorithms Advanced Encryption Standard (AES) in addition to Elliptic Curve Diffie-Hellman (ECDH) can be integrated called an Elliptic Curve Digital Signature Algorithm (ECDSA)” which addresses verification and integrity.

scholarly journals Password Based Client-Server-User Authenticated Key Agreement Mechanism for Cloud System

2019 ◽  
Vol 8 (4) ◽  
pp. 12839-12841
Keyword(s):  
Key Agreement ◽  
Identity Management ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Impersonation Attack ◽  
Session Key ◽  
Replay Attack ◽  
Authentication Mechanism ◽  
Diffie Hellman ◽  
Cloud Server

The authentication is an essential concern in the cloud environment to restrict the unauthorized users to retrieve the files from cloud server. Moreover, authentication mechanisms are used to prevent illegal access of resources over insecure channel. Thus proposed work provides the strong and efficient authentication process in cloud computing environment by chebyshev polynomial based chaotic maps Diffie Hellman property. The proposed authentication mechanism does not disclose the identity of the user to CSP. Moreover proposed authentication mechanism enables mutual authentication, Identity management, and session-key agreement. The Proposed mechanism of security analysis includes the enabling mutual authentication and key agreement, restricting the impersonation attack, man in the middle attack and replay attack.

A Secure Two-Factor Remote User Authentication and Session Key Agreement Scheme

2016 ◽  
Vol 12 (2) ◽  
pp. 62-79 ◽  
Author(s):  
Preeti Chandrakar ◽  
Hari Om
Keyword(s):  
Key Agreement ◽  
User Authentication ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Session Key ◽  
Key Agreement Protocol ◽  
Remote User Authentication ◽  
Session Key Agreement ◽  
Man In The Middle ◽  
Remote User

In this article, the authors have proposed a secure two-factor remote user authentication and session key agreement protocol. As they have shown in the presented scheme, is precise and secure according to both formal and informal security analysis. For formal security analysis, they have applied BAN (Burrows-Abadi-Needham) logic which certifies that the presented scheme provides the amenity of mutual authentication and session key agreement safely. The informal security verification has shown that the proposed scheme is more vigorous against various sort of cruel threats. Moreover, the authors have simulated the presented scheme using broadly accepted AVISPA tool, whose simulation results make sure that the protocol is not dangerous from active and passive attacks together with replay and man-in-the-middle attacks. In addition, the performance evaluation and the security comparison have revealed that the presented scheme gives strong security as well as better complexity in the context of smart card memory requirement, communication cost and computation cost.

scholarly journals A Lightweight Key Agreement Protocol Based on Chinese Remainder Theorem and ECDH for Smart Homes

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1357 ◽  
Author(s):  
Yi Jiang ◽  
Yong Shen ◽  
Qingyi Zhu
Keyword(s):  
Smart Home ◽  
Key Agreement ◽  
Chinese Remainder Theorem ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Sensor Nodes ◽  
Replay Attack ◽  
Key Agreement Protocol ◽  
Diffie Hellman ◽  
Home Systems

Security and efficiency are the two main challenges for designing a smart home system. In this paper, by incorporating Chinese remainder theorem (CRT) into the elliptic curve Diffie–Hellman (ECDH), a lightweight key agreement protocol for smart home systems is constructed. Firstly, one-way hash authentication is used to identify the sensor nodes instead of mutual authentication to reduce the authentication cost. Secondly, the CRT is introduced to enhance the security of the original ECDH key agreement. Security analysis showed that the proposed protocol can validate the data integrity and resist the replay attack, the man-in-middle attack, and other attacks. Performance analysis and experiments showed that the protocol achieves high security with low communication and computation costs, and can be implemented in smart home systems.

scholarly journals A Lightweight Authenticated Key Agreement Protocol Using Fog Nodes in Social Internet of Vehicles

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Tsu-Yang Wu ◽  
Xinglan Guo ◽  
Lei Yang ◽  
Qian Meng ◽  
Chien-Ming Chen
Keyword(s):  
Key Agreement ◽  
Formal Analysis ◽  
Fog Computing ◽  
Mutual Authentication ◽  
The Internet ◽  
Time Data ◽  
Authenticated Key Agreement ◽  
Session Key ◽  
Internet Of Vehicles ◽  
Key Agreement Protocol

Recently, there has been rapid growth in the Internet of things, the Internet of vehicles, fog computing, and social Internet of vehicles SIoV , which can generate large amounts of real-time data. Now, researchers have begun applying fog computing to the SIoV to reduce the computing pressure on cloud servers. However, there are still security challenges in SIoV . In this paper, we propose a lightweight and authenticated key agreement protocol based on fog nodes in SIoV . The protocol completes the mutual authentication between entities and generates the session key for subsequent communication. Through a formal analysis of the Burrows–Abadi–Needham (BAN) logic, real-oracle random (ROR) model, and ProVerif, the security, validity, and correctness of the proposed protocol are demonstrated. In addition, informal security analysis shows that our proposed protocol can resist known security attacks. We also evaluate the performance of the proposed protocol and show that it achieves better performance in terms of computing power and communication cost.

Enhanced Attribute-Based Authenticated Key Agreement Protocol in the Standard Model

2014 ◽  
Vol 36 (10) ◽  
pp. 2156-2167
Author(s):  
Qiang LI ◽  
Deng-Guo FENG ◽  
Li-Wu ZHANG ◽  
Zhi-Gang GAO
Keyword(s):  
Standard Model ◽  
Key Agreement ◽  
Authenticated Key Agreement ◽  
Key Agreement Protocol ◽  
The Standard Model
Sign in / Sign up

Export Citation Format

Share Document