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

2023 IEEE International Conference on Dependable, Autonomic and Secure Computing, 2023 International Conference on Pervasive Intelligence and Computing, 2023 International Conference on Cloud and Big Data Computing, 2023 International Conference on Cyber Science and Technology Congress, DASC/PiCom/CBDCom/CyberSciTech 2023

作者： Liu, Qian Chen, Yan Chen, Zhixiong Liu, Ximeng Lin, Hui College of Computer and Data Science Fuzhou University Fuzhou China Putian University Fujian Key Laboratory of Financial Information Processing Putian China College of Computer and Data Science Fuzhou University Key Laboratory of Information Security of Network Systems Fuzhou China College of Computer and Cyber Security Fujian Normal University Fuzhou China

ISBN: (纸本)9798350304602

Cryptographic bent functions are maximally nonlinear Boolean functions with an even number of variables. They are not only closely related to some interesting combinatorial objects, but also have important applications in coding, sequence design, cryptography and cyber security. In this paper, we firstly investigate the Walsh transform of two families of functions via Maiorana-MacFarland's class. Secondly, we present new infinite families of permutations. We show that those families have nice property that one can select three elements among them which can be used to construct bent functions. Finally, by using two linear translators, we construct bent functions from the class of Maiorana-MacFarland. © 2023 IEEE.

关键词： Walsh transforms

来源：评论

学校读者我要写书评

暂无评论

Some Classes of Cryptographic Power Functions and Permutation Polynomials with Low (-1)-Differential Uniformity in Cyber Security

Some Classes of Cryptographic Power Functions and Permutatio...

引用

作者： Liu, Qian Dong, Xiaobei Chen, Zhixiong Liu, Ximeng Xu, Li College of Computer and Data Science Fuzhou University Fuzhou China Putian University Fujian Key Laboratory of Financial Information Processing Putian China College of Computer and Data Science Fuzhou University Key Laboratory of Information Security of Network Systems Fuzhou China College of Computer and Cyber Security Fujian Normal University Fuzhou China

ISBN: (纸本)9798350304602

Cryptographic functions with low differential uniformity have wide applications in cryptography and cyber security. In this paper, we further investigate c-differential uniformity proposed by Ellingsen et al. (IEEE Transactions on information Theory. 2020, 66(9): 5781-5789). Specifically, two classes of power functions with low (1)-differential uniformity over finite fields with odd characteristic are obtained. In addition, a class of permutation polynomials and P1N or AP1N functions over F3n are proposed. These functions with low c-differential uniformity are utilized to resist against c-differential attacks in cyberspace from those with the usual low differential uniformity. © 2023 IEEE.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

A circuit area optimization of MK-3 S-box

引用

Cybersecurity 2025年第1期8卷 61-71页

作者： Yanjun Li Weiguo Zhang Yiping Lin Jian Zou Jian Liu Information Industry Information Security Evaluation Center The 15th Research Institute of China Electronic Technology Group CorporationBeijing 100083China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China Beijing Electronic Science and Technology Institute No.7 Fufeng RoadFengtai DistricBeijing 100083China College of Computer and Data Science Fuzhou UniversityFuzhou 350108China

In MILCOM 2015,Kelly et *** the authentication encryption algorithm MK-3,which applied the 16-bit *** paper aims to implement the 16-bit S-box with less circuit ***,we classifed the irreducible polynomials over F_(2n)into three *** we compared the logic gates required for multiplication over the fnite feld constructed by the three types of irreducible *** to the comparison result,we constructed the composite felds, F_((2^(4))^(2))and F_((2^(8))^(2)).Based on the isomorphism of fnite felds,the operations over F_(2)^(16)can be conducted over F_((2^(8))^(2)).Similarly,elements over F28 can be mapped to the corresponding elements over F_((2^(4)))^(2).Next,the SAT solver was used to optimize the operations over smaller feld F_(2)^(4).At last,the architecture of the optimized MK-3 S-box was worked *** with the implementation proposed by the original designer,the circuit area of the MK-3 S-box in this paper is reduced by at least 55.9%.

关键词： irreducible operations optimization

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Latency and Energy Consumption for Mobile Edge Computing Based Proximity Detection in Road networks

引用

China Communications 2022年第4期19卷 274-290页

作者： Tongyu Zhao Yaqiong Liu Guochu Shou Xinwei Yao School of Information and Communication Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and ConvergenceBeijing 100876China School of Computer Science and Technology Zhejiang University of TechnologyChina

In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.

关键词： proximity detection mobile edge computing road networks constrained multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A Reversible Data Hiding in Encryption Domain for JPEG Image Based on Controllable Ciphertext Range of Paillier Homomorphic Encryption Algorithm 21st

A Reversible Data Hiding in Encryption Domain for JPEG Ima...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Ma, Bin Zhao, Chunxin Ma, Ruihe Xian, Yongjin Wang, Chunpeng Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China School of Economics Jilin University Changchun130015 China

ISBN: (纸本)9789819601219

With the rapid advancement of cloud computing, significant security concerns regarding data storage have been continuously raised. When the encrypted images are stored in the cloud, reversible data hiding in encrypted domain is used to embed additional data to manage the storage resources in the cloud. Most of the current works are applied to uncompressed images rather than JPEG images. Therefore, this paper proposes a reversible data hiding algorithm for JPEG images based on an enhanced Paillier homomorphic encryption algorithm. In the proposed scheme, the AC coefficients are altered by using a ciphertext distribution constrained paillier homomorphic encryption algorithm, so as to reduce the size of the data-embedded encrypted image. Whereas, the DC coefficients are encrypted by using the one-dimensional tangent chaos encryption algorithm, thereby ensuring high security of the encrypted image. Moreover, according to the characteristics of the homomorphic encryption algorithm, the confidential data can be recovered from both the encryption domain and from the plain domain. Experimental results demonstrate that the ciphertext distribution-constrained Paillier homomorphic encryption algorithm obtains higher data embedding capacity and superior security in comparison with other advanced algorithms. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Feature Aggregation network for Memory-Based Industrial Anomaly Detection 9

Feature Aggregation Network for Memory-Based Industrial Anom...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Li, Min Han, Delong Shao, Rui He, Jinghui City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350391367

In the process of large-scale industrial production, complex defects of different shapes and sizes can occur in industrial products and their components, and these defects seriously affect the performance of industrial products and their components, and being able to quickly and accurately identify defective industrial products and their components is an important task. Memory-based methods are usually used for anomaly detection, and these methods often rely on pre-trained models for feature extraction, but have high requirements on feature quality. In addition, patch-based methods mainly focus on local differences in feature embedding when detecting anomalies without explicitly exploiting broader contextual information, thus greatly affecting the robustness and accuracy of anomaly detection. Aiming at the above problems and requirements, this paper proposes a Feature Aggregation network for Memory-Based Industrial Anomaly Detection (FANet), which is based on the pre-extraction of anomalous features, attentional attention to key features, information aggregation of multi-level and multi-scale features, and the FANet provides advanced performance in industrial image anomaly detection and localisation by pre-extraction of anomalous features, attentional attention to key features, information aggregation of multi-layered and multi-scale features, and introduction of environmental information in the anomaly score computation to perform industrial anomaly detection tasks, and using core set subsampling to reduce storage requirements. On the MVTec AD, FANet has an image-level AUROC score of 99.1% and a pixel-level AUROC score of 98.2%. Similarly high detection results were achieved on the ViSA dataset, further demonstrating the robustness of FANet. © 2024 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Generalization Analysis for Label-Specific Representation Learning 38

Generalization Analysis for Label-Specific Representation Le...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Zhang, Yi-Fan Zhang, Min-Ling School of Cyber Science and Engineering Southeast University Nanjing210096 China School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Label-specific representation learning (LSRL), i.e., constructing the representation with specific discriminative properties for each class label, is an effective strategy to improve the performance of multi-label learning. However, the generalization analysis of LSRL is still in its infancy. The existing theory bounds for multilabel learning, which preserve the coupling among different components, are invalid for LSRL. In an attempt to overcome this challenge and make up for the gap in the generalization theory of LSRL, we develop a novel vector-contraction inequality and derive the generalization bound for general function class of LSRL with a weaker dependency on the number of labels than the state of the art. In addition, we derive generalization bounds for typical LSRL methods, and these theoretical results reveal the impact of different label-specific representations on generalization analysis. The mild bounds without strong assumptions explain the good generalization ability of LSRL. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Privacy-friendly sequential progressive framework for segmented decision making

A Privacy-friendly sequential progressive framework for segm...

引用

2023 International Conference on Artificial Intelligence of Things and Systems, AIoTSys 2023

作者： Liu, Peng Yu, Zhiyong Huang, Fangwan Fuzhou University College of Computer and Data Science Fuzhou China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

ISBN: (纸本)9798350312270

To achieve progressive and accurate decision-making for long-term time series data while meeting the needs of privacy-friendly and early, this paper proposes a universal framework for sequential progressive decision-making (SPD). This framework first segments the data and sets up multiple columns of neural networks according to the number of segments. Each column can make segmented decisions based on the inputs for the period. Additionally, without sharing the original data, the framework leverages lateral hidden layer connections between preceding and succeeding columns to obtain useful features for subsequent decision-making, gradually improving accuracy while avoiding the risk of data leakage. SPD has the advantages of privacy friendliness, column model diversification, prior knowledge reuse, and easy scalability, making it an effective framework for continuous decision-making. The effectiveness of that was validated using various network models in handwritten digit recognition and electrocardiogram classification tasks. The obtained experimental results reveal that SPD not only enables early decision-making while ensuring accuracy but also achieves accuracy levels comparable to or even surpassing those obtained using complete data, with the added benefit of privacy protection. © 2023 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Large Model-Based Data Augmentation for Imbalanced Text Classification 5

Large Model-Based Data Augmentation for Imbalanced Text Clas...

引用

5th International Seminar on Artificial Intelligence, networking and information Technology, AINIT 2024

作者： Zhang, Dawei Mi, Rongxin Zhou, Peiyao Jin, Dawei Zhang, Manman Song, Tianhang School of Computer Science Jiangsu University of Science and Technology Jiangsu Zhenjiang China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China Key Laboratory of Intelligent Information Processing Beijing China

ISBN: (纸本)9798350385557

This study focuses on the application of large models to deal with imbalanced data problems in text classification. In view of the central position of text in web data and the negative impact of class imbalance on classifier performance, researchers have explored the method of using large models to generate high-quality minority class samples to enhance model performance. This paper reviews the technical progress of machine learning, deep learning, and large language models and their applications in text classification tasks. Although large models perform well in complex tasks due to their excellent language understanding ability, traditional machine learning and deep learning methods are popular in text classification scenarios that require fast response due to their simple structure and higher computational efficiency. This study proposes a data augmentation technique inspired by SMOTE, which uses a large language model combined with a simple prompt engineering strategy to generate high-quality minority samples. The experimental results show that the proposed method significantly improves the macro average precision, recall and F1 score on multiple text classification models, and effectively alleviates the challenge of class imbalance. © 2024 IEEE.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Minimum Path Cost Multi-path Routing Algorithm with No Intersecting Links in Quantum key Distribution networks 6

Minimum Path Cost Multi-path Routing Algorithm with No Inter...

引用

2023 IEEE 6th International Conference on information Systems and computer Aided Education, ICISCAE 2023

作者： Miao, Minghui Fang, Shuo Wu, Weijie Yuan, Xiaotong Bi, Lin Key Laboratory of Network and Information Security in Jilin Province Changchun China Changchun University of Science and Technology School of Computer Science and Technology Jilin Changchun China

ISBN: (纸本)9798350313444

Quantum key distribution (QKD) provides information-theoretic security based on quantum mechanics, and as quantum key distribution becomes increasingly practical, questions of how to employ it effectively over largescale networks and large distances becomes increasingly important. In this work, we investigate the B92 entanglement based QKD protocol and a five-layer QKD network architecture consisting of trusted relay nodes. Previous research seldom focused on the ground routing mechanism of QKD networks in detail. Since no intersecting links are beneficial to reducing the key consumption rate and improving link security, combined with the core idea of reducing the number of link relay hops, we propose a minimum path cost multi-path routing algorithm for no intersecting links in quantum key distribution networks. By analyzing the security of the link, we effectively reduce the number of relay nodes and the number of relay links that pass through and give priority to the routing scheme with the minimum number of hops in the number of relay hops, which avoids the congestion and waste caused by the existence of interleaved multi-path in traditional multi-path routing. Meanwhile, the scheme effectively improves the quality of service index, avoids the generation and consumption of redundant keys, and reduces the waste of quantum key resources. © 2023 IEEE.

关键词： quality of service quantum key distribution quantum network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：