<scp>PSAK</scp>: A provably secure authenticated key agreement scheme based on extended Chebyshev chaotic maps for smart grid environments

Wang, Cong; Li, Xiaohang; Zhou, Tong; Xu, Guangquan; Xiong, Naixue; Zhang, Yiying

doi:10.1002/ett.4752

Cited by 2 publications

(4 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cui et al [14] proposed a full session key agreement scheme based on Chebyshev polynomials for the vehicular ad-hoc network, which avoids the modular multiplication index or scalar multiplication on the elliptic curve by using Chebyshev polynomials. Wang et al [15] developed a secure authentication key agreement scheme for smart grid environments.…”

Section: Related Workmentioning

confidence: 99%

“…Chebyshev polynomials present two challenging computational problems that make them suitable for designing cryptographic protocols like key agreement and remote authentication. These issues are referred to as CMBDLP and CMBDHP [6,13,15,19].…”

Section: Computational Problems Of Chebyshev Polynomialsmentioning

confidence: 99%

“…In this paper, there exist two types of participants P, namely Node i and U n . According to the summary of the CK threat model by Abbasinezhad-Mood and Nikooghadam [13] and Wang et al [15], there are seven operations that attacker A can carry out, which include:…”

Section: Threat Modelmentioning

confidence: 99%

“…where r abd s are both positive integers and x 2 ½− 1; 1 [8,17,24]. This property allows compounding Chebyshev polynomials to obtain a new polynomial [15].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Secure Anonymous Identity-Based Virtual-Space Agreement Method for Crowds-Based Anonymous Communicate Scheme

Lin,

Wang,

Shang

et al. 2023

IET Information Security

View full text Add to dashboard Cite

Anonymous data exchange is in great demand in many situations, especially in remote control systems, in which a stable, secure, and secret data channel must be established between the controlling and controlled parties to distribute control commands and return data. In the previous work, we built a two-level Virtual-Space anonymous communication scheme based on the Crowds System for performing secret data exchange in remote control systems. However, as an essential part of security and anonymity, participating nodes’ identity declaration and session key agreement phases were not well designed. In this paper, we redesign the identity agreement and declaration process and design an identity-based Virtual-Space agreement method using the extended Chebyshev Chaotic Maps. In this approach, we transform the identity declaration process into a multilevel Virtual-Space agreement problem, where a series of security-progressive Virtual-Space addresses are negotiated between the controller and the controlled nodes. The protocol can handle the case where there are multiple controllers in the system, and the negotiated Virtual-Space depends on the identity of the controller and the controlled node, so different controllers do not affect each other. The designed protocol is verified on Freenet, and we conclude this paper with a detailed security analysis of the method to prove that the method satisfies forward security.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Computational Problems Of Chebyshev Polynomialsmentioning

confidence: 99%

Section: Threat Modelmentioning

confidence: 99%

“…where r abd s are both positive integers and x 2 ½− 1; 1 [8,17,24]. This property allows compounding Chebyshev polynomials to obtain a new polynomial [15].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations