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

TMC-GCN: Encrypted Traffic Mapping Classification Method Based on Graph Convolutional networks

computers, Materials & Continua 2025年第2期82卷 3179-3201页

作者： Baoquan Liu Xi Chen Qingjun Yuan Degang Li Chunxiang Gu School of Cyberspace Security Zhengzhou UniversityZhengzhou450002China School of Cyberspace Security Information Engineering UniversityZhengzhou450001China Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001China

With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.

关键词： Encrypted traffic classification deep learning graph neural networks multi-layer perceptron graph convolutional networks

来源：评论

学校读者我要写书评

暂无评论

High-Capacity Image Hiding via Compressible Invertible Neural network 24th

High-Capacity Image Hiding via Compressible Invertible Neur...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wang, Changguang Shi, Haoyi Li, Qingru Zhao, Dongmei Wang, Fangwei College of Computer and Cyber Security Hebei Normal University Shijiazhuang050024 China Hebei Key Laboratory of Network and Information Security Shijiazhuang050024 China

ISBN: (纸本)9789819615278

Image steganography involves the concealment of confidential information within images, rendering it undetectable to unauthorized observers, and subsequently retrieving the hidden information following secure transmission. Numerous investigations into image steganography employ invertible neural networks. Nevertheless, the intricate architecture of these models poses significant challenges to both their training and inference processes. Consequently, this paper proposes a high-capacity image steganography scheme utilizing compressible modules. We propose a multi-scale attention module that compresses the model structure through structural reparameterization post-training, thereby enhancing inference speed. Additionally, we employ a pre-trained image autoencoder to extract deep features from large-scale images, facilitating high-capacity steganography within invertible neural networks by concealing key features. Experimental results indicate that our approach offers superior image quality and model inference speed, while significantly enhancing security relative to existing methodologies. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP

引用

Cybersecurity 2025年第1期8卷 153-179页

作者： Xia Liu Huan Yang Li Yang State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina Beijing Youzhuju Network Technology Co. Ltd.BeijingChina

The elliptic curve discrete logarithm problem(ECDLP)is a popular choice for cryptosystems due to its high level of ***,with the advent of the extended Shor’s algorithm,there is concern that ECDLP may soon be *** the algorithm does ofer hope in solving ECDLP,it is still uncertain whether it can pose a real threat in *** the perspective of the quantum circuits of the algorithm,this paper analyzes the feasibility of cracking ECDLP using an ion trap quantum computer with improved quantum circuits for the extended Shor’s *** give precise quantum circuits for extended Shor’s algorithm to calculate discrete logarithms on elliptic curves over prime felds,including modular subtraction,three diferent modular multiplication,and modular ***,we incorporate and improve upon windowed arithmetic in the circuits to reduce the *** previous studies mostly focused on minimizing the number of qubits or the depth of the circuit,we focus on minimizing the number of CNOT gates in the circuit,which greatly afects the running time of the algorithm on an ion trap quantum ***,we begin by presenting implementations of basic arithmetic operations with the lowest known CNOT-counts,along with improved constructions for modular inverse,point addition,and windowed ***,we precisely estimate that,to execute the extended Shor’s algorithm with the improved circuits to factor an n-bit integer,the CNOT-count required is1237n^(3)/log n+2n^(2)+***,we analyze the running time and feasibility of the extended Shor’s algorithm on an ion trap quantum computer.

关键词： Elliptic curve discrete logarithm problem Extended Shor’s algorithm Quantum circuits Ion trap quantum computer

来源：评论

学校读者我要写书评

暂无评论

Foundation models for topic modeling: a case study

引用

Frontiers of computer Science 2025年第2期19卷 129-131页

作者： Han ZENG Jia-Ming SUN Chun-Shu LI Zhuying LI Tong WEI School of Computer Science and Engineering Southeast UniversityNanjing 210096China Key Laboratory of Computer Network and Information Integration Southeast UniversityNanjing 210096China

1 Introduction In Natural Language Processing(NLP),topic modeling is a class of methods used to analyze and explore textual corpora,i.e.,to discover the underlying topic structures from text and assign text pieces to different *** NLP,a topic means a set of relevant words appearing together in a particular pattern,representing some specific *** is beneficial for tracking social media trends,constructing knowledge graphs,and analyzing writing *** modeling has always been an area of extensive research in *** methods like Latent Semantic Analysis(LSA)and Latent Dirichlet Allocation(LDA),based on the“bag of words”(BoW)model,often fail to grasp the semantic nuances of the text,making them less effective in contexts involving polysemy or data noise,especially when the amount of data is small.

关键词： words semantic textual

来源：评论

学校读者我要写书评

暂无评论

Multiple Edge Data Integrity Verification With Multi-Vendors and Multi-Servers in Mobile Edge Computing

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4668-4683页

作者： Islam, Md Rashedul Xiang, Yong Uddin, Md Palash Zhao, Yao Kua, Jonathan Gao, Longxiang Deakin University School of Information Technology GeelongVIC3220 Australia Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250316 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China

Ensuring Edge Data Integrity (EDI) is imperative in providing reliable and low-latency services in mobile edge computing. Existing EDI schemes typically address single-vendor (App Vendor, AV) single-server (Edge Server, ES), single-vendor multi-server, and multi-vendor multi-server scenarios, which consider a single data replica cached by an ES from the AVs. However, the most practical scenario of Multi-Vendors and Multi-Servers with Multiple Data (MVMS-MD) cached by an ES from different AVs remains unexplored. Current solutions struggle when applied to this scenario due to increased computation and communication costs in the verification process across all ESs using the classical challenge-response per-data multi-round strategy. To tackle this issue, we propose a Multiple EDI-Verification (MEDI-V) approach in this paper. In particular, our MEDI-V utilizes an adaptive Merkle Hash Tree (ad-MHT) to efficiently generate a tree of multiple data replicas within each AV. Next, the dynamic mechanism computes minimal verification information using ad-MHT to create a challenge for individual ESs to produce EDI proofs. The ES then leverages its ad-MHT and the ES’s proof to send the reconstructed ad-MHT root to the AV for verification. Theoretical insights into MEDI-V’s correctness, efficiency, security, and comprehensive evaluations demonstrate its superiority in addressing MEDI issues in the MVMS-MD scenario. © 2002-2012 IEEE.

关键词： Data integrity

来源：评论

学校读者我要写书评

暂无评论

Iterative Bounded Distance Decoding With Random Flipping for Product-Like Codes

引用

IEEE Transactions on Communications 2025年第5期73卷 2864-2875页

作者： Li, Guorong Wang, Shiguo Zhao, Shancheng Jinan University National and Local Joint Research Center of Network Security Detection and Protection Technology College of Information Science and Technology Guangzhou510632 China Guangdong Key Laboratory of Data Security and Privacy Preserving Guangzhou Key Laboratory of Data Security and Privacy Preserving Guangzhou510632 China Changsha University of Science and Technology Computer and Communication Engineering Institute Changsha410114 China

Product-like codes are widely used in high-speed communication systems since they can be decoded with low-complexity hard decision decoders (HDDs). To meet the growing demand of data rates, enhanced HDDs are required. In this paper, we propose a novel soft-aided HDD (SA-HDD), termed iterative bounded distance decoding with random flipping (iBDD-RF), for product-like codes. In iBDD-RF, the soft reliability of a bit is a weighted sum of the output of bounded distance decoder (BDD) and the channel log-likelihood ratio (LLR). When the amplitude of the soft reliability of a bit is less than a given threshold, it is flipped with a given probability. This random flipping may make the decoder escape from the local optimum. To optimize the threshold and the flipping probability, we derive the density evolution (DE) equations of iBDD-RF for product codes (PCs) and staircase codes (SCs). Our extensive numerical results show that iBDD-RF outperforms iBDD with scaled reliability (iBDD-SR) over the binary-input additive white Gaussian noise (Bi-AWGN) channel. Particularly, for a PC with (255,239,2) Bose-Chaudhuri-Hocquenghem (BCH) code and an SC with (254,230,3) BCH code, iBDD-RF performs about 0.25 dB and 0.28 dB better than iBDD-SR, respectively. © 1972-2012 IEEE.

关键词： Optical fiber communication

来源：评论

学校读者我要写书评

暂无评论

TRBFT: An Efficient Blockchain Consensus for Edge Computing-Enabled IoT Systems

引用

IEEE Internet of Things Journal 2025年第11期12卷 15853-15868页

作者： Zheng, Jiali Zhang, Yuxi Guangxi University Guangxi Key Laboratory of Multimedia Communications and Network Technology School of Computer Electronics and Information Guangxi Nanning530004 China

With the continuous expansion of the Internet of Things (IoT), and despite reductions in communication latency enabled by edge computing, the decentralized nature of node structures poses significant security challenges. Blockchain is considered a critical technology for enhancing IoT security. However, traditional consensus exhibits limitations in efficiency and security when facing the exponential growth of IoT nodes necessitating further optimization and innovation. This paper proposes the threshold signature and reputation-enhanced Byzantine fault tolerance (TRBFT) algorithm. First, we integrate IoT with edge computing architectures, conduct a comprehensive evaluation of node reputation based on behavioral quality and contribution to consensus, and periodically update and categorize nodes into different sets with varying permissions. Secondly, the algorithm ensures that the selection of primary nodes strikes a balance between reliability and randomness, while employing a segmented screening scheme that progressively restricts the participating nodes in consensus, aiming to enhance accuracy. Subsequently, the communication structure is improved by incorporating threshold signature with reputation weight, which reduces communication complexity. Ultimately, simulation results demonstrate that TRBFT reduces the average consensus delay by 71.1% and increases the average throughput by 3.95 times compared to the advanced consensus HotStuff. In scenarios with faulty nodes, TRBFT increases the chain growth rate by 65.12% and decreases the block interval by 54.26% relative to HotStuff. The findings show the superior scalability and fault tolerance of TRBFT, making it better suited for large-scale IoT scenarios integrated with edge computing. © 2025 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

k-TEVS: A k-Times E-Voting Scheme on Blockchain With Supervision

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2326-2337页

作者： Liu, Yang He, Debiao Luo, Min Wang, Lianhai Peng, Cong Wuhan University School of Cyber Science and Engineering Wuhan430072 China Shenzhen Institute of Information Technology Institute of Information Technology Shenzhen518172 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Matrix Elements Technologies Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Shanghai200232 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

Thee-vote is regarded as a waytoexpress the opinion that the voters ask for. Actually, the e-vote could be applied wildly likequestionnaire,***,thecoexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storagecostsforthefieldconsistedofthevotegroupmanager(GM) with its vote assistants (VA). Particularly the k-times anonymous authentication (k-TAA) could also be a practical approach to pre serve voters’ privacy and reduce the computation costs during the ***,thee-voteschemewithpurek-TAAstrategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of k-TAA with the update process for the e-vote on blockchain for supervision (k-TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the k-TEVS framework. Finally, We implement k TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme. © 2004-2012 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Modular Sharing Scheme for EMRs Using Consortium Blockchain and Proxy Re-encryption 24th

A Modular Sharing Scheme for EMRs Using Consortium Blockcha...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Quan, Jiazheng Wu, Niefeng Chen, Hu Wang, Yamei Zhang, Yuexin Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou China

ISBN: (纸本)9789819615247

In medical referrals, it is critical to securely and efficiently share Electronic Medical Records (EMRs) for timely and accurate treatments. The decentralization and tamper-proof of blockchain provides new options for secure sharing of diagnosis and treatment data. In this paper, we propose a modular sharing scheme for EMRs using consortium blockchain and proxy re-encryption. Specifically, to meet security and privacy requirements of medical referrals under the healthcare consortium model, cloud servers are employed to store the encrypted EMRs. Additionally, modular encryption is designed to realize fine-grained access control. In our scheme, consortium blockchain is employed to store patients’ index key group, and it is responsible for performing proxy re-encryption operations. Such design ensures secure access control of patients’ EMRs, and doctors within the medical consortium model can access and/or update EMRs after obtaining authorization from patients. We analyse the security and performance of our scheme, and compare it with a few relevant schemes. According to the comparisons, our scheme has more functionalities, and it achieves fine-grained access control of patients’ EMRs. Moreover, resource consumptions of patients and doctors are light. Specifically, time cost of our scheme is reduced at least 25%. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：