Zhikun Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhikun Zhang has a total of 109 co-authors. Here are the top co-authors by number of shared publications:
- Min Chen
Vrije Universiteit Amsterdam, Amsterdam, Netherlands
9 shared publications - Jiming Chen
Zhejiang University, Hangzhou, China
8 shared publications - Shibo He
Zhejiang University
7 shared publications - Linkang Du
Xi'an Jiaotong University, Xi'an, China
6 shared publications - Peng Cheng
Zhejiang University, Hangzhou, China
6 shared publications - Pengfei Zhang
State Key Laboratory of Digital Intelligent Technology for Unmanned Coal Mining, School of Computer Science and Engineering, Anhui University of Science and Technology, Huainan, China
6 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5121-5135
NotaryMark: Multi-Bit Watermarking for Black-Box Dataset Usage Auditing in Text-to-Image Diffusion Models
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5121-5135
Open AccessNotaryMark: Multi-Bit Watermarking for Black-Box Dataset Usage Auditing in Text-to-Image Diffusion Models
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5106-5120
DWBench: Holistic Evaluation of Watermark for Dataset Copyright Auditing
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5106-5120
Open AccessDWBench: Holistic Evaluation of Watermark for Dataset Copyright Auditing
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4687-4701
InceptionRAG: Stealthy Poisoning Attack Against Retrieval-Augmented Generation
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4687-4701
Open AccessInceptionRAG: Stealthy Poisoning Attack Against Retrieval-Augmented Generation
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1925-1939
Robust Estimation of Sparse Numerical Vectors under Local Differential Privacy
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1925-1939
Open AccessRobust Estimation of Sparse Numerical Vectors under Local Differential Privacy
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7461-7477
Efficient Poisoning Attacks Against Reinforcement Learning-Based Recommender Systems
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7461-7477
Efficient Poisoning Attacks Against Reinforcement Learning-Based Recommender Systems
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 3872-3886
CIBPU: A Conflict-Invisible Secure Branch Prediction Unit
Previous schemes for designing secure branch prediction unit (SBPU) based on physical isolation can only offer limited security and significantly affect BPU’s prediction capability, leading to prominent performance degradation. Moreover, encryption-based SBPU schemes based on periodic key re-randomization have the risk of being compromised by advanced attack algorithms, and the performance overhead is also considerable. To this end, this paper proposes conflict-invisible SBPU (CIBPU). CIBPU employs redundant storage design, load-aware indexing, and replacement design, as well as an encryption mechanism without requiring periodic key updates, to prevent attackers’ perception of branch conflicts. We provide a thorough security analysis, which shows that CIBPU achieves strong security throughout the BPU’s lifecycle. We implement CIBPU in a RISC-V core model in gem5. The experimental results show that CIBPU causes an average performance overhead of only 2.9%–4.0% with acceptable hardware storage overhead, which is the lowest among the state-of-the-art SBPU schemes. CIBPU has also been implemented in the open-source RISC-V core, SonicBOOM, which is then burned onto an FPGA board. The evaluation based on the board shows an average performance degradation of 2.01%, which is approximately consistent with the result obtained in gem5.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 3872-3886
CIBPU: A Conflict-Invisible Secure Branch Prediction Unit
Previous schemes for designing secure branch prediction unit (SBPU) based on physical isolation can only offer limited security and significantly affect BPU’s prediction capability, leading to prominent performance degradation. Moreover, encryption-based SBPU schemes based on periodic key re-randomization have the risk of being compromised by advanced attack algorithms, and the performance overhead is also considerable. To this end, this paper proposes conflict-invisible SBPU (CIBPU). CIBPU employs redundant storage design, load-aware indexing, and replacement design, as well as an encryption mechanism without requiring periodic key updates, to prevent attackers’ perception of branch conflicts. We provide a thorough security analysis, which shows that CIBPU achieves strong security throughout the BPU’s lifecycle. We implement CIBPU in a RISC-V core model in gem5. The experimental results show that CIBPU causes an average performance overhead of only 2.9%–4.0% with acceptable hardware storage overhead, which is the lowest among the state-of-the-art SBPU schemes. CIBPU has also been implemented in the open-source RISC-V core, SonicBOOM, which is then burned onto an FPGA board. The evaluation based on the board shows an average performance degradation of 2.01%, which is approximately consistent with the result obtained in gem5.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 53-65
Scrub It Out! Erasing Sensitive Memorization in Code Language Models via Machine Unlearning
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 53-65
Open AccessScrub It Out! Erasing Sensitive Memorization in Code Language Models via Machine Unlearning
- 9 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (8) , 5142-5158
Horizontal Multi-Party Data Publishing Under Differential Privacy via Weight-Aware Bidirectional Generative Adversarial Networks
Horizontal multi-party data publishing enables parties with the same attributes but different records to collaboratively share synthetic data. Generative adversarial networks (GAN) excel at capturing complex distributions and generating statistically consistent samples. However, existing studies treat all parties' data equally without considering heterogeneity, approximate data distributions largely from only a single direction, and suffer from training instability under limited privacy budgets. To address these limitations, we propose MASTER, a weight-aware bidirectional GAN approach. In MASTER, each party maintains a sanitized discriminator to protect local data, while a central server coordinates two complementary generators that learn the underlying data distribution from different perspectives. Specifically, we introduce a dual-generator GAN structure, where training is enhanced by simultaneously increasing the distance between the distributions of generated samples to improve diversity and reducing the discriminators' ability to distinguish them to stabilize training and enhance sample quality. Moreover, a weight-aware fusion mechanism is designed to dynamically balance contributions from different parties and generators based on data quality, enhancing inter-party connections, generation diversity, and training stability. To compute the weights, we formulate an unsupervised integer programming problem and design an alternating optimization scheme. Our theoretical analysis demonstrates that MASTER maintains comparable computational complexity to non-private settings while providing strong differential privacy and utility guarantees. Extensive experiments on four real-world datasets and one synthetic dataset show MASTER's effectiveness.
- 9 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (8) , 5142-5158
Horizontal Multi-Party Data Publishing Under Differential Privacy via Weight-Aware Bidirectional Generative Adversarial Networks
Horizontal multi-party data publishing enables parties with the same attributes but different records to collaboratively share synthetic data. Generative adversarial networks (GAN) excel at capturing complex distributions and generating statistically consistent samples. However, existing studies treat all parties' data equally without considering heterogeneity, approximate data distributions largely from only a single direction, and suffer from training instability under limited privacy budgets. To address these limitations, we propose MASTER, a weight-aware bidirectional GAN approach. In MASTER, each party maintains a sanitized discriminator to protect local data, while a central server coordinates two complementary generators that learn the underlying data distribution from different perspectives. Specifically, we introduce a dual-generator GAN structure, where training is enhanced by simultaneously increasing the distance between the distributions of generated samples to improve diversity and reducing the discriminators' ability to distinguish them to stabilize training and enhance sample quality. Moreover, a weight-aware fusion mechanism is designed to dynamically balance contributions from different parties and generators based on data quality, enhancing inter-party connections, generation diversity, and training stability. To compute the weights, we formulate an unsupervised integer programming problem and design an alternating optimization scheme. Our theoretical analysis demonstrates that MASTER maintains comparable computational complexity to non-private settings while providing strong differential privacy and utility guarantees. Extensive experiments on four real-world datasets and one synthetic dataset show MASTER's effectiveness.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 7698-7715
Locally Differentially Private Truth Discovery Over Data Streams
Data inconsistency often arises from multiple observed sensory data due to varying participant reliability for crowdsensing systems. Truth discovery, which includes Weight Estimation and Truth Aggregation, for estimating participant reliability weights and aggregating uploaded values from inconsistent observations respectively, has emerged as an effective solution to address this issue. While local differential privacy (LDP) provides strong privacy guarantees by allowing participants to perturb their data locally before submission, existing LDP-based studies are either designed for static scenarios or compromise on privacy and accuracy trade-off for data streams, satisfying only weaker versions of LDP or mere differential privacy. To effectively and efficiently obtain truths over streams under rigorous LDP, we propose NANO which is locally differeNtially privAte truth discovery via updatiNg time stamp determinatiOn. The main idea lies in its integration of Laplacian noise for privacy protection and inherent Gaussian noise representing natural data variability for effective weight and truth estimations, coupled with the adaptive determination of updating time stamps. In NANO, to obtain the Weight Estimation and Truth Aggregation under LDP, we design a mixed noise-aware truth discovery method MixTD by modeling the mixed noise. To capture the dynamic nature of weight and truth evolutions, we develop a changing-aware updating time stamp determination method CUD to selectively re-conduct truth discovery at specific time stamps. We also introduce a dynamic privacy budget management strategy, which accumulates unused budgets from skipped updates for critical timestamps. In this way, Weight Estimation and Truth Aggregation are limited to critical time stamps, which significantly reduces the privacy budget segmentation and computational costs. We demonstrate that NANO provides rigorous LDP guarantees while achieving bounded utility and computational complexity. Extensive experimental results over four real-world datasets and three synthetic datasets showcase that NANO outperforms the state-of-the-arts by at least 20% improvement with negligible extra efficiency loss.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 7698-7715
Locally Differentially Private Truth Discovery Over Data Streams
Data inconsistency often arises from multiple observed sensory data due to varying participant reliability for crowdsensing systems. Truth discovery, which includes Weight Estimation and Truth Aggregation, for estimating participant reliability weights and aggregating uploaded values from inconsistent observations respectively, has emerged as an effective solution to address this issue. While local differential privacy (LDP) provides strong privacy guarantees by allowing participants to perturb their data locally before submission, existing LDP-based studies are either designed for static scenarios or compromise on privacy and accuracy trade-off for data streams, satisfying only weaker versions of LDP or mere differential privacy. To effectively and efficiently obtain truths over streams under rigorous LDP, we propose NANO which is locally differeNtially privAte truth discovery via updatiNg time stamp determinatiOn. The main idea lies in its integration of Laplacian noise for privacy protection and inherent Gaussian noise representing natural data variability for effective weight and truth estimations, coupled with the adaptive determination of updating time stamps. In NANO, to obtain the Weight Estimation and Truth Aggregation under LDP, we design a mixed noise-aware truth discovery method MixTD by modeling the mixed noise. To capture the dynamic nature of weight and truth evolutions, we develop a changing-aware updating time stamp determination method CUD to selectively re-conduct truth discovery at specific time stamps. We also introduce a dynamic privacy budget management strategy, which accumulates unused budgets from skipped updates for critical timestamps. In this way, Weight Estimation and Truth Aggregation are limited to critical time stamps, which significantly reduces the privacy budget segmentation and computational costs. We demonstrate that NANO provides rigorous LDP guarantees while achieving bounded utility and computational complexity. Extensive experimental results over four real-world datasets and three synthetic datasets showcase that NANO outperforms the state-of-the-arts by at least 20% improvement with negligible extra efficiency loss.