2013
DOI: 10.3390/s130809589
|View full text |Cite
|
Sign up to set email alerts
|

An Advanced Temporal Credential-Based Security Scheme with Mutual Authentication and Key Agreement for Wireless Sensor Networks

Abstract: Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
84
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 123 publications
(84 citation statements)
references
References 17 publications
0
84
0
Order By: Relevance
“…Later Xu and Wang [38] and Turkanovic and Hölbl [39] state that Das et al's [36] protocol is imperfection and not applicable for practical implementation and then they both proposed the solution for the improvement. Li et al [40] and Turkanovic and Hölbl [39] also presented some vulnerabilities of Xue et al's [37] protocol and provide better solution.…”
Section: Literature Reviewmentioning
confidence: 92%
“…Later Xu and Wang [38] and Turkanovic and Hölbl [39] state that Das et al's [36] protocol is imperfection and not applicable for practical implementation and then they both proposed the solution for the improvement. Li et al [40] and Turkanovic and Hölbl [39] also presented some vulnerabilities of Xue et al's [37] protocol and provide better solution.…”
Section: Literature Reviewmentioning
confidence: 92%
“…S j first checks the validity of the timestamp T c ' and if it is valid, it further computes M 4 ' = h(ID i ||X s ), using its own secret number X s . After that S j computes M 5 5 , it confirms that the login request message is replayed. Otherwise, S j updates M 5 with M 5 ' in its database.…”
Section: Authentication Phasementioning
confidence: 96%
“…As discussed in [2,3,4,5,6,24], the stolen-verifier attack means that, if an attacker has stolen a verifier table stored in the data base of server S, then the adversary can use these values to perform various major cryptographic attacks like user impersonate, server masquerade, replay and can frame the session key which is framed between the legal user and the remote server.…”
Section: Through Stolen Verifier Table (Data Stored In the Datamentioning
confidence: 99%
See 1 more Smart Citation
“…It enhances security fundaments without considerably expanding the memory requirements. In [24], Li et al pointed out that scheme [23] is unable to protect against stolen-verifier attacks, denial of service attacks, smart card theft, and participant's signing attacks. Turkanovic et al presented a secure hash function-based user prediction and secure key management protocol [25] that ensures security with low energy consumption.…”
Section: Literature Reviewmentioning
confidence: 99%