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

Remote Attestation for Intelligent Electronic Devices in Smart Grid Based on Trusted Level Measurement

Chinese Journal of Electronics 2020年第3期29卷 437-446页

作者： WANG Yong LI Jun'e CHEN Xiong LIN Hai YU Fajiang LUO Jianbo Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of EducationSchool of Cyber Science and Engineering Wuhan University NARI Group Corporation State Grid Electric Power Research Institute NARI Technology Co.Ltd. State Key Laboratory of Smart Grid Protection and Control

To reduce the implementation complexity and excessive overhead caused by remote attestation,we propose a new remote attestation scheme based on trusted level measurement considering the limited system resources of the Intelligent electronic devices(IEDs) in smart grid. In this scheme, a lightweight trusted level measurement mechanism is designed, and a new dynamic weighted multi-classifier integration method based on Binary tree Support vector machine(BT-SVM) is proposed. The trusted level of configuration information and running state of an IED are measured through trusted third party. The measurement parameters and attestation period are dynamically adjusted according to different trusted levels of an IED, so that reducing computational overhead and communication delays in remote attestation process. Analysis and experiments show that the proposed scheme can enhance the security of IEDs in smart grid by occupying a small amount of computation and communication resources.

关键词： Smart grid Intelligent electronic devices(IEDs) Remote attestation Trusted level measurement

来源：评论

学校读者我要写书评

暂无评论

PosFuzz:augmenting greybox fuzzing with effective position distribution

引用

Cybersecurity 2023年第4期6卷 123-143页

作者： Yanyan Zou Wei Zou JiaCheng Zhao Nanyu Zhong Yu Zhang Ji Shi Wei Huo Institute of Information Engineering Chinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina State Key Lab of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijingChina Key Laboratory of Network Assessment Technology Chinese Academy of SciencesBeijingChina Beijing Key Laboratory of Network Security and Protection Technology BeijingChina Zhongguancun Laboratory BeijingChina

Mutation-based greybox fuzzing has been one of the most prevalent techniques for security vulnerability discovery and a great deal of research work has been proposed to improve both its efficiency and ***-based greybox fuzzing generates input cases by mutating the input seed,i.e.,applying a sequence of mutation operators to randomly selected mutation positions of the ***,existing fruitful research work focuses on scheduling mutation operators,leaving the schedule of mutation positions as an overlooked aspect of fuzzing *** paper proposes a novel greybox fuzzing method,PosFuzz,that statistically schedules mutation positions based on their historical *** makes use of a concept of effective position distribution to represent the semantics of the input and to guide the *** first utilizes Good-Turing frequency estimation to calculate an effective position distribution for each mutation *** then leverages two sampling methods in different mutating stages to select the positions from the *** have implemented PosFuzz on top of AFL,AFLFast and MOPT,called Pos-AFL,-AFLFast and-MOPT respectively,and evaluated them on the UNIFUZZ benchmark(20 widely used open source programs)and LAVA-M *** result shows that,under the same testing time budget,the Pos-AFL,-AFLFast and-MOPT outperform their counterparts in code coverage and vulnerability discovery *** with AFL,AFLFast,and MOPT,PosFuzz gets 21%more edge coverage and finds 133%more paths on *** also triggers 275%more unique bugs on average.

关键词： Greybox fuzzing Mutation position Mutation operator Code coverage Vulnerability discovery

来源：评论

学校读者我要写书评

暂无评论

BTP-CAResNet: An Encrypted Traffic Classification Method Based on Byte Transfer Probability and Coordinate Attention Mechanism

BTP-CAResNet: An Encrypted Traffic Classification Method Bas...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Li, Junhao Shi, Huiling Zhang, Wei Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

With the extensive application of network traffic encryption technology, the accurate and efficient classification of encrypted traffic has become a critical need for network management. Deep learning has become the predominant method for traffic classification, primarily involving the transformation of network traffic into grayscale images and their subsequent classification using Convolutional Neural networks (CNNs). However, traditional grayscale image generation methods are plagued with issues of redundant and lost information, and conventional channel attention mechanisms are still insufficient in capturing key traffic features, collectively hindering the enhancement of classification performance. To tackle these issues, this paper introduces a classification method based on Byte Transfer Probability and Coordinate Attention Mechanism in Residual network (BTP-CAResNet). This method, on the foundation of the classic ResNet architecture, incorporates a new grayscale image generation method that utilizes Byte Transfer Probability, effectively overcoming the deficiencies of traditional approaches. Additionally, this paper integrates a Coordinate Attention Mechanism into the ResNet model, which effectively overcomes the limitations of traditional channel attention mechanisms and further improves the performance of traffic classification. Experimental validation on the ISCX VPN-nonVPN dataset demonstrates that, compared to previous CNN-based methods, the method proposed in this paper exhibits superior performance in key metrics such as accuracy, precision, recall, and F1 score. It provides a new perspective for traffic classification based on convolutional neural networks. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

CB-YOLO: A Small Object Detection Algorithm for Industrial Scenarios

CB-YOLO: A Small Object Detection Algorithm for Industrial S...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Chen, Hao Wu, Xiaoming Su, Zhanzhi Zhao, Ying Dong, Yunfeng Liu, Xiangzhi Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

In certain specific industrial scenarios, smoking and cellphone usage are strictly prohibited behaviors. In these scenarios, it is crucial to rapidly and accurately detect smoking and cell phone usage, and promptly issue warnings, to ensure industrial safety. The detection of prohibited behaviors using computer vision has gained attention from researchers with the development of artificial intelligence. However, detecting small objects like cigarettes and cell phones in complex backgrounds and varying angles poses a challenge due to their changing shapes. In this paper, we propose a detection model called CB-YOLO, which utilizes YOLOv7 as the baseline model, for detecting smoking and mobile phone usage behavior. Firstly, we propose a new channel space pyramid network called CSPPF that pools features at different scales and introduces scale focusing on improving the perceptual ability of the network to better handle targets at various scales and locations. Secondly, we propose an enhanced feature pyramid called AWBFPN. This introduces additional learnable weight parameters to improve the model's ability to fuse multi-scale features effectively. Finally, we have also proposed a new loss function called Size-IoU. The experimental results demonstrate that our algorithm outperforms the baseline model. Specifically, it achieves a 3.9% improvement in Precision, a 2.1% improvement in Recall, a 6.4% improvement in mAP@0.5, and a 2% improvement in mAP@0.5:0.95 on the Phone_check dataset. Similarly, on the Smoking dataset, our algorithm achieves a 3.3% improvement in Precision, a 1.9% improvement in Recall, a 1.7% improvement in mAP@0.5, and a 0.3% improvement in mAP@0.5:0.95. © 2024 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

RFSD-YOLO: An Enhanced X-Ray Object Detection Model for Prohibited Items

RFSD-YOLO: An Enhanced X-Ray Object Detection Model for Proh...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Kong, Xiaotong Li, Aimin Li, Wenqiang Li, Zhiyao Zhang, Yuechen Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

X-ray image detection is essential for ensuring public safety, but traditional methods rely heavily on human analysis and are relatively inefficient. To address this issue, this paper proposes a new object detection model called RFSD-YOLO, which is based on the YOLOv8 model and is specifically designed for detecting prohibited items in X-ray images. The model adopts the RFCAConv structure instead of the conventional convolutional operation. This allows for independent parameterisation among the convolutional kernels, enhancing the model's ability to capture and express potential prohibited item features. The neck section of the model includes the GSConv and VoVgscspdesigns, which aim to balance complexity and parameter size while maintaining detection performance and reducing computational burden. Additionally, we have introduced a dynamic head structure, DyHead, which replaces the traditional detection head design and improves detection accuracy without adding computational cost. The experimental results demonstrate that our enhanced model surpasses the current state-of-the-art object detection models in detecting prohibited items. Additionally, we introduce a simplified version of the RFSD-YOLOnano model to cater to resource-constrained environments. This streamlined model improves AP, AR, and mAP by 4.4%, 14.6%, and 3.4%, respectively, compared to YOLOv8n. This series of innovations not only validates the superiority of our model, but also provides new solutions in the field of automated detection of prohibited items for X-ray security screening. © 2024 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Some classes of complete permutation polynomials over Fq

引用

Science China Mathematics 2015年第10期58卷 2081-2094页

作者： WU GaoFei LI Nian HELLESETH Tor ZHANG YuQing State Key Laboratory of Integrated Service Networks Xidian University Information Security and National Computing Grid Laboratory Southwest Jiaotong University Department of Informatics University of Bergen National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences

By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.

关键词： finite field complete permutation polynomials Walsh transform Niho exponents Dickson polynomials

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection of user behavior based on DTMC with states of variable-length sequences

引用

The Journal of China Universities of Posts and Telecommunications 2011年第6期18卷 106-115页

作者： XIAO Xi XIA Shu-tao TIAN Xin-guang ZHAI Qi-bin Graduate School at Shenzhen Tsinghua University Shenzhen 518055 China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China Key Laboratory of Network Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

In anomaly detection, a challenge is how to model a user＇s dynamic behavior. Many previous works represent the user behavior based on fixed-length models. To overcome their shortcoming, we propose a novel method based on discrete-time Markov chains （DTMC） with states of variable-length sequences. The method firstly generates multiple shell command streams of different lengths and combines them into the library of general sequences. Then the states are defined according to variable-length behavioral patterns of a valid user, which improves the precision and adaptability of user profiling. Subsequently the transition probability matrix is created. In order to reduce computational complexity, the classification values are determined only by the transition probabilities, then smoothed with sliding windows, and finally used to discriminate between normal and abnormal behavior. Two empirical evaluations on datasets from Purdue University and AT＆T Shannon Lab show that the proposed method can achieve higher detection accuracy and require less memory than the other traditional methods.

关键词： intrusion detection anomaly detection shell command discrete-time Markov chain (DTMC)

来源：评论

学校读者我要写书评

暂无评论

SSEM： Secure, Scalable and Efficient Multi-Owner Data Sharing in Clouds

引用

China Communications 2016年第8期13卷 231-243页

作者： Shungan Zhou Ruiying Du Jing Chen Hua Deng Jian Shen Huanguo Zhang The Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Computer School of Wuhan University Wuhan 430072 Hubei Province China State Grid Information and Communication Company of Hunan Electric Power Corp Changsha 410000 Hunan Province China

Data sharing is a main application of cloud computing. Some existing solutions are proposed to provide flexible access control for outsourced data in the cloud. However, few attentions have been paid to group-oriented data sharing when multiple data owners want to share their private data for cooperative purposes. In this paper, we put forward a new paradigm, referred to as secure, scalable and efficient multi-owner(SSEM) data sharing in clouds. The SSEM integrates identity-based encryption and asymmetric group key agreement to enable group-oriented access control for data owners in a many-to-many sharing pattern. Moreover, with SSEM, users can join in or leave from the group conveniently with the privacy of both group data and user *** proposed the key-ciphertext homomorphism technique to construct an SSEM scheme with short ciphertexts. The security analysis shows that our SSEM scheme achieves data security against unauthorized accesses and collusion attacks. Both theoretical and experimental results confirm that our proposed scheme takes users little costs to share and access outsourced data in a group manner.

关键词： data sharing cloud computing asymmetric key agreement access control

来源：评论

学校读者我要写书评

暂无评论

A generalized reliability analysis of 3-ary n-cubes 16

A generalized reliability analysis of 3-ary n-cubes

引用

16th International Conference on Communication Software and networks, ICCSN 2024

作者： Bai, Zefang Wang, Guijuan Ma, Meijie School of Mathematics and Statistics Jinan250353 China 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

ISBN: (纸本)9798331506322

Evaluating the reliability of interconnection networks is crucial. The edge-connectivity is a parameter used to assess reliability. In this paper, we discuss a conditional edge-connectivity called the h-extra g-component edge-connectivity. It combines the extra edge-connectivity and the component edge-connectivity. First, this paper proved that c λ3h(Qn3)=4nh-4eh(Qn3)-h for 1 ≤ h ≤ 3(1/2), n ≥ 3. Then, the paper given the upper bound of h-extra g-component edge-connectivity of the 3-ary n-cubes for g ∞ {4,3c3+1}, 1 ≤ c≤ [n/2] -1, n ≥ 3. © 2024 IEEE.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain

引用

Computer Modeling in Engineering & Sciences 2024年第6期139卷 3311-3327页

作者： Shujiang Xu Ziye Wang Lianhai Wang Miodrag J.Mihaljevi′c Shuhui Zhang Wei Shao Qizheng Wang Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan250014China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan250014China Mathematical Institute The Serbian Academy of Sciences and ArtsBelgrade11000Serbia

Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business ***,transaction performance and scalability has become the main challenges hindering the widespread adoption of *** to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many *** improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling ***,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected *** paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction *** crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the ***,the scheme can achieve a high-frequency transaction as well as a better blockchain *** results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.

关键词： Blockchain sharding graph partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：