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

Xiaohu Shan

dblp:359/5385 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0002-1435-6652ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 · 28% Cryptographic protocols and secure computation · 28% Cryptographic primitives and cryptanalysis · 28%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › integrity auditing
cloud storage auditing
0.912025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Cyber-physical and IoT security › industrial control system security
industrial iot security
0.912025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Cryptographic primitives and cryptanalysis
message authentication codes
0.912025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Hardware security and side channels › hardware security primitives
physical unclonable function
0.312025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Privacy and data protection
privacy-preserving data sharing
0.312025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025

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

physical unclonable function · 0.9message authentication code · 0.9
YearPublicationVenuePosition
2026 AMBER: Robust Federated Learning Based on Client Verification
Xiaohu Shan, Haiyang Yu 0001, Yuwen Chen 0002, Zhen Yang 0004
IEEE Trans. Inf. Forensics Secur.1
2025 S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT
abstract
The rapid development of the Industrial Internet of Things (IIoT) has led to an explosion of industrial data. Due to computing and storage capacity limitations, IIoT devices often outsource the collected data to remote cloud servers. Unfortunately, cloud storage and cloud sharing services are not as reliable as they claim to be. Existing schemes aim to check data integrity in the cloud through cloud auditing. However, they suffer from a number of security and privacy vulnerabilities. The challenge of designing a secure storage auditing framework for industrial IoT comes from two aspects: 1) lack of physical protection of data owner IIoT devices; 2) privacy issues due to auditing of sensitive shared data. Inspired by the aforementioned challenges, we design the secure storage audit framework to support flexible cloud data sharing in IIoT: S2A-P2FS. The first contribution in our work is the Polynomial Prefix Message Authentication Code(P2MAC) design. We design an innovative P2MAC data structure as a label, which can simultaneously achieve efficient data verification in cloud data storage and privacy protection in flexible cloud data sharing for cloud auditing. The second contribution is the design of a unique Physical Unclonable Function(PUF) for IIoT. Harsh industrial conditions hinder the stable operation of PUFs. To protect the trustness of IIoT data owners, we propose a robust PUF-based physical protection mechanism for IIoT devices. The key point is that the required key is not stored in the memory of IIoT but hidden within its physical structure. A security analysis was conducted to demonstrate the robustness of S2A-P2FS against known vulnerabilities. A prototype was implemented in a real-world IIoT scenario. Experimental results indicate that, compared to state-of-the-art schemes, S2A-P2FS achieves over a 3x speedup in computational time and requires only 67.5% of the communication cost.
Xiaohu Shan, Haiyang Yu 0001, Yurun Chen 0002, Yuwen Chen 0002, Zhen Yang 0004
IEEE Trans. Mob. Comput.1
2023 Physical Unclonable Function-Based Lightweight and Verifiable Data Stream Transmission for Industrial IoT
abstract
The deep integration of informatization and industrialization has resulted in an increasingly close connection between supervisory control and data acquisition (SCADA) systems and the Internet. The boundaries of the SCADA system are monitored by industrial smart sensors, which only have limited security protection and face severe security threats. One major threat is that smart sensors are vulnerable to physical attacks because they are often installed in unsafe areas far from plant protection. Under this attack, the data of sensors can be easily tampered with. Moreover, since sensors are resource-constrained physical devices, complex and expensive encryption algorithms are not applicable. In this paper, we design a lightweight industrial smart sensor data stream integrity verification scheme based on physical unclonable function (PUF) for industrial IoT, which can protect the physical security of sensors and the integrity of data streams to ensure the secure transmission of industrial smart sensor data streams. We utilize PUF, fuzzy extractor and bit selection algorithm to generate stable PUF responses. A malicious attacker cannot extract the key information through physical attack. In addition, we design a lightweight integrity verification algorithm with efficient key updating based on lightweight cryptographic primitives, making it suitable for resource-constrained physical devices. We perform the security analysis to demonstrate the security of the scheme to known security vulnerabilities. We implement the proposed scheme and evaluate the performance of our scheme with extensive experiments. The experimental results show the scheme is efficient and superior to existing schemes in computational and communication efficiency.
Xiaohu Shan, Haiyang Yu 0001, Yuwen Chen 0002, Zhen Yang 0004
IEEE Trans. Ind. Informatics1