Home Latest Articles
Latest Articles
  • Futai Zou, Kaida Jiang, Tianyue Zhan, Wei Shi, Liang Zhang
    Journal of Computer Research and Development. 2026, 63(1): 214-226.

    Accurately and efficiently identifying security vulnerabilities in Web applications holds significant research value, especially as Web systems grow in complexity and scale. Most existing studies in the field of Web vulnerability discovery have focused on PHP-based applications, rendering them less effective or even inapplicable when transferred to the domain of Java Web applications. Furthermore, traditional vulnerability discovery methods often struggle to meet the demands of large-scale and high-efficiency scenarios. Specifically, these methods face difficulties in achieving the precision of dynamic analysis while maintaining the performance benefits of static analysis. To address these challenges, we propose a novel Web vulnerability discovery approach based on joint frontend-backend analysis. By parsing the frontend code to extract taint source information, the method guides backend analysis for pruning irrelevant paths, thereby enhancing both the vulnerability coverage and discovery efficiency. Additionally, the approach integrates both static and dynamic features of the program to construct a comprehensive code model. It combines techniques such as data flow analysis, taint analysis, symbolic execution, and lightweight dynamic solving to detect and verify potential vulnerabilities. This integrated strategy leads to a significant performance boost with minimal computational overhead. The proposed method is evaluated on 105 Java Web vulnerabilities sourced from CVE (common vulnerabilities and exposure) entries, open-source CMS (content management system) platforms, and community-developed applications. The experimental results demonstrate that each component of the system performs effectively, and the overall framework exhibits strong capability in discovering real-world Java Web vulnerabilities.

  • Jisheng Dong, Cong Li, Zinan Shen, Daqi Hu, Qingni Shen, Zhonghai Wu
    Journal of Computer Research and Development. 2026, 63(1): 227-242.

    Blockchain has received a lot of attention in recent years, and the digital signature scheme is a legitimate way to authenticate transactions in the blockchain. The threshold signature scheme enables the key controlled by a single participant to be managed by multiple participants at the same time, and the transaction can be signed only if more than a threshold number of participants sign at the same time, which expands the application mode and application scenario of cryptocurrency, and reduces the risk of single point of failure. However, existing threshold signature schemes are mostly limited to traditional public key signature algorithms such as ECDSA (elliptic curve digital signature algorithm), which incur significant overhead in public key certificate storage and management. IBC (identity-based cryptosystem) can effectively address this issue, but there is no corresponding research on threshold SM9 signature schemes. Implementing a threshold signature scheme usually requires the use of a two-party secret sharing conversion protocol. To address the low efficiency of the existing two-party secret sharing conversion protocol based on the Paillier encryption algorithm, we propose a two-party secret sharing conversion protocol based on the ElGamal encryption algorithm, and apply it to construct a threshold signature scheme based on SM9. In addition, in order to prove the security of the scheme, an identity-based threshold signature ideal function is constructed, and the security of the scheme is proved under the UC (universally composable) model. Theoretical analysis and experimental results show that the threshold SM9 signature scheme based on the ElGamal algorithm is more efficient than the existing schemes. In particular, when the threshold is 100, the speed is about 6.1 times that of the Paillier-based scheme. The threshold signature scheme is tested on three different blockchain platforms, Ethereum, Hyperledger Fabric and ChainMaker on Tencent blockchain as a service. The experimental results show that the scheme is feasible in the blockchain scenario.

  • Zhipeng Gao, Yi Zhang, Weijing You, Ze Chai, Yang Yang, Lanlan Rui
    Journal of Computer Research and Development. 2026, 63(1): 243-254.

    Diffusion models have gained significant attention in recent years due to their potential in various generation tasks, including image and text generation. However, the widespread use of these models has also raised concerns regarding data privacy, particularly the vulnerability of these models to membership inference attacks (MIA). These attacks aim to determine whether a specific data point is part of the model’s training set, posing significant risks to privacy. We provide an overview of the latest developments in privacy protection for diffusion models, with a specific focus on MIAs and their challenges. Existing MIA methods often struggle with balancing the effectiveness of short-term and long-term attacks, and their applicability to diffusion models has not been thoroughly explored. To address these issues, we propose a novel temporal membership inference attack method designed to enhance the attack success rate (ASR) for both short-term and long-term attacks. The proposed method leverages gradient information from noise during short-term attacks and temporal noise patterns to bolster the effectiveness of long-term attacks. Experimental results demonstrate that our method improves the ASR by approximately 5% for short-term attacks and 1% for long-term attacks compared with conventional approaches on common diffusion models. This work contributes to the ongoing efforts to understand and mitigate privacy risks in diffusion model applications.

  • Peiyun Zhang, Shuai Tao, Jian Chen, Zihan Chen
    Journal of Computer Research and Development. 2026, 63(1): 255-272.

    With the rapid development of blockchain technology, assets such as data are no longer satisfied with circulating only on a single blockchain, so cross-chain technology has emerged. Cross-chain technology has improved the problem of blockchain data islands, but it has also brought new challenges to the transmission and sharing of data on different blockchains. On the one hand, different blockchain users usually store data in different ways, and the data verification methods of each blockchain are often not unified. Therefore, users on other blockchains may transmit false or inconsistent data, making it difficult to effectively verify the authenticity and consistency of the data, thereby affecting the reliability of cross-chain access control. On the other hand, although the current proxy re-encryption technology can effectively implement one-to-one access control, a single proxy has a centralization problem and faces the problem of high access control time overhead caused by multi-user concurrency in cross-chain scenarios. In response to the above problems, a two-stage cross-chain access control mechanism in the relay chain environment is proposed, which is designed from two stages: data verification and proxy re-encryption. In the data verification stage, to ensure the authenticity and consistency of the source of encrypted data, combined with the Fiat-Shamir heuristic and IPFS, a data verification method is designed to quickly verify the data, so that the encrypted data can be correctly received by the user, and the encrypted data is securely stored in IPFS to relieve the storage pressure on the chain. In the proxy re-encryption stage, an improved threshold proxy re-encryption method is designed to effectively deal with access control in multi-user scenarios, and the re-encryption process is optimized based on the re-encryption update algorithm. While achieving decentralized re-encryption, the time overhead of re-encryption is reduced, and the efficiency of re-encryption transaction processing for multi-user access control is effectively improved. Experimental results show that the proposed mechanism has a small overhead in data verification, and the overhead of encryption, re-encryption, and decryption processes in multi-user scenarios is better than that of the comparative methods.

  • Jinshu Su
    Journal of Computer Research and Development. 2025, 62(12): 2889-2894.

    Intelligent computing characterized by LLMs (large language models) has become a focus point in the development of computer science. The exponential growth of parameters in LLMs poses significant challenges to both computing power and network infrastructure. In the era when Moore’s Law is slowing down, domain-specific customization approaches have emerged. Based on author’s over 30 years of experience in computer architecture research, this paper offers bold insights into the current development of computing architecture and presents preliminary practical results, aiming to spark further discussion and innovation.

  • Chengye Li, Zhen Zhang, Zheheng Liang, Chaosheng Yao, Jinbo Zhang, Rongjie Yan, Peng Wu
    Journal of Computer Research and Development. 2025, 62(12): 2895-2928.

    Object detection technology, as a pivotal component in computer vision, plays a vital role in diverse practical applications. Over decades of evolution, the field has progressed from early methods relying on handcrafted feature extraction to the widespread adoption of deep learning models. Currently, there remains a lack of systematic reviews tracing the developmental trajectory of object detection through improvements in deep learning foundation models. Addressing this gap, this paper organizes the technological evolution around the progression of foundation models in artificial intelligence. We systematically survey detection models built upon various foundation models, compare their strengths and weaknesses, and analyze improvement strategies. The paper also surveys evaluation metrics and technological advancements across different eras, with particular emphasis on how deep learning has driven remarkable performance gains. We discuss persistent challenges in handling diverse scenarios, improving real-time efficiency, and enhancing accuracy. Furthermore, we explore prospective research directions, including model generalization capabilities, computational efficiency, and integration with complex tasks, proposing potential enhancement strategies. This work aims to provide a clear perspective on technological evolution to facilitate further research and applications in object detection.

  • Xu Li, Rui Zhu, Xiaolei Chen, Jinxuan Wu, Yi Zheng, Chenghang Lai, Yuxuan Liang, Bin Li, Xiangyang Xue
    Journal of Computer Research and Development. 2025, 62(12): 2929-2950.

    LVLMs (large vision-language models) represent a significant advancement in the intersection of natural language processing and computer vision. By integrating pre-trained visual encoders, vision-language adapters, and large language models, LVLMs can understand both visual and textual information, and generate responses in natural language, making them suitable for a range of downstream vision-language tasks such as image captioning and visual question answering. However, these models commonly exhibit hallucinations — generating inaccurate perceptions of image contents. Such hallucinations significantly limit the application of LVLMs in high-stakes domains like medical image diagnosis and autonomous driving. This survey aims to systematically organize and analyze the causes, evaluations, and mitigation strategies of hallucinations to guide research in the field and enhance the safety and reliability of LVLMs in practical applications. It begins with an introduction to the basic concepts of LVLMs and the definition and classification of hallucinations within them. It then explores the causes of hallucinations from four perspectives: training data, training task, visual encoding, and text generation, while also discussing the interactions among these factors. Following this, it discusses mainstream benchmarks for assessing LVLM hallucinations in terms of task setting, data construction, and assessment metrics. Additionally, it examines hallucination mitigating techniques across five aspects: training data, visual perception, training strategy, model inference, and post-hoc corrections. Finally, the review provides directions for future research in the areas of cause analysis, evaluation, and mitigation of hallucinations in LVLMs.

  • Junbo Fu, Guoshuai Zhao, Xueming Qian
    Journal of Computer Research and Development. 2025, 62(12): 2951-2961.

    The increasing capabilities of large language models (LLMs) in knowledge storage have underscored their potential utility as knowledge bases. However, it’s important to note that any given prompt can merely offer a lower-bound estimate of the knowledge encompassed by the language model. Prior prompt learning methods in the context of language models as knowledge bases (LMs-as-KBs) have overlooked the influence of query style. We have unveiled a significant revelation—there are indeed learnable preference within LLMs pertaining to query style. Leveraging this distinctive model characteristic, we introduce the adaptive query style transfer (ARES) method to improve the performance of LMs-as-KBs by adapting LLM’s preference. ARES initiates by presenting a candidate set of queries, achieved through paraphrasing to incorporate various expression styles. Subsequently, an evaluator is trained to learn and discern LLM’s preferences for query styles, ultimately evaluating the candidate set and selecting the potentially optimal query. Experiments conducted across multiple datasets have convincingly demonstrated the efficacy of our approach in enhancing question answering accuracy on LMs-as-KBs scenarios. Furthermore, incremental comparison of the original model and three baseline methods shows an average improvement of 2.26%, 1.68%, 1.19%, and 1.17%, respectively, indicating ARES can be effectively utilized in conjunction with other approaches, leading to enhanced performance and optimization across different dimensions.

  • Zenan Wang, Yijie Wang, Xiaohui Zhou, Xudong Xiong
    Journal of Computer Research and Development. 2025, 62(12): 2962-2973.

    In the era of large language models, the training and inference of large language models need the support of arithmetic resources, in which the anomaly detection of arithmetic resource data can effectively guarantee the training and inference of large language models. As the parameters of the large language model increase, the scale of the arithmetic resources used by the large language model grows, in which the data of multiple types of metrics reflecting the operating state of computility show more complex temporal changes over time. Existing multivariate time series anomaly detection methods typically use a preset window size to perform sliding slicing on multivariate time series data. However, a unified window that ignores the periodic characteristics of different dimensions may truncate the complete periodic patterns of time series data in some dimensions, hindering the anomaly detection model from learning the normal patterns of multivariate time series data and resulting in poor anomaly detection performance. To address this issue, we propose an unsupervised multivariate time series anomaly detection method SELAD based on ensemble learning with multi-window extraction. Specifically, we first extract the periodic patterns of each dimension in the multivariate time series data based on the Fourier frequency method, and then perform multi-window extraction to preserve the complete periodic patterns of each dimension. In the process of model training, the huge number of parameters of the large language model can solve the problem that the traditional model has a memory bottleneck when the sliding window increases, which leads to the deterioration of the learning effect. Subsequently, by designing a mixed expert models (MoEs), the time series data from multiple partitioned windows are input into an ensemble learning framework that integrates large language models and LSTM models for training, in order to learn and identify the normal temporal patterns of each dimension. Finally, anomaly detection is performed based on reconstruction scores. In this study, experiment results on four real-world multivariate time series datasets demonstrate that SELAD improves the F1 score by 17.87% to 90.77% compared with existing methods.

  • Bolin Chen, Jinlei Zhang, Jianjun Zhang, Youpeng Hu, Teng Wang, Manting Yang, Jun Bian, Xuequn Shang
    Journal of Computer Research and Development. 2025, 62(12): 2974-2982.

    Cancer is an exceptionally complex and highly heterogeneous disease with dynamic changes. Its occurrence and development are accompanied by a large number of gene mutations and functional disorders. Identifying biomarkers related to cancer stages is crucial for understanding the pathogenic and developmental mechanisms of cancer. However, the existing research on cancer biomarker recognition often treat individual genes as isolated nodes and usually only focus on the binary classification of cancer, ignoring the significant differences among different stages of cancer. To overcome the above issues, we first construct a RRN (regression residual network) for each cancer stage, and then analyze the nodes and edges of RRN in each stage. After that, the multi-source data mining is conducted in biological pathways, and the entire process of cancer evolution is characterized along with stages. By doing this, both biomarkers for cancer binary classification and multi-stage classification are obtained, and they are validated on GSE10072 and GSE42171 datasets, respectively. The experimental results show that the obtained biomarkers ALDOA and NME1 achieve competitive accuracy compared with existing methods by using only two genes for lung adenocarcinoma, and the biomarkers consisting of 17 edges achieve the improved accuracy by 14.86% by comparing with existing methods in terms of multi-stage classification.