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

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

Digital Communications and Networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

引用

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

DPIC: Decoupling Prompt and Intrinsic Characteristics for LLM Generated Text Detection 38

DPIC: Decoupling Prompt and Intrinsic Characteristics for LL...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Yu, Xiao Qi, Yuang Chen, Kejiang Chen, Guoqiang Yang, Xi Zhu, Pengyuan Shang, Xiuwei Zhang, Weiming Yu, Nenghai University of Science and Technology of China China Key Laboratory of Cyberspace Security Ministry of Education China Hefei High-dimensional Data Technology China

Large language models (LLMs) have the potential to generate texts that pose risks of misuse, such as plagiarism, planting fake reviews on e-commerce platforms, or creating inflammatory false tweets. Consequently, detecting whether a text is generated by LLMs has become increasingly important. Existing high-quality detection methods usually require access to the interior of the model to extract the intrinsic characteristics. However, since we do not have access to the interior of the black-box model, we must resort to surrogate models, which impacts detection quality. In order to achieve high-quality detection of black-box models, we would like to extract deep intrinsic characteristics of the black-box model generated texts. We view the generation process as a coupled process of prompt and intrinsic characteristics of the generative model. Based on this insight, we propose to decouple prompt and intrinsic characteristics (DPIC) for LLM-generated text detection method. Specifically, given a candidate text, DPIC employs an auxiliary LLM to reconstruct the prompt corresponding to the candidate text, then uses the prompt to regenerate text by the auxiliary LLM, which makes the candidate text and the regenerated text align with their prompts, respectively. Then, the similarity between the candidate text and the regenerated text is used as a detection feature, thus eliminating the prompt in the detection process, which allows the detector to focus on the intrinsic characteristics of the generative model. Compared to the baselines, DPIC has achieved an average improvement of 6.76% and 2.91% in detecting texts from different domains generated by GPT-4 and Claude3, respectively. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing

引用

Frontiers of Computer Science 2024年第6期18卷 215-227页

作者： Xiaochuan LIN Kaimin WEI Zhetao LI Jinpeng CHEN Tingrui PEI College of Information Science and Technology&Cyberspace Security Jinan UniversityGuangzhou 510632China National&Local Joint Engineering Research Center of Network Security Detection and Protection Technology Guangzhou 510632China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou 510632China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China

Spatial crowdsourcing(SC)is a popular data collection paradigm for numerous *** the increment of tasks and workers in SC,heterogeneity becomes an unavoidable difficulty in task *** researches only focus on the single-heterogeneous task ***,a variety of heterogeneous objects coexist in real-world SC *** dramatically expands the space for searching the optimal task allocation solution,affecting the quality and efficiency of data *** this paper,an aggregation-based dual heterogeneous task allocation algorithm is put *** investigates the impact of dual heterogeneous on the task allocation problem and seeks to maximize the quality of task completion and minimize the average travel *** problem is first proved to be ***,a task aggregation method based on locations and requirements is built to reduce task ***,a time-constrained shortest path planning is also developed to shorten the travel distance in a *** that,two evolutionary task allocation schemes are ***,extensive experiments are conducted based on real-world datasets in various *** with baseline algorithms,our proposed schemes enhance the quality of task completion by up to 25% and utilize 34% less average travel distance.

关键词： task allocation aggregation shortest path dual heterogeneous spatial crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Subsampling Decomposition based k-Space Refinement for Accelerated MRI Reconstruction

Subsampling Decomposition based k-Space Refinement for Accel...

引用

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

作者： Qiao, Xiaoyu Li, Weisheng Xiao, Bin Huang, Yuping Yang, Lijian Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China

ISBN: (纸本)9798350368741

In accelerated MRI reconstruction problem, directly recovering all the missing k-space data from undersampled measurements is highly ill-posed and often leads to suboptimal performance. To address the problem, we propose a novel deep unfolding network (DUN) with subsampling decomposition (SD) based k-space refinement to mitigate the ill-posedness. Our method employs a parallel network architecture with a primary branch unfolded by gradient descent-inspired optimization process (GD-PB) for reconstruction. Additionally, we introduce an SD-based auxiliary branch (SD-AB) that decompose the inverse problem into moderately corrupted subproblems. We design a novel subsampling mask predictor that captures both global and local spatial correlations in k-space, ensuring the SD-AB effectively preserves the most well-reconstructed subsets as reliable region (RR). The RR in SD-AB is used to periodically refine the intermediate outputs of the GD-PB, achieving improved accuracy. Experimental results reveal that our method significantly outperforms conventional and SD-based DUN techniques, achieving superior PSNR and SSIM results compared with cutting-edge methods. © 2025 IEEE.

关键词： compressed sensing deep unfolded network MRI reconstruction parallel imaging subsampling decomposition

来源：评论

学校读者我要写书评

暂无评论

Learning Preconditioners in Gates-controlled Deep Unfolding Networks based on Quasi-Newton Methods For Accelerated MRI Reconstruction

Learning Preconditioners in Gates-controlled Deep Unfolding ...

引用

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

ISBN: (纸本)9798350368741

Deep unfolding networks (DUNs) have made significant progress in MRI reconstruction, successfully tackling the problem of prolonged imaging time. However, the ill-conditioned nature of MRI reconstruction often causes slow convergence in iterative optimization, potentially compromising the performance of DUNs. In this study we propose a preconditioned and gates-controlled DUN (PGDUN) to address these challenges. Our approach starts with optimizing the step size of proximal gradient descent (PGD) through a preconditioner. To improve flexibility and adaptability, we relax the constrains on quasi-newton-based optimization procedure. We design ConvLSTM-based modules, where the gate units automatically preserve necessary long- and short-term information, facilitating the learning of optimized variables and their combinations. Furthermore, we design gate units to modulate the features fed to regularizers across different iterations, boosting their robustness against potential accumulated errors. Evaluations using PSNR and SSIM metrics reveal that our approach outperforms existing state-of-the-art methods, achieving superior reconstruction results across various sequences. © 2025 IEEE.

关键词： Compressed Sensing LSTM MRI reconstruction Preconditioner Quasi-Newton

来源：评论

学校读者我要写书评

暂无评论

Stacking U-Nets in U-shape: Redesigning the Information Flow in Model-based Networks for MRI Reconstruction

Stacking U-Nets in U-shape: Redesigning the Information Flow...

引用

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

ISBN: (纸本)9798350368741

Model-based networks have shown convincing performance in MRI reconstruction. However, the unrolled cascades within the networks are constrained to solely obtain information from the preceding counterpart, resulting in potential error accumulation. Moreover, the linear structure fails to address the challenge of recovering fine-grained details. To tackle these problems, we propose to redesign the information flow in model-based networks. Our method features a large U-shaped network, where the nodes are built with unrolled cascades and U-Net-based regularizers. We design an input-level integration module to help the cascades acquire information from adjacent and skip-connected counterparts, building robust mappings to the target. We further design a coarse-to-fine feature-level integration module, aiming at guiding the network to progressively recover fine details. Intermediate reconstructions produced by subnetworks of different scales are integrated, enabling the extraction of complementary information to enhance the final performance. Compared with cutting-edge methods on different datasets, our method exhibits superior performances. © 2025 IEEE.

关键词： compressed sensing deep learning model-based MRI reconstruction U-Net

来源：评论

学校读者我要写书评

暂无评论

Research on the Parallel SM4-OFB Acceleration Based on Multiple Rounds of Iteration 3

Research on the Parallel SM4-OFB Acceleration Based on Multi...

引用

3rd International Conference on Artificial Intelligence and Computer Information Technology, AICIT 2024

作者： Han, Ya Wang, Mingsheng Li, Yongqiang Ren, Lifeng Institute of Information Engineering CAS Key Laboratory of Cyberspace Security Defense Beijing China Chongqing Research Institute of Big Data Peking University Chongqing China

ISBN: (纸本)9798350365443

In OFB mode, the output of the cryptographic algorithm is fed back to the input of the cryptographic algorithm. The OFB mode does not directly encrypt plaintext through cryptographic algorithms, but generates ciphertext blocks by XOR combining plaintext blocks with the output of cryptographic algorithms. In OFB encryption mode, messages are treated as bitstreams, and the output of block encryption is added to the encrypted messages, making it difficult for bit errors to propagate. The SM4 algorithm is a symmetric cryptographic technique developed by the Chinese National Cryptographic Administration and standardized as part of the State Encryption Standard in China. SM4 is widely adopted in various applications, including wireless communication systems and secure data transmissions. In this paper, a fast implementation method of SM4 in OFB mode is proposed. We calculate the possible parallelization operations in OFB mode using the operational relationship between the SM4 algorithm round functions, and ensure the correctness of SM4-OFB encryption through a feedback compensation method. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing graph representation learning via type-aware decoupling and node influence allocation

引用

Applied Intelligence 2025年第6期55卷 1-14页

作者： Zhu, Guochang Hu, Jun Liu, Li Zhang, Qinghua Wang, Guoyin School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China

The traditional graph representation methods can fit the information of graph with low-dimensional vectors, but they cannot interpret their composition, resulting in insufficient security. Graph decoupling, as a method of graph representation, can analyze the latent factors composing the graph representation vectors. However, in current graph decoupling methods, the number of factors is a hyperparameter, and enforce uniform decoupling vector dimensions which leads to information loss or redundancy. To address these issues, we propose a type-aware graph decoupling based on influence called Variational Graph Decoupling Auto-Encoder (VGDAE). It uses node labels as interpretable and objectively existing natural semantics for decoupling and allocates embedding space based on node influence, addressing the issues of manually setting the number of factors in traditional graph decoupling and the mismatch between node information size and embedding space. On the Cora, Citeseer, and fb-CMU datasets, VGDAE shows the impact of different node classes as decoupling targets on classification tasks. Furthermore, we perform visualization of the representations, VGDAE exhibits performance improvements of 2% in classification tasks and 12% in clustering tasks when compared with baseline models. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Decode the Dark Side of the Language: Applications of LLMs in the Dark Web 9

Decode the Dark Side of the Language: Applications of LLMs i...

引用

9th IEEE International Conference on data Science in cyberspace, DSC 2024

作者： Chen, Hongfan Diao, Yigang Xiang, Hui Huo, Yixuan Xie, Xiaqing Zhao, Jiapeng Wang, Xuebin Sun, Yanwei Shi, Jinqiao Beijing University of Posts and Telecommunications School of Cyberspace Security Beijing China Zhejiang University The State Key Laboratory of Blockchain and Data Security Hangzhou China Beijing China Data and Technology Support Center Cyberspace Administration of China Beijing China Chinese Academy of Sciences Institute of Information Engineering Beijing China

ISBN: (纸本)9798350391367

Previous studies have discovered that Transformers pre-trained on large scale datasets have a great advantage over traditional methods and can achieve human-level performance in many NLP tasks. Various encoder-only models like BERT and RoBERTa are used in the researches of the language in the Dark Web and most of them have achieved state-of-the-art performance. However, decoder-only models are not frequently used as they were considered to be unsuitable for NLU tasks until recent advancements in large language models. In this paper, we discuss the application of large scale decoder-only models in NLP tasks of real-world Dark Web research. We explore the capabilities of these models with the most realistic datasets in this specific domain. Surprisingly, results show that decoder-only models can achieve similar or better performance compared with state-of-the-art encoder-only model in some cases and show their own unique advantages in such field. We also discuss the limitations of these models and the challenges associated with their application in such field. Our study unveils the potential of decoder-only models in NLP tasks of real-world Dark Web research. © 2024 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：