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

10th IEEE Joint International Information Technology and Artificial Intelligence Conference, ITAIC 2022

作者： Wang, Jue Zhu, Yuefei Lin, Wei Li, Ding Tang, Ke State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (数字)9781665422079

ISBN: (纸本)9781665422079

Website Fingerprinting (WF) is a traffic analysis attack. The potential local adversary can infer the user's web activity by extracting implicit pattern information from traffic traces. Leveraging the latest advances in Deep Learning, the adversary has achieved 98% detection accuracy in closed-world tests. This poses a new challenge to the traditional WF defense methods. In this paper, we propose a new defense method, the proposed dissimilarity measure and local optimal mutation strategy greatly reduce the computational cost. Experimental results show that the method achieves the generation of adversarial traffic trace with shorter preparation times and better defensive effects. Moreover, it also has great potential in the face of more powerful attacks that may emerge in the future. © 2022 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Stance Detection for Social Text: Inference-Enhanced Multi-Task Learning with Machine-Annotated Supervision

Stance Detection for Social Text: Inference-Enhanced Multi-T...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Pi, Qiankun Lu, Jicang Sun, Yepeng Fan, Qinlong Zhou, Xukun Shang, Shouxin State Key Laboratory of Mathematical Engineering and Advanced Computing Henan Zhengzhou China School of Information Renmin University of China Beijing China

ISBN: (纸本)9798350368741

Stance detection, a natural language processing technique, captures user attitudes on controversial social media topics. However, the semantic ambiguity of social texts makes accurate stance determination challenging. Existing annotated data is often domain-specific, resulting in poor model generalization for unseen targets and cross-domain scenarios. To tackle this challenge, we introduce inference tasks related to stance detection as auxiliary tasks and use a multitask learning approach to improve the model's understanding of textual semantics. Meanwhile, to alleviate the scarcity of annotated data, we use argumentation corpus with abundant resources as the source domain to train the basic stance detection model. We integrate this model with a large-scale framework to facilitate weakly supervised learning for machine annotation of unlabeled social texts, thereby boosting the model's adaptability across different targets and domains. Experimental results on four Twitter datasets demonstrate that our method can significantly improve the model's stance discriminative ability and generalization performance. © 2025 IEEE.

关键词： argumentation corpus machine annotation multitask learning stance detection

来源：评论

学校读者我要写书评

暂无评论

UEFI Security Threats Introduced by S3 and Mitigation Measure 7

UEFI Security Threats Introduced by S3 and Mitigation Measur...

引用

7th International Conference on Signal and Image Processing, ICSIP 2022

作者： Jiao, Weihua Li, Qingbao Chen, Zhifeng Cao, Fei State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (数字)9781665495639

ISBN: (纸本)9781665495639

UEFI is widely used as the new generation BIOS, except for some new features, it also brings some security issues. The threat brought by S3 sleep jeopardizes the security of computer platforms seriously. An attacker can disable the write protection of UEFI by tampering with the S3 boot script or execute arbitrary code by exploiting dispatch opcodes with the entry point out of SMRAM. Therefore, it is vital to solve the security issue related to S3 and propose effective mitigation measures. Based on the S3 related modules and the risk propagation between modules, we propose the MBPE algorithm to identify the key vulnerability of the platform through formal analysis. Aiming at this critical vulnerability, based on the LockBox protection mechanism, we propose a mitigation measure. It includes changing the storage time of the boot script, the changed storage address of the boot script and a specific UEFI variable. After taking this mitigation measure, the attacker cannot obtain the boot script and its location simultaneously. Such, it can protect the boot script from being tampered with and further attackers. Finally, based on the real attack cases, we evaluate the mitigation measure by the abstraction of attack path and mathematical methods. Based on the evaluation finding, the mitigation measures can prevent S3related attacks and effectively improve platform security. © 2022 IEEE.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

VulD-CodeBERT: CodeBERT-Based Vulnerability Detection Model for C/C++ Code 6

VulD-CodeBERT: CodeBERT-Based Vulnerability Detection Model ...

引用

6th International Conference on Communications, Information System and Computer engineering, CISCE 2024

作者： Xiong, Zhe Dong, Weiyu School of Computer Science and Artificial Intelligence Zhengzhou University Zhengzhou China Information Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9798350353174

Recently, deep learning techniques have received widespread attention in code vulnerability and vulnerability detection. However, there are some problems with current vulnerability detection techniques, firstly, because of the non-homogeneity of vulnerability categories and quantities, there are omission false positives and overfitting problems for vulnerabilities with a small amount of data. Second, the existing detection methods have limited ability to characterize the code, there is insufficient depth of characterization, does not contain all of its vulnerability characteristics or is interspersed with useless information. Finally, the current research does not use the powerful feature mining capability of pre-trained models and does not employ model fusion to increase the effectiveness of model vulnerability detection. To solve the above problems, this paper proposes a new deep learning based pre-trained model for code vulnerability detection tool VulD-CodeBERT. By fine-tuning CodeBERT, a code adaptation extension for pre-trained models developed by Microsoft, the CodeBERT model can solve the problem of not being able to learn the vulnerability patterns due to insufficient data, thus resulting in missed false alarms. The sequence output from the CodeBERT model are added to a BiLSTM network with an attention mechanism to mine the local key features of the vulnerabilities combined with the global features of the pooler output from the CodeBERT model to deeply mine the dependencies between the vulnerability statements and derive the probability of the existence of the vulnerability. For vulnerability types that are difficult to uncover captured features or the number of samples is not enough, a polynomial plain Bayesian classifier is used for detection, and finally the two models are combined to deeply mine the vulnerability features, thus solving the problem of difficult and small samples, and reducing the leakage rate and false alarm rate. Experimental results sh

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient and Privacy-Preserving Anomaly Detection of Blockchain-Based Cryptocurrency Transactions 25th

Towards Efficient and Privacy-Preserving Anomaly Detection ...

引用

25th International Conference on Information and Communications Security, ICICS 2023

作者： Song, Yuhan Zhu, Yuefei Wei, Fushan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Henan Key Laboratory of Network Cryptography Technology Zhengzhou China

ISBN: (纸本)9789819973552

In recent years, a growing number of breaches targeting cryptocurrency exchanges have damaged the credibility of the entire cryptocurrency ecosystem. To prevent further harm, it’s crucial to detect the anomalous behaviors hidden within cryptocurrency transactions and offer predictive suggestions. However, details of transaction records must be carefully analyzed for effective detection, and this information could be exploited by adversaries to launch attacks such as de-anonymization and model interference. As a result, it is essential to prioritize privacy preservation when designing an anomaly detection system for cryptocurrency transactions. In this paper, we propose a privacy-preserving anomaly detection (PPad) scheme for cryptocurrency transactions based on a decision tree model, which achieves privacy preservation by using additively homomorphic encryption and matrix perturbation techniques. We also design and implement PPad’s underlying protocol in a cloud outsourcing environment. The correctness and privacy properties of PPad have been proven through detailed analysis. Experimental results show that our scheme can offer privacy assurance with desirable detection effectiveness and efficiency, making it suitable for real-world applications. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

SPAFuzz: Web Security Fuzz Testing Tool Based on Fuzz Testing and Genetic Algorithm 4

SPAFuzz: Web Security Fuzz Testing Tool Based on Fuzz Testin...

引用

4th International Conference on Consumer Electronics and Computer engineering, ICCECE 2024

作者： Lin, Jiang Dong, Weiyu School of Computer Science and Artificial Intelligence Zhengzhou University Zhengzhou China Information Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9798350384062

Fuzzing is one of the most effective methods currently available for detecting web vulnerabilities. However, traditional fuzzing suffers from issues such as low coverage and limited diversity in test cases. To address these issues, we propose a way to generate test cases based on dynamic feature libraries and attack models by analysing the characteristics of SQL and XSS. Additionally, we introduce a genetic algorithm to guide the population's evolution by monitoring the state changes of the web application. Furthermore, we improved the selection phase of the genetic algorithm to optimally deform multiple iterations for use cases with low fitness values in order to preserve the population diversity to expand the attack capability of the test cases and based on this the SPAFuzz fuzzy testing tool was implemented. Experimental results show that SPAFuzz is able to detect more network vulnerabilities than Sqlmap and Powerfuzzer. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Honeypot Detection Method Based on Anomalous Requests Response Differences 23

Honeypot Detection Method Based on Anomalous Requests Respon...

引用

6th International Conference on Electronics, Communications and Control engineering, ICECC 2023

作者： Chen, Xingyu Lu, Bin Sun, Rongbo Jiang, Mi State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University China Cyber Security College Information Engineering University China

ISBN: (纸本)9798400700002

Honeypot detection is a popular technology in the current cyber security, which can be used to check the disguise and protection level of deployed honeypots. To address the problem of low detection accuracy of existing honeypot detection techniques, this paper proposes a honeypot detection method based on the differences of anomalous requests' response. The method uses the anomalous request packet construction method designed in this paper to construct anomalous request packets, and sends the constructed anomalous request packets to the identity-known devices to collect the responses. Combined with the responses analysis method designed in this paper, the responses are analyzed in terms of similarity in both content and structure dimensions, which enables the evaluation of anomalous request packets in turn, and the selection of those that can consistently trigger a differential response from the honeypots to form a probing packets set based on anomaly. A deep learning model aiming at honeypot detection is designed using the responses of the identity-known devices in response to the probing packets set based on anomaly. The model and the responses of the nodes to detect to the probing packets set based on anomaly are used to detect honeypots. Experiment shows that the method is able to detect the nodes to detect with an accuracy of 96.4%. © 2023 ACM.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Resolving Anonymous Nodes Based on "Watermelon Patterns" Towards Constructing Router-Level Topology in Mesh Network 29th

Resolving Anonymous Nodes Based on "Watermelon Patterns" Tow...

引用

29th International Conference on Computational and Experimental engineering and Sciences, ICCES 2023

作者： Li, Ruixiang Feng, Xinzhu Liu, Chong Yuan, Fuxiang Ding, Shichang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Key Laboratory of Cyberspace Situation Awareness of Henan Province Zhengzhou China Sichuan University Chengdu China

ISBN: (纸本)9783031425141

Router-level topology, portraying the connection relationship between network devices, is important for discovering key devices in network. In actual networks, there are some anonymous routers, which do not respond traceroute due to network congestion, firewall security settings, router response rate limitations, and other factors. As these anonymous routers are difficult to eliminate, it makes the constructed router-level topology huge in size. Currently, the time cost of finding key nodes is high. Resolving anonymous nodes for reducing the topology size is necessary to improve the efficiency in finding key node. Although anonymous route resolving methods have been available, they are difficult to handle two-hop anonymous route structures in mesh topologies. To this end, based on the four structures summarized in Graph Based Induction (GBI) method, we propose a method to resolve anonymous nodes based on "watermelon patterns". Combining with Kapar, an alias IP merging method, to build router-level topologies in mesh networks. We have conducted experiments in 8 cities, such as New York, Tokyo, Seoul and so on. The experimental results show that, our method can handle the local topology containing two-hop anonymous nodes. And using our method to further reduce the size of the router-level topology built using GBI and Kapar, which is conducive to improving the efficiency of discovering key nodes in the topology. © 2024, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

An Opposition-Based Learning Adaptive Chaotic Particle Swarm Optimization Algorithm

引用

Journal of Bionic engineering 2024年第6期21卷 3076-3097页

作者： Chongyang Jiao Kunjie Yu Qinglei Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Strategic Support Force Information Engineering UniversityZhengzhou450001China Henan Information Engineering School Zhengzhou Vocational College of Industrial SafetyZhengzhou450000China School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou450001China School of Computer and Artificial Intelligence Zhengzhou UniversityZhengzhou450001China

To solve the shortcomings of Particle Swarm Optimization(PSO)algorithm,local optimization and slow convergence,an Opposition-based Learning Adaptive Chaotic PSO(LCPSO)algorithm was *** chaotic elite opposition-based learning process was applied to initialize the entire population,which enhanced the quality of the initial individuals and the population diversity,made the initial individuals distribute in the better quality areas,and accelerated the search efficiency of the *** inertia weights were adaptively customized during evolution in the light of the degree of premature convergence to balance the local and global search abilities of the algorithm,and the reverse search strategy was introduced to increase the chances of the algorithm escaping the local *** LCPSO algorithm is contrasted to other intelligent algorithms on 10 benchmark test functions with different characteristics,and the simulation experiments display that the proposed algorithm is superior to other intelligence algorithms in the global search ability,search accuracy and convergence *** addition,the robustness and effectiveness of the proposed algorithm are also verified by the simulation results of engineering design problems.

关键词： PSO Opposition-based learning Chaotic motion Inertia weight Intelligent algorithm

来源：评论

学校读者我要写书评

暂无评论

Pixel+ and Pixel++: Compact and Efficient Forward-Secure Multi-Signatures for PoS Blockchain Consensus 33

Pixel+ and Pixel++: Compact and Efficient Forward-Secure Mul...

引用

33rd USENIX Security Symposium, USENIX Security 2024

作者： Wei, Jianghong Tian, Guohua Wang, Ding Guo, Fuchun Susilo, Willy Chen, Xiaofeng Xidian University China State Key Laboratory of Mathematical Engineering and Advanced Computing China College of Cyber Science Nankai University China School of Computing and Information Technology University of Wollongong Australia

ISBN: (纸本)9781939133441

Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the security of PoS blockchains once signing keys get corrupted. That is, after an adversary obtains enough signing keys, it can break the immutable nature of PoS blockchains by forking the chain and modifying the history from some point in the past. Forward-secure multi-signature (FS-MS) schemes can overcome this issue by periodically updating signing keys. The only FS-MS construction currently available is Drijvers et al's Pixel, which builds on pairing groups and only achieves forward security at the time period level. In this work, we present new FS-MS constructions that either are free from pairing or capture forward security at the individual message level (i.e., fine-grained forward security). Our first construction Pixel+ works for a maximum number of time periods T. Pixel+ signatures consist of only one group element, and can be verified using two exponentiations. It is the first FS-MS from RSA assumption, and has 3.5x and 22.8x faster signing and verification than Pixel, respectively. Our second FS-MS construction Pixel++ is a pairing-based one. It immediately revokes the signing key's capacity of re-signing the message after creating a signature on this message, rather than at the end of the current time period. Thus, it provides more practical forward security than Pixel. On the other hand, Pixel++ is almost as efficient as Pixel in terms of signing and verification. Both Pixel+ and Pixel++ allow for non-interactive aggregation of signatures from independent signers and are proven to be secure in the random oracle model. In addition, they also support the aggregation of public keys, significantly reducing the storage overhead on PoS blockchains. We demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we prov

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：