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

NDFuzz:a non-intrusive coverage-guided fuzzing framework for virtualized network devices

Cybersecurity 2023年第1期6卷 54-74页

作者： Yu Zhang Nanyu Zhong Wei You Yanyan Zou Kunpeng Jian Jiahuan Xu Jian Sun Baoxu Liu Wei Huo Institute of Information Engineering Chinese Academy of SciencesBejingChina School of Cyber Security University of Chinese Academy of SciencesBejingChina Key Laboratory of Network Assessment Technology Chinese Academy of SciencesBeijingChina Beijing Key Laboratory of Network Security and Protection Technology BeijingChina Renmin University of China BeijingChina

network function virtualization provides programmable in-network middlewares by leveraging virtualization tech-nologies and commodity hardware and has gained popularity among all mainstream network device *** it is challenging to apply coverage-guided fuzzing,one of the state-of-the-art vulnerability discovery approaches,to those virtualized network devices,due to inevitable integrity protection adopted by those *** this paper,we propose a coverage-guided fuzzing framework NDFuzz for virtualized network devices with a novel integrity protec-tion bypassing method,which is able to distinguish processes of virtualized network devices from hypervisors with a carefully designed non-intrusive page global directory inference *** implement NDFuzz atop of two black-box fuzzers and evaluate NDFuzz with three representative network protocols,SNMP,DHCP and NTP,on nine popular virtualized network *** obtains an average 36%coverage improvement in comparison with its black-box *** discovers 2 O-Day vulnerabilities and 11-Day vulnerability with coverage guidance while the black-box fuzzer can find only one of *** discovered vulnerabilities are confirmed by corresponding vendors.

关键词： Coverage-guided fuzzing network devices network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge Computing

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Min Northeastern University School of Computer Science and Engineering The Engineering Research Center of Security Technology of Complex Network System Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University College of Information Science and Engineering State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China

Mobile edge computing (MEC) integrated with network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system *** first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multiper-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Fingerprint Revocable Template Protection of Variable Window-Based Random Permutation && Check Code 18th

Fingerprint Revocable Template Protection of Variable Windo...

引用

18th Chinese Conference on Biometric Recognition, CCBR 2024

作者： Xu, Zilong Bian, Weixin Hu, Yao Luo, Feng School of Computer and Information Anhui Normal University Anhui Wuhu241002 China Anhui Provincial Key Laboratory of Network and Information Security Anhui Wuhu241002 China

ISBN: (纸本)9789819610679

The Uniformly Random Permutation Hashing (URP-IoM) algorithm demonstrates reliable performance and irreversibility in biometric template protection. However, URP-IoM, through random permutation and Hadamard product computation, fails to retain the local features of the original feature vector, which can negatively impact recognition rates and result in varying performance across different datasets. Addressing the impact of biometric template revocability on recognition rates and performance, this paper proposes a novel revocable template method for fingerprint biometrics, called Variable Window-Based Random Permutation IoM Hashing &&Check Code (VWP-IoM &&CC). This method first generates variable windows and check codes based on the Euclidean features of the user password and original feature vector, then records the maximum index of the Hadamard product under the variable window. Finally, it combines the maximum index value with the check code. Experimental results show that the VWP-IoM &&CC algorithm improves recognition rates and performance in FVC2002 and FVC2004 (DB1, DB2), and also meets the requirements of revocability and unlinkability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion 10

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Gu, Qiliang Lu, Qin Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798331520861

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to 2. 2 8 % and a minimum of 1. 2 9 % across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Forward Legal Anonymous Group Pairing-Onion Routing for Mobile Opportunistic networks

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6595-6612页

作者： Zhu, Xiuzhen Lin, Limei Huang, Yanze Wang, Xiaoding Hsieh, Sun-Yuan Wu, Jie Fujian Normal University College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Fuzhou350117 China Fujian University of Technology School of Computer Science and Mathematics Fujian Fuzhou350118 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan Temple University Department of Computer and Information Science 1925 N. 12th St PhiladelphiaPA19122 United States

Mobile Opportunistic networks (MONs) often experience frequent interruptions in end-to-end connections, which increases the likelihood of message loss during delivery and makes users more susceptible to various cyber attacks. However, most currently proposed anonymous routing protocols are primarily designed for networks with stable connections, making it challenging to protect user identities in MONs. To address these challenges, we propose FLAG-POR (Forward Legal Anonymous Group Pairing-Onion Routing), a novel anonymous routing protocol specifically tailored to enhance message delivery anonymity and security in MONs. Specifically, we abstract the mobile opportunistic network as a contact graph. By introducing the concept of "groups» into the pairing-onion routing protocol, which encrypts messages and relay nodes layer by layer, we develop a novel group-based pairing-onion routing protocol. This protocol ensures message confidentiality and relay node anonymity, while also improving message forwarding rates, as any node within a group can potentially act as a relay. To ensure message authenticity, we employ the efficient SM2 signing algorithm to generate signatures for the message source. Furthermore, by incorporating parameters such as the public key validity period and master key validity period into the group pairing-onion routing protocol, we achieve forward security in message delivery. We conduct a thorough theoretical analysis of the protocol's security and performance. The experimental results demonstrate that our FLAG-POR protocol outperforms baseline anonymous protocols in terms of delivery success rate, traceability rate, path anonymity, and node anonymity. Additionally, the FLAG-POR scheme effectively resists three potential threats to the routing system: collusion attack threat, node identification threat, and path identification threat, in any situation. © 2002-2012 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Solving Multi-Objective Vehicle Routing Problems with Time Windows: A Decomposition-Based Multiform Optimization Approach

引用

Tsinghua Science and Technology 2024年第2期29卷 305-324页

作者： Yiqiao Cai Zifan Lin Meiqin Cheng Peizhong Liu Ying Zhou Xiamen Key Laboratory of Data Security and Blockchain Technology College of Computer Science and TechnologyHuaqiao UniversityXiamen361021China College of Engineering Huaqiao UniversityQuanzhou362000China School of Computer Sciences Shenzhen Institute of Information TechnologyShenzhen518000China

In solving multi-objective vehicle routing problems with time windows (MOVRPTW),most existing algorithms focus on the optimization of a single problem formulation. However,little effort has been devoted to exploiting valuable knowledge from the alternate formulations of MOVRPTW for better optimization performance. Aiming at this insufficiency,this study proposes a decomposition-based multi-objective multiform evolutionary algorithm (MMFEA/D),which performs the evolutionary search on multiple alternate formulations of MOVRPTW simultaneously to complement each other. In particular,the main characteristics of MMFEA/D are three folds. First,a multiform construction (MFC) strategy is adopted to construct multiple alternate formulations,each of which is formulated by grouping several adjacent subproblems based on the decomposition of MOVRPTW. Second,a transfer reproduction (TFR) mechanism is designed to generate offspring for each formulation via transferring promising solutions from other formulations,making that the useful traits captured from different formulations can be shared and leveraged to guide the evolutionary search. Third,an adaptive local search (ALS) strategy is developed to invest search effort on different alternate formulations as per their usefulness for MOVRPTW,thus facilitating the efficient allocation of computational resources. Experimental studies have demonstrated the superior performance of MMFEA/D on the classical Solomon instances and the real-world instances.

关键词： MOVRPTW multiform optimization multiform construction knowledge transfer adaptive local search

来源：评论

学校读者我要写书评

暂无评论

Securing STAR-FC-RIS empowered integrated sensing and multiuser communications against target eavesdropping

引用

Science China(information Sciences) 2024年第11期67卷 335-346页

作者： Shuying LIN Yulong ZOU Fu XIAO Bin LI School of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications School of Computer Science Nanjing University of Posts and Telecommunications Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications

This paper investigates a simultaneous-transmitting-and-reflecting fully-connected reconfigurable intelligent surface(STAR-FC-RIS) empowered integrated sensing and multiuser communications(ISAMC) network, where a dual-functional radar-communication base station detects a malicious radar target nearby and communicates with multiple legitimate users on the other side of the STAR-RIS. We utilize an integrated architecture that combines the fully-connected(FC)-RIS, an emerging type of beyond-diagonal(BD)-RIS, with the time-switching(TS)-STAR-RIS to enhance both the sensing and communications at the cost of possible target intercepting and propose the simultaneous-transmitting-and-reflecting fully-connected RIS(STAR-FCR) schemes to strike a balance between sensing and communications performance. Thereafter, observing the security-reliability performance tradeoff of the downlink ISAMC, we conduct closed-form analyses to compare COPs of round-robin scheduling(RS) and multiuser scheduling(MS) with the aid of a TS-based STAR-FC-RIS. Furthermore, we derive closed-form expressions of the sensing outage probability, communications outage probability(COP), and communications intercept probability, where an average of the three probabilities is exploited to obtain an optimized time allocation(OTA) of the *** results verify that the STAR-FCR-MS scheme outperforms the STAR-FCR-RS scheme in terms of sensing reliability and communications security. Moreover, an OTA remarkably enhances the overall performance of the STAR-FCR schemes of ISAMC systems.

关键词： simultaneous-transmitting-and-reflecting reconfigurable intelligent surface (RIS) fully-connected beyond-diagonal RIS integrated sensing and communications multiuser scheduling security

来源：评论

学校读者我要写书评

暂无评论

Near-Lossless Compression of Two Independent Binary Sources with One Encoder 16

Near-Lossless Compression of Two Independent Binary Sources ...

引用

16th International Conference on Wireless Communications and Signal Processing, WCSP 2024

作者： Zhu, Tingting Ma, Xiao Sun Yat-sen University School of Computer Science and Engineering MoE Key Laboratory of Information Technology Guangdong Key Laboratory of Information Security Technology Guangzhou China

ISBN: (纸本)9798350390643

In this paper, we consider the near-lossless compression of two distinct but independent binary random sources U and V, both of which are asymmetrical independent and identically distributed (i.i.d.) sources. In particular, V is assumed to be sparser than U. We show that, to efficiently compress U and V, explicit source coding (compression) for V (the sparser one) is not required. The basic idea is to encode U with an error-correction code and then superimpose V on the codeword. Hence, only one encoder-decoder pair (EDP) suffices to compress two sources. Theoretical analysis shows that the proposed coding scheme is entropy-approaching in terms of bit-error rate (BER) of both sources, and numerical results verify our analysis. Furthermore, we analyze the complexity of compression using the block Markov superposition transmission-repetition (BMST-R) codes to discuss the advantage of the proposed scheme. Simulation results demonstrate that the proposed scheme compresses the two sources simultaneously in a more compact way but causes no performance degradation. © 2024 IEEE.

关键词： Convolutional codes

来源：评论

学校读者我要写书评

暂无评论

A Robust key Exchange and Tamper-Resistant Protocol for HAN and NAN networks in Smart Grids

引用

IEEE Internet of Things Journal 2025年第12期12卷 21394-21403页

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart Grids (SG) rely on Home Area networks (HAN) and Neighborhood Area networks (NAN) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the Physical Unclonable Function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol's resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol's effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol's enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding Algorithm in Encrypted Domain Based on Matrix Secret Sharing 5

Reversible Data Hiding Algorithm in Encrypted Domain Based o...

引用

5th International Conference on Electronics and Communication, network and computer Technology, ECNCT 2023

作者： Jiang, Zongbao Zhang, Minqing Ke, Yan Jiang, Chao University of PAP Key Laboratory of Network and Information Security of PAP Engineering Xi'an710086 China

ISBN: (纸本)9798350328660

Focused on the problems of user privacy disclosure and ciphertext data management in cloud service environment, this paper proposes a reversible data hiding algorithm in encrypted domain based on matrix secret sharing. Firstly, the matrix secret sharing of the pixels of the encrypted image was used to obtain n shares, in the process of constructing shared vectors for secret segmentation, the random variables involved in encryption and the location index of ciphertext feedback were used to construct the mapping relationship between them and the secret data to be embedded to generate redundant space for data embedding. Finally, the overflow pixels were processed, and the edge information was embedded by differential extension technology to obtain n marked encrypted images. The experimental results showed that the algorithm has complete reversibility. In contrast to the current algorithms, the embedding rate of the algorithm was greatly improved. The maximized embedding rate of the (3,4)-threshold scheme was 4.00bpp, and the maximized embedding rate of the (5,5)-threshold scheme was 6.40bpp, and the statistical characteristics such as correlation coefficient of the marked encrypted images were consistent with those of random image, and the security was high. The algorithm not only has the functions of privacy data protection and ciphertext authentication management, but also has the disaster recovery feature to realize the multi-party security storage of data. © 2023 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：