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

Hangxing Wei

dblp:325/9609 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0005-6418-4392ORCID · reported

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

Computer networks · 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
Cyber-physical and IoT security · 50% Authentication and access control · 50%
Computer networks
1 paper
Edge and fog computing · 100%

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

TopicWeightPapersLastEvidence papers
Cyber-physical and IoT security
vehicular network security
1.012026
PV-STR: An Efficient Pseudonym Verification Scheme With Spatial-Temporal Revocation in IoVs · IEEE Trans. Mob. Comput. 2026

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

distributed caching · 2.0batch verification · 2.0
YearPublicationVenuePosition
2026 PV-STR: An Efficient Pseudonym Verification Scheme With Spatial-Temporal Revocation in IoVs
abstract
Pseudonym certificates play a crucial role in providing authorized access in vehicular networks with fine-grained privacy demands. However, the revocation of pseudonym certificates in large-scale, resource-constrained context has posed a significant challenge. The global revocation status is susceptible to disruption by localized anomalous events. Moreover, as the scale of revocation grows, the synchronization process becomes increasingly vulnerable to attacks and incurs high overhead. To decouple the global revocation status from local revocation events, we propose a spatial-temporal pseudonym revocation and verification framework that supports batch pseudonym revocation within resilient revocation cycles. Revoked pseudonyms within the event area are locally filtered, while other pseudonyms are characterized by maintaining a proof to attest their consistent and legitimate status. To improve the efficiency of revocation status updates and mitigate centralization risks, a distributed caching and proof update strategy assisted by edge nodes is presented. Extensive simulations based on real-world large-scale datasets demonstrate that PV-STR scheme significantly reduces the vulnerability window, communication overhead, and memory consumption compared to state-of-the-art approaches.
Yajun Ma, Enshu Wang, Bingyi Liu, Hangxing Wei, Jing Wang 0036
IEEE Trans. Mob. Comput.6