Ya-Hao Zhang

Dr. Ya-Hao Zhang


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
27 September 2023 in Computers & Security
Verified
Journal Article
Closed access
MWMeng Wang
Meng Wang
YZYa-Hao Zhang
Ya-Hao Zhang
WWWeiPing Wen
WeiPing Wen

13 March 2018 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
ZNZhenhu Ning
Zhenhu Ning
YYYongli Yang
Yongli Yang
YZYa-Hao Zhang
Ya-Hao Zhang

12 April 2023 in High-Confidence Computing
Verified
Journal Article
Open access
MWMeng Wang
Meng Wang
PYPing Yang
Ping Yang
YZYa-Hao Zhang
Ya-Hao Zhang

11 June 2024 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
MWMeng Wang
Meng Wang
QWQiong-Yun Wang
Qiong-Yun Wang
YZYa-Hao Zhang
Ya-Hao Zhang
ZZZi-Xuan Zhang
Zi-Xuan Zhang
YFYa-Ning Feng
Ya-Ning Feng
YCYu-Feng Cao
Yu-Feng Cao

4 May 2023 in Research Square
Verified
Preprint
Open access
PDF file
MWMeng Wang
Meng Wang
QWQiong-Yun Wang
Qiong-Yun Wang
YZYa-Hao Zhang
Ya-Hao Zhang
ZZZi-Xuan Zhang
Zi-Xuan Zhang
YFYa-Ning Feng
Ya-Ning Feng
YCYu-Feng Cao
Yu-Feng Cao
Scholars propose a noise adding mechanism in local differential privacy to provide a strict privacy guarantee to federated learning. However, there are two problems. On the one hand, the noisy data is close to its original value with high probability due to the zero mean random noise, leading to the information exposure. On the other hand, a large variance of the noise makes the estimated average of the parameters bias. To overcome the difficulties, we propose a framework of none-zero mean noise adding mechanism in differential privacy in federated learning of deep networks based on fully homomorphic encryption and greedy average block Kaczmarz method. In the work, a none-zero mean adding noise to original data is determined locally according to the correlation between the local and global distributions. Using fully homomorphic encryption and greedy average block Kaczmarz method, a de-noising weighting aggregation strategy is derived without decryption of the mean to guarantee the privacy of user by a third party. Moreover, the weight is generated complete randomly so that it is difficult to obtain the mean. As the means are different among the clients and unpredictable for attackers, the variance of the noise can be small. Experiments show that the proposed method provides a higher level of accuracy than the non-privacy-preserving federated learning, while it guarantee privacy for multi-party machine learning tasks.