Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shou-Li Wu

dblp:380/8131 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Authentication and access control · 70% Hardware security and side channels · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control › authentication
authentication protocols
0.812024
A Privacy-Aware Provably Secure Smart Card Authentication Protocol Based on Physically Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2024
Hardware security and side channels › hardware security primitives
physical unclonable function
0.812024
A Privacy-Aware Provably Secure Smart Card Authentication Protocol Based on Physically Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2024
Authentication and access control › user authentication
smart card authentication
0.812024
A Privacy-Aware Provably Secure Smart Card Authentication Protocol Based on Physically Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2024
Authentication and access control
privacy-preserving authentication
0.212024
A Privacy-Aware Provably Secure Smart Card Authentication Protocol Based on Physically Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2024

Methods — techniques the papers use, named apart from their topics

formal security model · 0.8challenge-response pairs · 0.8
YearPublicationVenuePosition
2024 A Privacy-Aware Provably Secure Smart Card Authentication Protocol Based on Physically Unclonable Functions
abstract
For many industrial applications, the smart card is a necessary safety component in user authentication. Smart cards provided to the users are used in open and public places, making them susceptible to physical and cloning attacks. Thus, the opponent can break the authentication process without the smart card if the information is exposed. In addition, many existing authentication systems employ challenge-response pairs (CRPs) to identify users by creating large numbers of data on the server and spending much time looking for and comparing responses. To address these concerns, we propose a lightweight privacy-preserving authentication protocol in which the physically unclonable function is considered a necessary tool. The suggested technique avoids creating a significant number of CRPs on the server to identify users uniquely. Under formal security models, the proposed protocol is resistant to user impersonation attacks and session key disclosure attacks and achieves robust mutual authentication. Nonetheless, it is immune to other essential security vulnerabilities. Empirical performance analysis demonstrates its viability in comparison to prior works.
Chun-I Fan, Arijit Karati, Shou-Li Wu
IEEE Trans. Dependable Secur. Comput.3