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

Runtong Xu

dblp:374/0066 · 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

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
Cryptographic protocols and secure computation · 75% Security and privacy of machine learning · 25%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
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
Internet of things and sensor networks
industrial iot
0.212024
EV-FL: Efficient Verifiable Federated Learning With Weighted Aggregation for Industrial IoT Networks · IEEE/ACM Trans. Netw. 2024

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

weighted aggregation verification · 1.5zero-knowledge proofs · 0.8zero-knowledge proof · 0.8
YearPublicationVenuePosition
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.2