检索结果-内蒙古大学图书馆

Towards improving detection performance for malware with a correntropy-based deep learning method

学校读者我要写书评

暂无评论

Digital Communications and Networks 2021年第4期7卷 570-579页

作者： Xiong Luo Jianyuan Li Weiping Wang Yang Gao Wenbing Zhao School of Computer and Communication Engineering University of Science and Technology BeijingBeijing100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China Beijing Intelligent Logistics System Collaborative Innovation Center Beijing101149China China Information Technology Security Evaluation Center Beijing100085China Department of Electrical Engineering and Computer Science Cleveland State UniversityClevelandOH44115USA

With the rapid development of Internet of Things(IoT)technologies,the detection and analysis of malware have become a matter of concern in the industrial application of Cyber-Physical system(CPS)that provides various services using the IoT ***,many advanced machine learning methods such as deep learning are popular in the research of malware detection and analysis,and some achievements have been made so ***,there are also some *** example,considering the noise and outliers in the existing datasets of malware,some methods are not robust ***,the accuracy of malware classification still needs to be *** at this issue,we propose a novel method that combines the correntropy and the deep learning *** our proposed method for malware detection and analysis,given the success of the mixture correntropy as an effective similarity measure in addressing complex datasets with noise,it is therefore incorporated into a popular deep learning model,i.e.,Convolutional Neural Network(CNN),to reconstruct its loss function,with the purpose of further detecting the features of *** present the detailed design process of our ***,the proposed method is tested both on a real-world malware dataset and a popular benchmark dataset to verify its learning performance.

关键词： Malware detection Mixture correntropy Deep learning Convolutional neural network(CNN)

Are we there yet? An Industrial Viewpoint on Provenance-based Endpoint Detection and Response Tools

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Dong, Feng Li, Shaofei Jiang, Peng Li, Ding Wang, Haoyu Huang, Liangyi Xiao, Xusheng Chen, Jiedong Luo, Xiapu Guo, Yao Chen, Xiangqun Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science Peking University China Arizona State University United States Sangfor Technologies Inc. China The Hong Kong Polytechnic University Hong Kong

Provenance-Based Endpoint Detection and Response (P-EDR) systems are deemed crucial for future APT defenses. Despite the fact that numerous new techniques to improve P-EDR systems have been proposed in academia, it is still unclear whether the industry will adopt P-EDR systems and what improvements the industry desires for P-EDR systems. To this end, we conduct the first set of systematic studies on the effectiveness and the limitations of P-EDR systems. Our study consists of four components: a one-to-one interview, an online questionnaire study, a survey of the relevant literature, and a systematic measurement study. Our research indicates that all industry experts consider P-EDR systems to be more effective than conventional Endpoint Detection and Response (EDR) systems. However, industry experts are concerned about the operating cost of P-EDR systems. In addition, our research reveals three significant gaps between academia and industry: (1) overlooking client-side overhead;(2) imbalanced alarm triage cost and interpretation cost;and (3) excessive server-side memory consumption. This paper's findings provide objective data on the effectiveness of P-EDR systems and how much improvements are needed to adopt P-EDR systems in industry. Copyright © 2023, The Authors. All rights reserved.

关键词：

NODLINK: An Online system for Fine-Grained APT Attack Detection and Investigation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Shaofei Dong, Feng Xiao, Xusheng Wang, Haoyu Shao, Fei Chen, Jiedong Guo, Yao Chen, Xiangqun Li, Ding School of Computer Science Peking University China Arizona State University United States Case Western Reserve University United States Sangfor Technologies Inc. China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China

Advanced Persistent Threats (APT) attacks have plagued modern enterprises, causing significant financial losses. To counter these attacks, researchers propose techniques that capture the complex and stealthy scenarios of APT attacks by using provenance graphs to model system entities and their dependencies. Particularly, to accelerate attack detection and reduce financial losses, online provenance-based detection systems that detect and investigate APT attacks under the constraints of timeliness and limited resources are in dire need. Unfortunately, existing online systems usually sacrifice detection granularity to reduce computational complexity and produce provenance graphs with more than 100,000 nodes, posing challenges for security admins to interpret the detection results. In this paper, we design and implement NODLINK, the first online detection system that maintains high detection accuracy without sacrificing detection granularity. Our insight is that the APT attack detection process in online provenance-based detection systems can be modeled as a Steiner Tree Problem (STP), which has efficient online approximation algorithms that recover concise attack-related provenance graphs with a theoretically bounded error. To utilize the frameworks of the STP approximation algorithm for APT attack detection, we propose a novel design of in-memory cache, an efficient attack screening method, and a new STP approximation algorithm that is more efficient than the conventional one in APT attack detection while maintaining the same complexity. We evaluate NODLINK in a production environment. The open-world experiment shows that NODLINK outperforms two state-of-the-art (SOTA) online provenance analysis systems by achieving magnitudes higher detection and investigation accuracy while having the same or higher throughput. Copyright © 2023, The Authors. All rights reserved.

关键词： Approximation algorithms

ReconBoost: boosting can achieve modality reconcilement 24

学校读者我要写书评

暂无评论

ReconBoost: boosting can achieve modality reconcilement

Proceedings of the 41st International Conference on Machine Learning

作者： Cong Hua Qianqian Xu Shilong Bao Zhiyong Yang Qingming Huang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost.

关键词：

CUE: Compound Uniform Encoding for Writer Retrieval

学校读者我要写书评

暂无评论

CUE: Compound Uniform Encoding for Writer Retrieval

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Jiakai Luo Hongwei Lu Xin Nie Shenghao Liu Xianjun Deng Chenlu Zhu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Chutian Expressway Digital Technology Co. Ltd. China

Writer retrieval is crucial in document forensics and historical document analysis. However, due to the difference in syntactic structure between Chinese and other languages, the existing methods may not be directly applied to Chinese writer retrieval. Previous work on Chinese writer retrieval does not overcome the performance degradation problem when the number of samples grows. In this paper, we propose a novel compound uniform encoding algorithm (CUE) for Chinese writer retrieval, which mainly consists of a combined feature extraction module (CFE) and a prototype substitution module (PS). The CFE module combines two complementary features from image filter response and character contour. It counts local symmetries and edge co-occurrence pairs. PS module substitutes the outliers with the class prototypes to alleviate the influence of the outliers. Finally, the weighted Chi-square distance is applied to measure the similarity between writer and text. To verify the superiority of our proposed method, experiments are conducted on four public datasets and our built dataset. The results validate that CUE outperforms the state-of-the-art algorithms on mAP metric.

关键词： Weight measurement Measurement Text analysis Image edge detection Prototypes Syntactics Feature extraction

Distributed privacy-preserving keyword querying for integrated data in IoT networks via function secret sharing

学校读者我要写书评

暂无评论

Information Fusion 2025年 123卷

作者： Shao, Wei Wang, Lianhai Jia, Chunfu Wang, Qizheng Wang, Jinpeng Xu, Shujiang Zhang, Shuhui Li, Mingyue Shandong Jinan250014 China Key Laboratory of Data and Intelligent System Security Ministry of Education Nankai University Tianjin300350 China School of Cyber Sciences Hebei University Hebei Baoding China

The growing adoption of IoT applications underscores the need for advanced data fusion and information acquisition techniques, driving demand for secure, privacy-preserving querying of integrated IoT data. Existing schemes like searchable encryption are practical but leak access patterns, while leakage-free methods using Oblivious RAM or cryptographic techniques incur significant resource overhead. In this paper, we propose PQBL, a framework for privacy-preserving, trusted data integration and search, leveraging distributed trust against malicious attackers. Our query scheme combines function secret sharing and blockchain to enable efficient, privacy-preserving searches on encrypted IoT data. To improve search efficiency, we introduce a compressed RAMBO Bloom Filter for keyword trapdoors. Formal security analysis shows that PQBL leaks no search patterns and is secure against Privacy under Selective Chosen-Plaintext Attacks. Extensive experiments on the PQBL prototype validate its effectiveness and efficiency. © 2025

关键词： Privacy by design

Satisfaction-Aware Incentive Scheme for Federated Learning in Industrial Metaverse: DRL-Based Stackbelberg Game Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Xiaohuan Qin, Shaowen Tang, Xin Kang, Jiawen Ye, Jin Zhao, Zhonghua Niyato, Dusit Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China Nanning530001 China School of Automation Guangdong University of Technology Guangzhou510006 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning530000 China School of Computer and Electronic Information Guangxi University Nanning530000 China College of Computing and Data Science Nanyang Technological University Singapore

Industrial Metaverse leverages the Industrial Internet of Things (IIoT) to integrate data from diverse devices, employing federated learning and meta-computing to train models in a distributed manner while ensuring data privacy. Achieving an immersive experience for industrial Metaverse necessitates maintaining a balance between model quality and training latency. Consequently, a primary challenge in federated learning tasks is optimizing overall system performance by balancing model quality and training latency. This paper designs a satisfaction function that accounts for data size, Age of Information (AoI), and training latency. Additionally, the satisfaction function is incorporated into the utility functions to incentivize node participation in model training. We model the utility functions of servers and nodes as a two-stage Stackelberg game and employ a deep reinforcement learning approach to learn the Stackelberg equilibrium. This approach ensures balanced rewards and enhances the applicability of the incentive scheme for industrial Metaverse. Simulation results demonstrate that, under the same budget constraints, the proposed incentive scheme improves at least 23.7% utility compared to existing schemes without compromising model accuracy. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

Towards Unified Token Learning for Vision-Language Tracking

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zheng, Yaozong Zhong, Bineng Liang, Qihua Li, Guorong Ji, Rongrong Li, Xianxian The Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China The Guangxi Key Laboratory of Multi-Source Information Mining and Security Guangxi Normal University Guilin541004 China The School of Computer Science and Technology Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences Beijing100049 China Media Analytics and Computing Lab Department of Artificial Intelligence School of Informatics Xiamen University 361005 China

In this paper, we present a simple, flexible and effective vision-language (VL) tracking pipeline, termed MMTrack, which casts VL tracking as a token generation task. Traditional paradigms address VL tracking task indirectly with sophisticated prior designs, making them over-specialize on the features of specific architectures or mechanisms. In contrast, our proposed framework serializes language description and bounding box into a sequence of discrete tokens. In this new design paradigm, all token queries are required to perceive the desired target and directly predict spatial coordinates of the target in an auto-regressive manner. The design without other prior modules avoids multiple sub-tasks learning and hand-designed loss functions, significantly reducing the complexity of VL tracking modeling and allowing our tracker to use a simple cross-entropy loss as unified optimization objective for VL tracking task. Extensive experiments on TNL2K, LaSOT, LaSOText and OTB99-Lang benchmarks show that our approach achieves promising results, compared to other state-of-the-arts. Copyright © 2023, The Authors. All rights reserved.

关键词： Modeling languages

Disentangled Noisy Correspondence Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China SGIT AI Lab State Grid Shaanxi Electric Power Company Limited State Grid Corporation of China Shaanxi China The School of Information Science and Technology University of Science and Technology China United Arab Emirates The Baidu Inc China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of MII and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal input for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL's efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning