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

作者： Xin-Hui, Zhao Ze-Hui, Wu Xiao-Bin, Song Qing-Xian, Wang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Physical Education College of Zhengzhou University Zhengzhou China

Software Definition Network (SDN) has three features as separation of control and forwarding, unified management of configuration, and dynamic programming, which have greatly improved flexibility of network deployment and dynamics of network management, as well as efficiency of network transmission. However, its security problem is quite outstanding. This paper proposes a new security defense method based on coloring distribution model, which aims at the shortcomings of the current research that does not change the weak security, certainty, statics, and isomorphism of SDN. Motivated by the idea of moving target defense, our method abstracts network topology of SDN using coloring theory and realizes diversified deployment of controllers and switches, thus improving the security of network itself without changing the structure of SDN. Simulation results show that our method can prevent denial of service (DOS) attacks against controllers and switches and at the same time effectively block the worm, which is one of the most threat of smart city, propagation via switches. © 2019 John Wiley & Sons, Ltd.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Triangle Matters! TopDyG: Topology-aware Transformer for Link Prediction on Dynamic Graphs 25

Triangle Matters! TopDyG: Topology-aware Transformer for Lin...

引用

34th ACM Web Conference, WWW 2025

作者： Zhang, Xin Cai, Fei Zheng, Jianming Pan, Zhiqiang Chen, Wanyu Chen, Honghui Chen, Chonghao National Key Laboratory of Information Systems Engineering National University of Defense Technology Changsha China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China College of Electronic Countermeasures National University of Defense Technology Hefei China

ISBN: (纸本)9798400712746

Dynamic graph link prediction is widely utilized in the complex web of the real world, such as social networks, citation networks, recommendation systems, etc. Recent Transformer-based link prediction methods on dynamic graphs not only fail to model the fine-grained structures such as triangles with the vanilla Transformers in the graph serialization process, but also amplify the imbalanced distribution of graphs because of their over-estimation of high-degree nodes. To tackle these issues, we propose a Topology-aware Transformer on Dynamic Graph (TopDyG) for link prediction, consisting of a topology injected Transformer (Ti-Transformer) and a mutual information learning (Mi-Learning). The Ti-Transformer explores the explicit structure of serialized graphs, capturing the topological features. The Mi-Learning mines the relationship between nodes by modeling the mutual information with a prior knowledge, alleviating the over-estimation of high-degree nodes when applying the Transformer-based models for the dynamic graph link prediction task. Extensive experiments on four public datasets containing both transductive and inductive settings present the superiority of our proposal. In particular, TopDyG presents an improvement of 43.27% and 28.75% against the state-of-the-art baselines in terms of NDCG and Jaccard, respectively. The advantages are especially obvious on the high-density graphs. © 2025 Copyright held by the owner/author(s).

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Byzantine-robust distributed support vector machine

引用

Science China Mathematics 2025年第3期68卷 707-728页

作者： Xiaozhou Wang Weidong Liu Xiaojun Mao School of Statistics East China Normal UniversityShanghai 200062China Key Laboratory of Advanced Theory and Application in Statistics and Data Science(Ministry of Education) East China Normal UniversityShanghai 200062China School of Mathematical Sciences Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Artificial Intelligence(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Scientific and Engineering Computing(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China

The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines may behave abnormally and send arbitrary information to the central machine(known as Byzantine failures), which can invalidate the distributed algorithms based on the assumption of faultless systems. This paper studies Byzantine-robust distributed algorithms for support vector machines(SVMs) in the context of binary classification. Despite a vast literature on Byzantine problems, much less is known about the theoretical properties of Byzantine-robust SVMs due to their unique challenges. In this paper, we propose two distributed gradient descent algorithms for SVMs. The median and trimmed mean operations in aggregation can effectively defend against Byzantine failures. Theoretically, we show the convergence of the proposed estimators and provide the statistical error rates. After a certain number of iterations, our estimators achieve near-optimal rates. Simulation studies and real data analysis are conducted to demonstrate the performance of the proposed Byzantine-robust distributed algorithms.

关键词： Byzantine robustness convergence distributed learning support vector machine

来源：评论

学校读者我要写书评

暂无评论

The Research and Application of Zero Trust:A Review

SSRN

引用

SSRN 2024年

作者： Meng, Qi Fei, Jinlong Lu, Bin Wang, Xuemeng Wu, Wei Zhang, Zihao Huang, Jing State Key Laboratory of Mathematical Engineering And Advanced Computing PLA Information Engineering University Zhengzhou450000 China

With the emergence of new technologies such as cloud computing, mobile internet, the Internet of Things, and 5G, the internet ecosystem has undergone significant changes. The connections between people and devices have become closer, but they also face more complex and advanced threats. Traditional security concepts and technologies gradually cannot meet the security requirements of the current environment. Zero Trust provides a new paradigm that can effectively solve the current security dilemma in the internet ecosystem. This article starts with the research background of Zero Trust, introduces the emergence and development of Zero Trust, its basic definition, and studies the abstract architecture and deployment models of Zero Trust. It focuses on three key technologies of Zero Trust: identity and access management, micro-segmentation, and software-defined perimeters. The article also summarizes the implementation and practical solutions of Zero Trust by current enterprises, with a detailed explanation of the Google BeyondCorp Zero Trust implementation solution. The latter part of the article emphasizes the research and application of Zero Trust in different academic and application fields, reviewing and summarizing the literature on Zero Trust in academia and applications. Finally, the article summarizes the research and application of Zero Trust and provides an outlook on the future development of Zero Trust. © 2024, The Authors. All rights reserved.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Circuit Simulation and Optimization of Quantum Search Algorithm 6

Circuit Simulation and Optimization of Quantum Search Algori...

引用

6th International Conference on Electronic Information Technology and Computer engineering, EITCE 2022

作者： Liu, Xiaonan Zhao, Chenyan Xie, Haoshan Liu, Zhengyu State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University China School of Computer and Artificial Intelligence ZhengZhou University China

ISBN: (纸本)9781450397148

At present, the scale of quantum computers in the real sense is still small, and quantum simulation has become one of the important ways of quantum theory research, grover quantum search algorithm is suitable for the search problem of disordered database. Firstly, according to the implementation principle of Grover algorithm and Boolean logic relationship, the design idea of multi-objective Oracle is analyzed, based on IBMQ quantum cloud platform, the quantum circuit of Grover algorithm with multi-objective items is simulated. Based on the characteristics of Grover algorithm and the simulation process of quantum gate, the action of multiple identical quantum gates is combined to reduce the update times of probability amplitude and improve the simulation efficiency. The libquantum quantum simulator is used for experiments and the target item is successfully searched, which proves the feasibility of the optimization method and provides reference for the simulation and optimization of other quantum algorithms. © 2022 Association for computing Machinery.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

A Highly Secure C2C-PAKE Cross-domain Protocol

A Highly Secure C2C-PAKE Cross-domain Protocol

引用

2021 International Conference on Network Communication and Information Security, ICNCIS 2021

作者： Wang, Xiangyang Gu, Chunxiang Lu, Siqi Chen, Xi Henan Key Laboratory of Network Cryptography Technology Henan Zhengzhou450001 China State Key Laboratory of Mathematical Engineering and Advanced Computing Henan Zhengzhou450001 China

ISBN: (数字)9781510653283

ISBN: (纸本)9781510653276

This paper studies the password-based strong authentication key exchange protocol in the cross-domain scenario, and gives an end-to-end highly secure C2C-PAKE protocol, in which the server shares a password with the client and also has a pair of private/public keys. In contrast, the client has the shared password and the server's public-key. Specifically, we combine the ECQV implicit certificate scheme with the ECDH key exchange protocol to give a highly secure cross-domain protocol. Considering the application of the ECQV implicit certificate scheme in the Internet of Things (IoT), we give an analysis the possibility of the proposed protocol applied in the cross-domain scenario of the IoT. Finally, based on some common attacks, we show a security analysis of our protocol, which achieves perfect forward security and resists dictionary attacks, KCI attacks, replay attacks, Insider-Assisted attacks, and so on. © 2022 SPIE

关键词： Computer security Network security Cryptography

来源：评论

学校读者我要写书评

暂无评论

A malware detection method using satisfiability modulo theory model checking for the programmable logic controller system

A malware detection method using satisfiability modulo theor...

引用

作者： Xie, Yaobin Chang, Rui Jiang, Liehui State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China College of Computer Science and Technology Zhejiang University Hangzhou China

Nowadays programmable logic controllers (PLCs) are suffering increasing cyberattacks. Attackers could reprogram PLCs to inject malware that would cause physical damages and economic losses. These PLC malwares are highly customized for the target which makes it difficult to extract a general pattern to detect them. In this article, we propose a PLC malware detection method based on model checking. Firstly, we improve the existing modeling method for PLC system by using the Satisfiability Modulo Theory (SMT) constraints to model the PLC system. We also present an algorithm that can transform the PLC program to the model. Our SMT-based model can deal with the features of the PLC system such as undetermined input signals, edge detection and so on. Secondly, we focus on malware detection and propose two methods, invariant extraction and rule design pattern, to generate detection rules. The former can extract the invariants from an original program, and the latter can lower the bar for user to design detection rules. Finally, we implement a prototype and evaluate it on three representative ICS scenarios. The evaluation result shows that our proposed method can successfully detect the malwares using four attack patterns. © 2020 John Wiley & Sons, Ltd.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Improvement and optimization of consensus algorithm based on PBFT 4

Improvement and optimization of consensus algorithm based on...

引用

4th International Conference on Communications, Information System and Computer engineering, CISCE 2022

作者： Zhao, Liang Li, Bin Zhou, Qinglei Chen, Xiaojie Zhengzhou University School of Computer and Artificial Intelligence Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (数字)9781665498487

ISBN: (纸本)9781665498487

This paper proposes an improved consensus algorithm based on PBFT(EBCR-PBFT). Firstly, The Modified Random Select(MRS) function is used to perform preliminary screening of network nodes, so as to solve the problem of multiple and redundant network nodes. Secondly, based on the idea of clustering, logical stratification of blockchain network nodes can reduce communication times and improve network efficiency. Thirdly, the core module of MRS is optimized by FPGA to further improve the efficiency of the algorithm. At the same time, the improved dynamic reputation evaluation model is introduced to evaluate and feedback the node behavior in time to ensure the smooth operation of the system. Experiments show that the proposed and optimized consensus algorithm can effectively improve the consensus efficiency, timely punish malicious nodes, increase the reliability of nodes, communication overhead, throughput, delay and other high performance, has a certain application value. © 2022 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Binary Network Protocol Segmentation Based on Probabilistic Inference

SSRN

引用

SSRN 2023年

作者： Guo, Maohua Fei, Jinlong Zhu, Yuefei State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450000 China

Protocol Reverse engineering (PRE) is of great practical importance in Internet security-related fields such as intrusion detection, vulnerability mining, and protocol fuzzing. For unknown binary protocols having fixed-length fields, and the accurate identification of field boundaries has a great impact on the subsequent analysis and final performance. Hence, this paper proposes a new protocol segmentation method based on Information-theoretic statistical analysis for binary protocols by formulating the field segmentation of unsupervised binary protocols as a probabilistic inference problem and modeling its uncertainty. Specifically, we design four related constructions between entropy changes and protocol field segmentation, introduce random variables, and construct joint probability distributions with traffic sample observations. Probabilistic inference is then performed to identify the possible protocol segmentation points. Extensive trials on nine common public and industrial control protocols show that the proposed method yields higher-quality protocol segmentation results. © 2023, The Authors. All rights reserved.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

SoK: A Survey on Redundant Execution Technology

SoK: A Survey on Redundant Execution Technology

引用

2021 International Conference on advanced computing and Endogenous Security, ICACES 2021

作者： Liu, Zijing Zhang, Zheng Xi, Ruicheng Zhu, Pengzhe Ma, Bolin State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781665424493

Redundant execution technology is one of the effective ways to improve the safety and reliability of computer systems. By rationally configuring redundant resources, adding components with the same function, using the determined redundant execution logic to coordinate and efficiently execute synchronously can effectively ensure high availability of the machine and system. Fault-tolerant is based on redundant execution, which is the primary method of dealing with system hardware failures. Recently, multi-threading redundancy has realized the continuous development of fault-tolerant technology, which makes the processing granularity of the system tolerate random failure factors gradually reduced. At the same time, intrusion tolerant technology has also been continuously developed with the emergence of multi-variant execution technology. It mainly uses the idea of dynamic heterogeneous redundancy to construct a set of variants with equivalent functions and different structures to complete the detection and processing of threats outside the system. We summarize the critical technologies of redundant execution to achieve fault tolerance and intrusion tolerance in recent years, sorts out the role of redundant execution in the development process from fault tolerance technology to intrusion tolerance technology, classify redundant execution technologies at different levels, finally point out the development prospects of redundant execution technology in multiple application fields and future technical research directions. © 2022 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：