检索结果-南通市图书馆

DDoS Attack Autonomous Detection Model Based on Multi-Strategy Integrate Zebra Optimization Algorithm

Computers, Materials & Continua 2025年第1期82卷 645-674页

作者： Chunhui Li Xiaoying Wang Qingjie Zhang Jiaye Liang Aijing Zhang School of Information Engineering Institute of Disaster PreventionLangfang065201China Langfang Key Laboratory of network Emergency Protection and network security Langfang065201China

Previous studies have shown that deep learning is very effective in detecting known ***,when facing unknown attacks,models such as Deep Neural networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low ***,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 *** hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 *** evaluation accuracy of the new dataset GINKS2023 created in this paper is *** to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.

关键词： Distributed denial of service attack intrusion detection deep learning zebra optimization algorithm multi-strategy integrated zebra optimization algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Industrial Control Anomaly Detection Based on Distributed Linear Deep Learning

引用

Computers, Materials & Continua 2025年第1期82卷 1129-1150页

作者： Shijie Tang Yong Ding Huiyong Wang School of Computer Science and Information security Guilin University of Electronic TechnologyGuilin541004China School of Electronic Engineering and Automation Guilin University of Electronic TechnologyGuilin541004China Guangxi Engineering Research Center of Industrial Internet security and Blockchain Guilin University of Electronic TechnologyGuilin541004China institute of Cyberspace Technology HKCT Institute for Higher EducationHong Kong999077China School of Mathematics&Computing Science Guilin University of Electronic TechnologyGuilin541004China

As more and more devices in Cyber-Physical Systems(CPS)are connected to the Internet,physical components such as programmable logic controller(PLC),sensors,and actuators are facing greater risks of network attacks,and fast and accurate attack detection techniques are *** key problem in distinguishing between normal and abnormal sequences is to model sequential changes in a large and diverse field of time *** address this issue,we propose an anomaly detection method based on distributed deep *** method uses a bilateral filtering algorithm for sequential sequences to remove noise in the time series,which can maintain the edge of discrete *** use a distributed linear deep learning model to establish a sequential prediction model and adjust the threshold for anomaly detection based on the prediction error of the validation *** method can not only detect abnormal attacks but also locate the sensors that cause *** conducted experiments on the Secure Water Treatment(SWAT)and Water Distribution(WADI)public *** experimental results show that our method is superior to the baseline method in identifying the types of attacks and detecting efficiency.

关键词： Anomaly detection CPS deep learning MLP(multi-layer perceptron)

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Linear complexity of quaternary sequences with odd period and low autocorrelation

引用

The Journal of China Universities of Posts and Telecommunications 2014年第5期21卷 89-93页

作者： KE Pin-hui LIN Chang-lu ZHANG Sheng-yuan Fujian Provincial Key Laboratory of network security and cryptology Fujian Normal University

Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternar... 详细信息

关键词： quaternary sequences linear complexity cyclotomy

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Diagnosability of the Incomplete Star Graphs

引用

Tsinghua Science and Technology 2007年第S1期12卷 105-109页

作者：郑淑霞周书明 Key Laboratory of network security and cryptology Fujian Normal University

The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the fault processors to maintain system’s high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper establishes the diagnosabilities of the incomplete star graph Sn (n≥4) with missing links under the PMC model and its variant, the BGM model, and shows that the diagnosabilities of incomplete star graph Sn under these two diagnostic models can be determined by the minimum degree of its topology structure. This method can also be applied to the other existing multiprocessor systems.

关键词： diagnosability incomplete star graph PMC model BGM model

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An improved Durandal signature scheme

引用

Science China(Information Sciences) 2020年第3期63卷 140-155页

作者： Yongcheng SONG Xinyi HUANG Yi MU Wei WU Fujian Provincial Key Laboratory of network security and cryptology College of Mathematics and InformaticsFujian Normal University

Constructing secure and effective code-based signature schemes has been an open problem. In this paper, we efficiently reduce the key size of the Durandal signature scheme introduced by Aragon et al.(EUROCRYPT 2019). We prove that the improved scheme is EUF-CMA secure by reducing its security to the advanced product spaces subspaces indistinguishability(PSSI+) problem, the decisional rank syndrome decoding(DRSD) problem, and the affine rank syndrome decoding(ARSD) problem under the random oracle model. Furthermore, our signature scheme is more secure than the Durandal scheme because recovering key attacks are equivalent to solving the rank syndrome decoding(RSD) problem, instead of the rank support learning(RSL) problem in the original Durandal scheme. Our signature scheme takes less time to generate a signature owing to the fact that our signature scheme enjoys smaller security parameters in comparison to the Duradual scheme. We compare the new scheme with existing code-based signature schemes and find that our signature scheme has advantages in terms of the public key size.

关键词： post-quantum cryptography code-based cryptography rank metric digital signatures provable security

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frequency hopping sequences based on d-form functions

引用

The Journal of China Universities of Posts and Telecommunications 2010年第4期17卷 58-62页

作者： KE Pin-hui,ZHANG Sheng-yuan Key Laboratory of network security and cryptology,Fujian Normal University,Fuzhou 350007,China [a] Key Laboratory of network security cryptology Fujian Normal University Fuzhou 350007 China

By using d-form function, a new construction of frequency hopping sequence with optimal Hamming correlation is presented in this article, which generalizes the results presented by Ding （2007）. Furthermore, a new class of non-power function style d-form function is proposed and an upper bound of the Hamming autocorrelation of the corresponding sequence is also derived.

关键词： frequency hopping sequence hamming correlation d-form function spread spectrum communication

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Constructions of vector output Boolean functions with high generalized nonlinearity

引用

The Journal of China Universities of Posts and Telecommunications 2008年第2期15卷 77-81页

作者： KE Pin-hui ZHANG Sheng-yuan Key Laboratory of network security and cryptology Fujian Normal UniversityFujian 350007 China

Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Boolean fimctions with high generalized nonlinearity using the e-biased sample space. The relation between the resilient order and generalized nonlinearity is also discussed.

关键词： Boolean functions correlation attack generalizednonlinearity almost resilient functions

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

On the Cross-Correlation Distribution of d-Ary Generalized Legendre-Sidelnikov Sequences

引用

Chinese Journal of Electronics 2018年第2期27卷 287-291页

作者： KE Pinhui YE Zhifan ZHANG Shengyuan CHANG Zuling Fujian Provincial Key Laboratory of network security and cryptology Fujian Normal University School of Mathematics and Statistics Zhengzhou University

The cross-correlation distribution of constant multiple sequences of the d-ary generalized LegendreSidelnikov sequences is investigated via character sums. An upper on the cross-correlation values of the sequences is then presented. As a byproduct, the autocorrelation distribution of d-ary Sidelnikov sequence is completely determined, which is only known in a special case.

关键词： Autocorrelation Cross-correlation Legendre-Sidelnikov sequence Multiplicative character Finite field

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Semi-quantum protocol for cardinalities of private set intersection and union based on GHZ states

引用

The Journal of China Universities of Posts and Telecommunications 2022年第4期29卷 69-76,105页

作者： Zhang Long Wang Weijian Zhang Kejia School of Mathematical Science Heilongjiang UniversityHarbin 150080China institute for cryptology and network security Heilongjiang UniversityHarbin 150080China

In modern society,it is necessary to perform some secure computations for private sets between different *** instance,two merchants desire to calculate the number of common customers and the total number of users without disclosing their own *** order to solve the referred problem,a semi-quantum protocol for private computation of cardinalities of set based on Greenberger-Horne-Zeilinger(GHZ)states is proposed for the first time in this paper,where all the parties just perform single-particle measurement if *** the assistance of semi-honest third party(TP),two semi-quantum participants can simultaneously obtain intersection cardinality and union ***,security analysis shows that the presented protocol can stand against some well-known quantum attacks,such as intercept measure resend attack,entangle measure *** with the existing quantum protocols of Private Set Intersection Cardinality(PSI-CA)and Private Set Union Cardinality(PSU-CA),the complicated oracle operations and powerful quantum capacities are not required in the proposed ***,it seems more appropriate to implement this protocol with current technology.

关键词： quantum communication private set intersection cardinality private set union cardinality secure multiparty computation

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

On the Error Linear Complexity Spectrum of Binary Sequences with Period of Power of Two

引用

Chinese Journal of Electronics 2015年第2期24卷 366-372页

作者： CHANG Zuling KE Pinhui School of Mathematics and Statistics Zhengzhou University Fujian Provincial Key Laboratory of network security and cryptology Fujian Normal University

The properties of error linear complexity of binary sequences with period of power of two are studied in this paper. Using the Games-Chan algorithm as main tool, accurate formulas of the minimum value k for which the k-error linear complexity is strictly less than the first and second critical error linear complexity are provided respectively.

关键词： Binary sequences Games-Chan algorithm Error linear complexity Spectrum

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：