Demo Data from EDBT 2026 / reviewers in the wild / expert
Jikun Chen
dblp:190/1645
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 since 2021Security and privacy · 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 |
Privacy and data protection · 77% Security and privacy of machine learning · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy-preserving machine learning › collaborative learning
privacy-preserving collaborative learning |
0.8 | 1 | 2024 | Fool Attackers by Imperceptible Noise: A Privacy-Preserving Adversarial Representation Mechanism for Collaborative Learning · IEEE Trans. Mob. Comput. 2024 |
Security and privacy of machine learning › privacy attack
model inversion attack |
0.2 | 1 | 2024 | Fool Attackers by Imperceptible Noise: A Privacy-Preserving Adversarial Representation Mechanism for Collaborative Learning · IEEE Trans. Mob. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
representation learning · 0.8adversarial noise · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Fool Attackers by Imperceptible Noise: A Privacy-Preserving Adversarial Representation Mechanism for Collaborative LearningabstractThe performance of deep learning models highly depends on the amount of training data. It is common practice for today's data holders to merge their datasets and train models collaboratively, which yet poses a threat to data privacy. Different from existing methods such as secure multi-party computation (MPC) and federated learning (FL), we find representation learning has unique advantages in collaborative learning due to its low privacy budget, wide applicability to tasks and lower communication overhead. However, data representations face the threat of model inversion attacks. In this article, we formally define the collaborative learning scenario, and present ARS (for adversarial representation sharing), a collaborative learning framework wherein users share representations of data to train models, and add imperceptible adversarial noise to data representations against reconstruction or attribute extraction attacks. By theoretical analysis and evaluating ARS in different contexts, we demonstrate that our mechanism is effective against model inversion attacks, and can achieve great utility and low communication complexity while preserving data privacy. Moreover, the ARS framework has wide applicability, which can be easily extended to the vertical data partitioning scenario and utilized in different tasks. Na Ruan, Jikun Chen, Tu Huang, Zekun Sun, Jie Li 0002 |
IEEE Trans. Mob. Comput. | 2 |
| 2021 | ALRS: An Adversarial Noise Based Privacy-Preserving Data Sharing Mechanism
Jikun Chen, Ruoyu Deng, Na Ruan, Yao Liu 0007, Chunhua Su |
ACISP | 1 |
| 2016 | MAF-SAM: An effective method to perceive data plane threats of inter domain routing system
Hai-Xin Duan, Jikun Chen, Fu Miao |
Comput. Networks | 3 |