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

Hui Zhang 0140

dblp:181/2846-140 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0001-2120-0808ORCID · conflict

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Security 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 60% Cloud and datacenter computing · 40%
Network and information security
2 papers
Cryptographic protocols and secure computation · 62% Cryptographic primitives and cryptanalysis · 19% Security and privacy of machine learning · 19%
Computer networks
2 papers
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cloud storage
cloud storage auditing
1.622025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
Edasvic: Enabling Efficient and Dynamic Storage Verification for Clouds of Industrial Internet Platforms · IEEE Trans. Inf. Forensics Secur. 2024
Storage systems
storage reliability
1.622025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
Edasvic: Enabling Efficient and Dynamic Storage Verification for Clouds of Industrial Internet Platforms · IEEE Trans. Inf. Forensics Secur. 2024
Internet of things and sensor networks
industrial iot
1.122025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks · IEEE/ACM Trans. Netw. 2024
Storage systems › data auditing
data integrity verification
0.912025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
Security and privacy of machine learning
federated learning security
0.812024
EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks · IEEE/ACM Trans. Netw. 2024
Cryptographic protocols and secure computation › secure aggregation
verifiable aggregation
0.812024
EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks · IEEE/ACM Trans. Netw. 2024
Cryptographic protocols and secure computation
verifiable computation
0.812024
EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks · IEEE/ACM Trans. Netw. 2024
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.812024
EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks · IEEE/ACM Trans. Netw. 2024
Cryptographic protocols and secure computation
commitment schemes
0.312025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis
hash functions
0.312025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis › hash functions
homomorphic hashing
0.312025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment
0.312025
Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks · IEEE Trans. Computers 2025

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

polynomial commitment · 3.4homomorphic hash · 2.6weighted aggregation verification · 1.5zero-knowledge proofs · 0.8zero-knowledge proof · 0.8homomorphic authenticator · 0.8authenticator accumulator · 0.8
YearPublicationVenuePosition
2025 Efficient and Secure Storage Verification in Cloud-Assisted Industrial IoT Networks
abstract
The rapid development of Industrial IoT (IIoT) has caused the explosion of industrial data, which opens up promising possibilities for data analysis in IIoT networks. Due to the limitation of computation and storage capacity, IIoT devices choose to outsource the collected data to remote cloud servers. Unfortunately, the cloud storage service is not as reliable as it claims, whilst the loss of physical control over the cloud data makes it a significant challenge in ensuring the integrity of the data. Existing schemes are designed to check the data integrity in the cloud. However, it is still an open problem since IIoT devices have to devote lots of computation resources in existing schemes, which are especially not friendly to resource-constrained IIoT devices. In this paper, we propose an efficient storage verification approach for cloud-assisted industrial IoT platform by adopting a homomorphic hash function combined with polynomial commitment. The proposed approach can efficiently generate verification tags and verify the integrity of data in the industrial cloud platform for IIoT devices. Moreover, the proposed scheme can be extended to support privacy-enhanced verification and dynamic updates. We prove the security of the proposed approach under the random oracle model. Extensive experiments demonstrate the superior performance of our approach for resource-constrained devices in comparison with the state-of-the-art.
Haiyang Yu 0001, Hui Zhang 0140, Zhen Yang 0004, Yuwen Chen 0002, Huan Liu 0001
IEEE Trans. Computers2
2024 Edasvic: Enabling Efficient and Dynamic Storage Verification for Clouds of Industrial Internet Platforms
abstract
Industrial Internet platforms (IIP) can provide many intelligent services based on the industrial big data stored in clouds. However, the vulnerability of cloud storage can cause data corruption, demanding verifying its integrity. Unfortunately, existing cloud storage verification approaches cannot be directly applied to IIP, since they pose heavy computational burdens on the edge side. In this work, we propose an efficient and dynamic storage verification scheme Edasvic for cloud storage in the IIP. We adopt the polynomial commitment to build an efficient homomorphic authenticator, and further design an authenticator accumulator, which can be efficiently generated with limited computational overheads. In addition, we integrate the dynamic information into the authenticator accumulator to support data dynamics. The security of Edasvic is analyzed under the random oracle model. We conduct extensive experiments to evaluate the performance of Edasvic and compare it with the state-of-the-art approaches. Experimental results affirm that Edasvic is superior to existing solutions in terms of computational efficiency.
Haiyang Yu 0001, Hui Zhang 0140, Zhen Yang 0004, Shui Yu 0001
IEEE Trans. Inf. Forensics Secur.2
2024 EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks
abstract
The rapid development of Industrial IoT (IIoT) opens up promising possibilities for data analysis and machine learning in IIoT networks. As a distributed paradigm, federated learning (FL) allows numerous IIoT devices to collaboratively train a global model without collecting their local data together in central servers. Unfortunately, a centralized server used to aggregate local gradients can be compromised and forge the result, which incurs the need for aggregation verification. Several approaches focusing on verifying the correctness of aggregation have been proposed. However, it is still an open problem since devices have to devote more computation resources for verification, which are especially not friendly to resource-constrained IIoT devices. Furthermore, verifying weighted aggregation has not been supported in existing approaches. In this paper, we propose an efficient verifiable federated learning approach for IIoT networks, which verifies the aggregation of gradients and requires lowest burden on IIoT devices by introducing zero-knowledge proof techniques. Moreover, our design supports weighted aggregation verification to validate the aggregation of weighted gradients in the cloud server. By comparing the proposed approach with the state-of-the-art schemes including VerifyNet and VeriFL, we demonstrate the superior performance of our approach for resource-constrained devices, which minimizes the computational overheads of the IIoT devices.
Haiyang Yu 0001, Runtong Xu, Hui Zhang 0140, Zhen Yang 0004, Huan Liu 0001
IEEE/ACM Trans. Netw.3