DZDongdong Zhao

Dongdong Zhao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dongdong Zhao has a total of 87 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Industrial Protocol Data Model and State Model Generation Based on Large Language Model

    by Songsong Liao, Rui Hao, Dongdong Zhao, Qianrong Zheng, Junwei Jiang, Jianwen Xiang

  • Cancellable Iris Recognition Scheme Based on Positive-Negative Mapping and Negative Selection

    by Qianrong Zheng, Baotong Ren, Jianwen Xiang, Rui Hao, Songsong Liao, Dongdong Zhao

    Iris recognition technology is widely used in identity verification and other fields due to its high accuracy and strong security. However, with the popularization of the technology, the privacy protection of iris data has become increasingly prominent. Existing systems are often difficult to protect personal data privacy while guaranteeing recognition accuracy, especially when facing data leakage and attacks, iris features cannot be modified once leaked, which is extremely risky. Therefore, proposing an efficient and accurate protection scheme that can ensure the security of iris data has become an important issue that needs to be solved urgently. In this paper, we propose an iris template protection framework based on positive-negative mapping and the negative selective algorithm, called the IrisPN-NS. The framework effectively protects iris data by constructing a complex system of inequality equations and combining it with the negative selection algorithm, thus increasing the difficulty for attackers to crack. Based on this framework, we propose two iris template protection methods, IrisPNM-NS and IrisPNS-NS. We conducted experiments on the CASIA-IrisV3-Interval, CASIA-IrisV4-Lamp, and IIT Delhi Iris datasets. The experimental results show that the scheme achieves high performance and effectively resists the attack of the greedy algorithm, while satisfying the requirements of irreversibility, revocability, and unlinkability.

  • BioDeepHash: Generating Consistent Templates for Secure Biometric Recognition

    by Baogang Song, Dongdong Zhao, Jiang Yan, Huanhuan Li, Hao Jiang

    Given the immutability of biometric data, it is imperative to develop a biometric template protection method that guarantees the complete non-disclosure of any original biometric information while ensuring high recognition performance. Two mainstream approaches in biometric template protection—cancelable biometrics and biometric cryptosystems—have been widely adopted; however, the protected templates produced by these methods still contain some of the original biometric data, which can lead to privacy leakage. To address these challenges, we propose a novel framework named BioDeepHash that integrates deep hashing with cryptographic hash functions. In our approach, a deep hashing model generates consistent templates for similar biometric data from the same user, thereby eliminating intra-class variations. An application-specific XOR string is then used to achieve revocability, and finally these consistent templates are processed by cryptographic hash functions to produce protected templates that meet strict security standards. Our experimental results show that, compared with existing methods, BioDeepHash increases the average Genuine Acceptance Rate by 10.12% on the iris dataset and by 3.12% on the facial dataset, while achieving an extremely low False Acceptance Rate—0% for the iris dataset and only 0.0002% for the facial dataset.

  • Generation of Hard SAT Instances and Its Application in Negative Databases for Privacy Enhancement

    by Dongdong Zhao, Pang Chen, Changtian Song, Jianwen Xiang, Junwei Zhou, Zebo Tang, Baogang Song

    In recent years, machine learning and deep learning have made remarkable progress and are now widely applied in various fields, including image classification, autonomous driving, natural language processing, and medical diagnosis. However, training these models requires large datasets, which often contain substantial amounts of sensitive personal information, such as medical records and financial details. Without effective privacy protection measures during model training, the risk of sensitive data leakage increases, potentially resulting in severe privacy violations and a loss of trust. As an innovative data representation technique, the Negative Database has proven to be an effective solution in privacy-sensitive domains. Negative databases can be derived from SAT (Boolean Satisfiability Problem) instances, and the hardness of these instances is directly correlated with the level of data protection provided by the Negative Databases. Developing efficient SAT instance generation algorithms to create harder SAT instances can significantly enhance the privacy protection capabilities of the Negative Database. This paper analyzes the hardness conditions of SAT solvers using the Conflict-Driven Clause Learning strategy and proposes a two-stage SAT instance generation algorithm to generate harder SAT instances. These hard instances not only aid in constructing more secure negative databases for enhanced privacy protection but also provide valuable test cases for evaluating and improving SAT solvers.

  • Open Access

    BackWeak: Backdooring Knowledge Distillation Simply with Weak Triggers and Fine-tuning

    by Shanmin Wang, Dongdong Zhao

    Knowledge Distillation (KD) is essential for compressing large models, yet relying on pre-trained "teacher" models downloaded from third-party repositories introduces serious security risks -- most notably backdoor attacks. Existing KD backdoor methods are typically complex and computationally intensive: they employ surrogate student models and simulated distillation to guarantee transferability, and they construct triggers in a way similar to universal adversarial perturbations (UAPs), which being not stealthy in magnitude, inherently exhibit strong adversarial behavior. This work questions whether such complexity is necessary and constructs stealthy "weak" triggers -- imperceptible perturbations that have negligible adversarial effect. We propose BackWeak, a simple, surrogate-free attack paradigm. BackWeak shows that a powerful backdoor can be implanted by simply fine-tuning a benign teacher with a weak trigger using a very small learning rate. We demonstrate that this delicate fine-tuning is sufficient to embed a backdoor that reliably transfers to diverse student architectures during a victim's standard distillation process, yielding high attack success rates. Extensive empirical evaluations on multiple datasets, model architectures, and KD methods show that BackWeak is efficient, simpler, and often more stealthy than previous elaborate approaches. This work calls on researchers studying KD backdoor attacks to pay particular attention to the trigger's stealthiness and its potential adversarial characteristics.

  • Open Access

    A Privacy-Preserving Data Collection Method for Diversified Statistical Analysis

    by Hao Jiang, Quan Zhou, Dongdong Zhao, Shangshang Yang, Wenjian Luo, Xingyi Zhang

    Data perturbation-based privacy-preserving methods have been widely adopted in various scenarios due to their efficiency and the elimination of the need for a trusted third party. However, these methods primarily focus on individual statistical indicators, neglecting the overall quality of the collected data from a distributional perspective. Consequently, they often fall short of meeting the diverse statistical analysis requirements encountered in practical data analysis. As a promising sensitive data perturbation method, negative survey methods is able to complete the task of collecting sensitive information distribution while protecting personal privacy. Yet, existing negative survey methods are primarily designed for discrete sensitive information and are inadequate for real-valued data distributions. To bridge this gap, this paper proposes a novel real-value negative survey model, termed RVNS, for the first time in the field of real-value sensitive information collection. The RVNS model exempts users from the necessity of discretizing their data and only requires them to sample a set of data from a range that deviates from their actual sensitive details, thereby preserving the privacy of their genuine information. Moreover, to accurately capture the distribution of sensitive information, an optimization problem is formulated, and a novel approach is employed to solve it. Rigorous theoretical analysis demonstrates that the RVNS model conforms to the differential privacy model, ensuring robust privacy preservation. Comprehensive experiments conducted on both synthetic and real-world datasets further validate the efficacy of the proposed method.

  • Protected template classification for iris biometrics

    by Qianrong Zheng, Jianwen Xiang, Rui Hao, Songsong Liao, Ling Dong, Dongdong Zhao

  • Cross-Project Aging-Related Bug Prediction Based on Transfer Learning and Class Imbalance Learning

    by Bin Xu, Dongdong Zhao, Junwei Zhou, Wenzhi Xie, Kai Jia, Jing Tian, Jianwen Xiang

    Software aging results from aging-related bugs (ARBs) in long-running systems, that usually causes performance decline and system crashes. Since collecting ARB data is challenging due to its scarcity, it hinders the development of effective prediction models. Moreover, existing cross-project ARB prediction methods often ignore project-specific distribution differences and neglect class imbalance and overlap issues between ARB and non-ARB classes. In this paper, a hybrid approach that combines the balanced distribution adaptation (BDA), the improved subclass discriminant analysis (ISDA), and the self-paced ensemble under-sampling (SPE) techniques, called BISP in short, is proposed to address the aforementioned problems. The main idea behind BISP is first to use BDA to adaptively reduce the difference of projects' marginal distribution and conditional distribution, and then employ ISDA and SPE to alleviate the severe class imbalance together with class overlap. Experimental results obtained for six classifiers and six cross-project datasets show that compared with the state-of-the-art approaches TLAP and JDA-ISDA based on transfer learning, BISP improves the average balance by 34.8% and 2.3% and improves the average AUC by 26.5% and 8.4%, respectively. Compared with the deep learning approach SRLA, BISP can improve the average balance value by 5.1%.


  • IrisSPT: Cancelable Iris Template for Secure Authentication Based on Self-Parameterized Transform

    by Qianrong Zheng, Jianwen Xiang, Zhi Yao, Jing Tian, Huanhuan Li, Dongdong Zhao

    Biometrics have received significant attention as a result of the increasingly widespread adoption of biometric authentication systems by government and commercial organizations as an alternative to traditional password or token authentication methods. Existing cancellable biometric techniques typically transform feature vectors into protection templates by generating random transformation functions. However, the transformation functions of such cancellable biometric systems are prone to leakage, which in turn may lead to security risks. For this purpose, a novel Self-Parameterized Transformation (SPT) method is proposed in this paper. Specifically, by generating the transformation parameters directly from the iris data, the method effectively prevents the attacker from establishing a recognizable mapping relationship between the original iris data and the generated template, which makes it extremely complicated to recover the original iris data. In addition, to ensure irreversibility, this method avoids storing the transformation parameters on the client or server side, thus effectively preventing the attacker from reconstructing the original iris data through reverse engineering. Although it is possible to attempt to recover the original data by brute-force cracking, this process is hardly feasible. To achieve unlinkability, this paper further employs an aggregation function, which effectively prevents correlation leakage between templates. Theoretical analysis shows that the proposed SPT method is adequately guaranteed in terms of irreversibility, revocability, unlinkability, and performance retaining criteria in cancellable biometrics. Benchmarking results show that the proposed SPT method improves at least 23.4% on the global measure $(D_{\leftrightarrow }^{sys})$ compared to the existing schemes. Extensive experiments on CASIA-IrisV3-Interval, CASIA-IrisV4-Thousand and IIT Delhi Iris datasets demonstrate that the SPT approach has significant security advantages in biometric data protection and exhibits superior performance over state-of-the-art schemes. These results show that the proposed SPT method not only meets the stringent requirements in privacy protection, but also successfully realizes the balance between security and performance, and has high practical value.


  • NegSPQ: Similar Patient Query Based on Negative Representation of Genomic Data

    by Dongdong Zhao, Qiben Xu, Fan Li, Yiheng Mao, Jianwen Xiang, Huanhuan Li

    With the development of genome sequencing technology, genomic data have been widely collected and used in real-world scenarios, such as genomic medicine and similar patient query (SPQ) cases, based on similarity comparisons of genomic sequences. However, genomic data are unique for every person and contain a large amount of sensitive information involving personal privacy. Therefore, determining how to protect privacy while utilizing genomic data has become a key issue. In this paper, we mainly investigate the privacy protection of SPQs, and we propose five algorithms (NDB-ED, NDB-Band, NDB-Block, NDB-SIS and NDB-SDS) based on a promising technique called negative representation of information (NRI). The proposed algorithms use five kinds of similarity comparison approaches widely applied in SPQs and convert all genomic sequences into negative databases (NDBs, among the most important NRI forms) for privacy protection. When performing an SPQ, NDB-ED approximates the edit distance between the sketches (the statistics of NDBs) of two genomic sequences to evaluate the dissimilarity. Banded edit distance and block-wise edit distance are two effective approximate edit distance algorithms, which can greatly reduce the time complexity. NDB-Band and NDB-Block are used to estimate the banded edit distance and the block-wise edit distance between the sketches of NDB pairs, respectively, to further improve query efficiency and reduce communication overhead. Besides, private genome set intersection size (SIS) and set difference size (SDS) can also be used instead of edit distance to evaluate the dissimilarity between genomic pairs during SPQs. NDB-SIS and NDB-SDS estimate the SIS and SDS between the sketches, for similarity comparison. The experimental results demonstrate that the proposed algorithms can achieve promising results in terms of accuracy and efficiency (Our best algorithm improves accuracy by at least 10% and query time is at least 700 times faster than existing algorithms during SPQs).