Chang Tan

Chang Tan

Auto-generated profile, based on publicly available information

Chang Tan

Nankai University

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
Thar BakerThar Baker
Thar Baker
TLTong Li
Tong Li
JJJingyu Jia
Jingyu Jia
BZBaolei Zhang
Baolei Zhang
CTChang Tan
Chang Tan
Albert ZomayaAlbert Zomaya
Albert Zomaya
Personalized recommendation is deemed ubiquitous. Indeed, it has been applied to several online services (e.g., E-commerce, advertising, and social media applications, to name a few). Learning unknown user preferences from user-provided data lies at the core of modern collaborative filtering recommender systems. However, there is an incentive for malicious attackers to manipulate the learned preferences, which could affect business decision making, by injecting poisoned data. In the face of such a poisoning attack, while previous works have proposed a number of defense methods succeeding in other machine learning (ML) tasks, little is effective for collaborative filtering (CF). Thereof, we present a new defense scheme called poison-tolerant collaborative filtering (PTCF), which is highly robust against poisoning attacks on collaborative filtering. Different from the defenses that remove outliers or search a min-loss subset, the PTCF scheme enables collaborative filtering on an attacked training dataset while guarantees system's availability and integrity. We evaluate extensively the PTCF scheme on a public dataset (Jester) and two real-world datasets (Movie and E-Shopping), and demonstrate that the PTCF scheme is significantly effective in providing robustness.

2 September 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JJJingyu Jia
Jingyu Jia
XLXinhao Li
Xinhao Li
TLTong Li
Tong Li
ZLZhewei Liu
Zhewei Liu
CTChang Tan
Chang Tan
Zheli LiuZheli Liu
Zheli Liu
In private data publishing, a promising solution is generating synthetic data that enables any query on the private dataset while satisfying differential privacy. Over the past decade, researchers mainly focused on improving the query accuracy of synthetic data. However, the limitations of existing works restrict them from achieving a better trade-off between accuracy and privacy. In this paper, we propose ABSyn, a novel scheme for differentially private data synthesis. Under the Select-Measure-Generate paradigm, ABSyn has an adaptive mechanism for precisely selecting marginals and follows the batch processes. Our adaptive-batch scheme can provide a well-selected marginal set and the optimal allocation of privacy budget, which makes its synthetic data achieve high accuracy without compromising privacy. We implement an efficient prototype of ABSyn and compare it with existing works by analyzing public datasets. Experimental results show that ABSyn achieves query accuracy on synthetic datasets by a factor of 1.26× and efficiency by a factor of 18.60× over the state-of-the-art scheme on average.

12 August 2025 in ACM Transactions on Multimedia Computing, Communications, and Applications
Verified
Journal Article
Open access
CTChang Tan
Chang Tan
ZLZhewei Liu
Zhewei Liu
ZLZhengdao Li
Zhengdao Li
JJJingyu Jia
Jingyu Jia
SLSiyi Lv
Siyi Lv
Zheli LiuZheli Liu
Zheli Liu
To privately publish sensitive multimedia data in an edge network with fog devices, one of the best privacy-preserving solutions is to use differential privacy (DP) mechanisms. However, existing DP data publication mechanisms for the infinite data stream of edge networks mainly focus on publishing data with specific types of data or a set of predetermined queries. This approach is not suitable for multimedia data with numerous features that require a more flexible data publishing mechanism. In this article, we propose EdgeSyn, a novel mechanism for accurately publishing multimedia data over infinite data streams in an edge network. It allocates privacy budgets with a sliding window, adopting data synthesis mechanisms to support dynamic publishing without loss of accuracy. In more detail, EdgeSyn addresses the limitations associated with data types in prior data stream publishing approaches and introduces a privacy budget management strategy that optimally allocates budgets for the implementation of data synthesis mechanisms over an infinite data stream. The experimental results show that EdgeSyn performs well under different privacy budgets and various lengths of active windows.

1 January 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
CTChang Tan
Chang Tan
XLXinyu Li
Xinyu Li
JJJingyu Jia
Jingyu Jia
LNLihai Nie
Lihai Nie
Zheli LiuZheli Liu
Zheli Liu
TLTong Li
Tong Li