Yahong Chen

Yahong Chen

Auto-generated profile, based on publicly available information

Yahong Chen

Central China Normal University, Wuhan, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
10 February 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
YCYahong Chen
Yahong Chen
XPXiaoyi Pang
Xiaoyi Pang
XLXiaoguang Li
Xiaoguang Li
HWHanyi Wang
Hanyi Wang
BNBen Niu
Ben Niu
SHShengnan Hu
Shengnan Hu
Range counting is a fundamental operation in spatial data applications. There is a growing demand to facilitate this operation over a data federation, where spatial data are separately held by multiple data providers (a.k.a., data silos). Most existing data federation schemes employ Secure Multiparty Computation (SMC) to protect privacy, but this approach is computationally expensive and leads to high latency. Consequently, private data federations are often impractical for typical database workloads.This challenge highlights the need for a private data federation scheme capable of providing fast and accurate query responses while maintaining strong privacy. To address this issue, we propose U-DPAP, a utility-aware efficient privacy-preserving method. It is the first scheme to exclusively use differential privacy for privacy protection in spatial data federation, without employing SMC. Moreover, it combines approximate query processing to further enhance efficiency. Our experimental results indicate that a straightforward combination of the two techniques results in unacceptable impacts on data utility. Thus, we design two novel algorithms: one to make differential privacy practical by optimizing the privacy-utility trade-off, and another to address the efficiency-utility trade-off in approximate query processing. The grouping-based perturbation algorithm reduces noise by grouping similar data and applying noise to the groups. The representative data silos selection algorithm minimizes approximate error by selecting representative silos using the similarity between data silos. We rigorously prove the privacy guarantees of U-DPAP. Moreover, experimental results demonstrate that U-DPAP enhances data utility by an order of magnitude while maintaining high communication efficiency.


1 December 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XLXiaoguang Li
Xiaoguang Li
YWYuxin Wen
Yuxin Wen
YWYuchen Wang
Yuchen Wang
HYHaonan Yan
Haonan Yan
YCYahong Chen
Yahong Chen
XLXiaodong Lin
Xiaodong Lin
Local differential privacy (LDP) provides strict privacy guarantee in a distributed environment. Recent studies demonstrated that LDP protocols are vulnerable to data poisoning attacks where an attacker can manipulate the perturbed result on the local side and send bogus data to skew the final estimate on the server. Unfortunately, existing attack detections do not create an effective attack indicator and rely on particular characteristics of LDP protocols. As a result, they typically exhibit limited detection performance. In this paper, we use log-likelihood as the attack indicator and propose a chain-style detection to enhance the detection effectiveness, in which the attack impact could propagate along the chain and exhibit clear anomaly signal even under stealthy attack scenarios. The experimental results show that our detection consistently outperforms the existing methods. Using four datasets containing categorical and numerical data separately, our detection achieves an F1 score exceeding 96% in most cases. It even remains above 0.9 under stealthy attack settings, outperforming the state-of-the-art detection by up to 0.25.

12 April 2026
Verified
Conference Paper
Open access
ZZZhigao Zheng
Zhigao Zheng
KYKai Yin
Kai Yin
YKYaowen Kuang
Yaowen Kuang
TWTao Wang
Tao Wang
YCYahong Chen
Yahong Chen
HHHao Huang
Hao Huang


24 July 2026 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
Zhe SunZhe Sun
Zhe Sun
WGWenxin Gao
Wenxin Gao
PYPeijie Yin
Peijie Yin
WLWeiping Li
Weiping Li
MZMing Zhang
Ming Zhang
YGYunchuan Guo
Yunchuan Guo