Key agreement protocols and their security analysis

1997 ◽  
pp. 30-45 ◽  
Author(s):  
Simon Blake-Wilson ◽  
Don Johnson ◽  
Alfred Menezes
Keyword(s):  
Key Agreement ◽  
Security Analysis ◽  
Agreement Protocols

scholarly journals A Light and Anonymous Three-Factor Authentication Protocol for Wireless Sensor Networks

Symmetry ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 46
Author(s):  
Lianghong Zhu ◽  
Huaikun Xiang ◽  
Kai Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Agreement ◽  
Security Analysis ◽  
Wireless Sensor ◽  
Cryptographic Primitives ◽  
Logic Verification ◽  
And Performance ◽  
Agreement Protocols ◽  
Three Factor

Recently, wireless sensor networks (WSNs) have been widely used in a variety of fields, and make people’s lives more convenient and efficient. However, WSNs are usually deployed in a harsh and insecure environment. Furthermore, sensors with limited hardware resources have a low capacity for data processing and communication. For these reasons, research on efficient and secure real-time authentication and key agreement protocols based on the characteristics of WSNs has gradually attracted the attention of academics. Although many schemes have been proposed, most of them cannot achieve all known security features with satisfactory performance, among which anonymity, N-Factor security, and forward secrecy are the most vulnerable. In order to solve these shortcomings, we propose a new lightweight and anonymous three-factor authentication scheme based on symmetric cryptographic primitives for WSNs. By using the automated security verification tool ProVerif, BAN-logic verification, and an informal security analysis, we prove that our proposed scheme is secure and realizes all known security features in WSNs. Moreover, we show that our proposed scheme is practical and efficient through the comparison of security features and performance.

scholarly journals Privacy-Preserving Two-Factor Key Agreement Protocol Based on Chebyshev Polynomials

2021 ◽  
Vol 2021 ◽  
pp. 1-21
Author(s):  
Zuowen Tan
Keyword(s):  
Chebyshev Polynomials ◽  
Key Agreement ◽  
Chaotic Maps ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Security Requirements ◽  
Security Level ◽  
Authenticated Key Agreement ◽  
Practical Applications ◽  
Agreement Protocols

Two-factor authentication is one of the widely used approaches to allow a user to keep a weak password and establish a key shared with a server. Recently, a large number of chaotic maps-based authentication mechanisms have been proposed. However, since the Diffie–Hellman problem of the Chebyshev polynomials defined on the interval [−1,+1] can be solved by Bergamo et al.’s method, most of the secure chaotic maps-based key agreement protocols utilize the enhanced Chebyshev polynomials defined on the interval (−∞,+∞). Thus far, few authenticated key agreement protocols based on chaotic maps have been able to achieve user unlinkability. In this paper, we take the first step in addressing this problem. More specifically, we propose the notions of privacy in authenticated key agreement protocols: anonymity-alone, weak unlinkability, medium unlinkability, and strong unlinkability. Then, we construct two two-factor authentication schemes with medium unlinkability based on Chebyshev polynomials defined on the interval [−1,1] and (−∞,+∞), respectively. We do the formal security analysis of the proposed schemes under the random oracle model. In addition, the proposed protocols satisfy all known security requirements in practical applications. By using Burrows-Abadi-Needham logic (BAN-logic) nonce verification, we demonstrate that the proposed schemes achieve secure authentication. In addition, the detailed comparative security and performance analysis shows that the proposed schemes enable the same functionality but improve the security level.

Novel multi-party quantum key agreement protocols under collective noise

2021 ◽  
pp. 2150137
Author(s):  
Jie Tang ◽  
Lei Shi ◽  
Jiahua Wei ◽  
Yang Xue ◽  
Huicun Yu
Keyword(s):  
Key Agreement ◽  
Security Analysis ◽  
Bell States ◽  
Quantum Key Agreement ◽  
The Novel ◽  
Collective Noise ◽  
Shared Key ◽  
The Relationship ◽  
Agreement Protocols ◽  
Qubit Efficiency

Based on the logic Bell states, we present two novel multi-party quantum key agreement (QKA) protocols under collective noise. The proposed protocols make full use of four-qubit logic Bell states as quantum resources and perform the novel encoding operation to generate the shared key. The security analysis shows that these two protocols can resist against both participant and outsider attacks. Furthermore, compared with the other existing multi-party QKA protocols over collective noise, our protocols have higher qubit efficiency. Finally, we perform the simulation of the relationship between efficiency and security, which is completely consistent with the conclusion of the security analysis of the protocols.

Sign in / Sign up

Export Citation Format

Share Document