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

Chengyi Dong

dblp:389/6085 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-8725-0663ORCID · reported

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

Computer 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.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure multiparty computation
asynchronous MPC
0.912025
Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience · USENIX Security Symposium 2025
Cryptographic protocols and secure computation
secure multiparty computation
0.912025
Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience · USENIX Security Symposium 2025
Distributed computing theory
fault tolerance
0.312025
Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience · USENIX Security Symposium 2025
YearPublicationVenuePosition
2025 Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience
Yuan Su, Yuan Lu 0001, Yuyi Wang 0001, Chengyi Dong, Qiang Tang 0005
USENIX Security Symposium5
2025 Robust and Secure Aggregation Scheme for Federated Learning
abstract
Federated learning (FL) with a distributed trust framework effectively mitigates centralized security risks. However, it remains vulnerable to in-protocol Denial-of-Service attacks, resulting in the malicious server refusing to aggregate the valid gradients or terminating the protocol. Additionally, it is susceptible to collaborative attacks, where compromised servers and clients can bypass gradient verification to inject backdoors. To address those issues, we propose a robust and secure aggregation scheme for FL, which extends the efficient 2-party computation (2PC) to a 3-party computation (3PC) with at most one malicious party, resisting abnormal termination and colluding poisoning attacks. In particular, we skillfully combine the replicated secret sharing with$L_{2}$and$L_{\infty }$defense, ensuring the malformed gradients filtering with a noninteractive setup. Moreover, we integrate the player elimination framework to detect misbehavior and guarantee output delivery. The formal security analysis proves that our scheme maintains malicious security even under the colluding model. Extensive experiments demonstrate that robust and secure aggregation scheme for federated learning is more client-friendly and significantly enhances client efficiency by approximately 4 orders of magnitude compared to state-of-the-art methods.
Chengyi Dong, Yinbin Miao, Qingming Li, Shuiguang Deng, Shouling Ji
IEEE Internet Things J.3