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

Blockchain and signcryption enabled asynchronous federated learning framework in fog computing

Digital Communications and networks 2025年第2期11卷 442-454页

作者： Zhou Zhou Youliang Tian Jinbo Xiong Changgen Peng Jing Li Nan Yang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology

Federated learning combines with fog computing to transform data sharing into model sharing, which solves the issues of data isolation and privacy disclosure in fog computing. However, existing studies focus on centralized single-layer aggregation federated learning architecture, which lack the consideration of cross-domain and asynchronous robustness of federated learning, and rarely integrate verification mechanisms from the perspective of incentives. To address the above challenges, we propose a Blockchain and Signcryption enabled Asynchronous Federated Learning(BSAFL) framework based on dual aggregation for cross-domain scenarios. In particular, we first design two types of signcryption schemes to secure the interaction and access control of collaborative learning between domains. Second, we construct a differential privacy approach that adaptively adjusts privacy budgets to ensure data privacy and local models' availability of intra-domain user. Furthermore, we propose an asynchronous aggregation solution that incorporates consensus verification and elastic participation using blockchain. Finally, security analysis demonstrates the security and privacy effectiveness of BSAFL, and the evaluation on real datasets further validates the high model accuracy and performance of BSAFL.

关键词： Blockchain Signcryption Federated learning Asynchronous Fog computing

来源：评论

学校读者我要写书评

暂无评论

Partial multi-label learning via label-specific feature corrections

引用

Science China(information Sciences) 2025年第3期68卷 95-109页

作者： Jun-Yi HANG Min-Ling ZHANG School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education

Partial multi-label learning（PML） allows learning from rich-semantic objects with inaccurate annotations, where a set of candidate labels are assigned to each training example but only some of them are valid. Existing approaches rely on disambiguation to tackle the PML problem, which aims to correct noisy candidate labels by recovering the ground-truth labeling information ahead of prediction model induction. However, this dominant strategy might be suboptimal as it usually needs extra assumptions that cannot be fully satisfied in real-world scenarios. Instead of label correction, we investigate another strategy to tackle the PML problem, where the potential ambiguity in PML data is eliminated by correcting instance features in a label-specific manner. Accordingly, a simple yet effective approach named PASE, i.e., partial multi-label learning via label-specific feature corrections, is proposed. Under a meta-learning framework, PASElearns to exert label-specific feature corrections so that potential ambiguity specific to each class label can be eliminated and the desired prediction model can be induced on these corrected instance features with the provided candidate labels. Comprehensive experiments on a wide range of synthetic and real-world data sets validate the effectiveness of the proposed approach.

关键词： machine learning multi-label learning partial multi-label learning label-specific features feature correction

来源：评论

学校读者我要写书评

暂无评论

High Capacity Reversible Data Hiding Algorithm in Encrypted Images Based on Image Adaptive MSB Prediction and Secret Sharing

引用

清华大学学报自然科学版（英文版） 2025年第3期30卷 1139-1156页

作者： Kaili Qi Minqing Zhang Fuqiang Di Chao Jiang Key Laboratory of Network & Information Security under PAP Engineering University of PAPXi'an 710086China

Until now,some reversible data hiding in encrypted images(RDH-EI)schemes based on secret sharing(SIS-RDHEI)still have the problems of not realizing diffusivity and high embedding ***,this paper innovatively proposes a high capacity RDH-EI scheme that combines adaptive most significant bit(MSB)prediction with secret sharing ***,adaptive MSB prediction is performed on the original image and cryptographic feedback secret sharing strategy encrypts the spliced pixels to spare embedding *** the data hiding phase,each encrypted image is sent to a data hider to embed the secret information *** r copies of the image carrying the secret text are collected,the original image can be recovered lossless and the secret information can be *** evaluation shows that the proposed method in this paper has the diffusivity,reversibility,and *** last but the most important,it has higher embedding *** 512 ×512 grayscale images,the average embedding rate reaches 4.7358 bits per pixel(bpp).Compared to the average embedding rate that can be achieved by the Wang et al.'s SIS-RDHEI scheme,the proposed scheme with(2,2),(2,3),(2,4),(3,4),and(3,5)-threshold can increase by 0.7358 bpp,2.0658 bpp,2.7358 bpp,0.7358 bpp,and 1.5358 bpp,respectively.

关键词： adaptive most significant bit(MSB)prediction password feedback secret sharing high embedding capacity reversible data hiding in encrypted images

来源：评论

学校读者我要写书评

暂无评论

Weighted Attribute Based Conditional Proxy Re-Encryption in the Cloud

引用

computers, Materials & Continua 2025年第4期83卷 1399-1414页

作者： Xixi Yan Jing Zhang Pengyu Cheng Henan Key Laboratory of Network Cryptography Technology Network Information Security and Cryptography LaboratorySchool of SoftwareHenan Polytechnic UniversityJiaozuo454003China School of Computer Science and Technology Henan Polytechnic UniversityJiaozuo454000China

Conditional proxy re-encryption(CPRE)is an effective cryptographic primitive language that enhances the access control mechanism and makes the delegation of decryption permissions more granular,but most of the attribute-based conditional proxy re-encryption(AB-CPRE)schemes proposed so far do not take into account the importance of user attributes.A weighted attribute-based conditional proxy re-encryption(WAB-CPRE)scheme is thus designed to provide more precise decryption rights *** introducing the concept of weight attributes,the quantity of system attributes managed by the server is reduced *** the same time,a weighted tree structure is constructed to simplify the expression of access structure *** conditional proxy re-encryption,large amounts of data and complex computations are outsourced to cloud servers,so the data owner(DO)can revoke the user’s decryption rights directly with minimal *** scheme proposed achieves security against chosen plaintext attacks(CPA).Experimental simulation results demonstrated that the decryption time is within 6–9 ms,and it has a significant reduction in communication and computation cost on the user side with better functionality compared to other related schemes,which enables users to access cloud data on devices with limited resources.

关键词： Cloud service conditional proxy re-encryption user revocation weighted attribute

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Clustering-Based (k, t)-Anonymity Algorithm for Graphs

引用

Chinese Journal of Electronics 2025年第1期34卷 365-372页

作者： Yuanyuan Wang Xing Zhang Zhiguang Chu Wei Shi Xiang Li School of Electronics and Information Engineering Liaoning University of Technology Key Laboratory of Security for Network and Data in Industrial Internet of Liaoning Province Faculty of Information Technology Beijing University of Technology

As people become increasingly reliant on the Internet, securely storing and publishing private data has become an important issue. In real life, the release of graph data can lead to privacy breaches, which is a highly challenging problem. Although current research has addressed the issue of identity disclosure, there are still two challenges: First, the privacy protection for large-scale datasets is not yet comprehensive; Second, it is difficult to simultaneously protect the privacy of nodes, edges, and attributes in social networks. To address these issues, this paper proposes a(k,t)-graph anonymity algorithm based on enhanced clustering. The algorithm uses k-means++ clustering for k-anonymity and t-closeness to improve k-anonymity. We evaluate the privacy and efficiency of this method on two datasets and achieved good results. This research is of great significance for addressing the problem of privacy breaches that may arise from the publication of graph data.

关键词： Data privacy Uncertainty Social networking (online) Publishing Heuristic algorithms Scalability Clustering algorithms Privacy breach Internet Protection

来源：评论

学校读者我要写书评

暂无评论

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

引用

Digital Communications and networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

C-privacy: A social relationship-driven image customization sharing method in cyber-physical networks

引用

Digital Communications and networks 2025年第2期11卷 563-573页

作者： Dapeng Wu Jian Liu Yangliang Wan Zhigang Yang Ruyan Wang Xinqi Lin School of Communications and Information Engineering Chongqing University of Posts and Telecommunications The Advanced Network and Intelligent Connection Technology Key Laboratory Key Laboratory of Ubiquitous Sensing and Networking Aerospace Tianmu Satellite Technology Company Limited School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications College of Computer and Cyber Security Fujian Normal University

Cyber-Physical networks(CPN) are comprehensive systems that integrate information and physical domains, and are widely used in various fields such as online social networking, smart grids, and the Internet of Vehicles(IoV). With the increasing popularity of digital photography and Internet technology, more and more users are sharing images on CPN. However, many images are shared without any privacy processing, exposing hidden privacy risks and making sensitive content easily accessible to Artificial Intelligence(AI) algorithms. Existing image sharing methods lack fine-grained image sharing policies and cannot protect user privacy. To address this issue, we propose a social relationship-driven privacy customization protection model for publishers and co-photographers. We construct a heterogeneous social information network centered on social relationships, introduce a user intimacy evaluation method with time decay, and evaluate privacy levels considering user interest similarity. To protect user privacy while maintaining image appreciation, we design a lightweight face-swapping algorithm based on Generative Adversarial network(GAN) to swap faces that need to be protected. Our proposed method minimizes the loss of image utility while satisfying privacy requirements, as shown by extensive theoretical and simulation analyses.

关键词： Cyber-physical networks Customized privacy Face-swapping Heterogeneous information network Deep fakes

来源：评论

学校读者我要写书评

暂无评论

Fusion of Time-Frequency Features in Contrastive Learning for Shipboard Wind Speed Correction

引用

Journal of Ocean University of China 2025年第2期24卷 377-386页

作者： SONG Jian HUANG Meng LI Xiang ZHANG Zhenqiang WANG Chunxiao ZHAO Zhigang Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250000China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250000China

Accurate wind speed measurements on maritime vessels are crucial for weather forecasting,sea state prediction,and safe ***,vessel motion and challenging environmental conditions often affect measurement *** address this issue,this study proposes an innovative framework for correcting and predicting shipborne wind *** integrating a main network with a momentum updating network,the proposed framework effectively extracts features from the time and frequency domains,thereby allowing for precise adjustments and predictions of shipborne wind speed *** using real sensor data collected at the Qingdao Oceanographic Institute demonstrates that the proposed method outperforms existing approaches in single-and multi-step predictions compared to existing methods,achieving higher accuracy in wind speed *** proposed innovative approach offers a promising direction for future validation in more realistic maritime onboard scenarios.

关键词： time series prediction wind speed correction comparative learning shipborne sensor

来源：评论

学校读者我要写书评

暂无评论

Generalized Fourier Transform Pair Codes

引用

IEEE Communications Letters 2025年第5期29卷 933-937页

作者： Lv, Yaping Cai, Suihua Ma, Xiao Sun Yat-sen University School of Computer Science and Engineering Guangdong Key Laboratory of Information Security Technology MoE Key Laboratory of Information Technology Guangzhou510006 China

This letter is concerned with Fourier transform pair (FTP) codes over finite fields. Given any element of order n in a finite field, we can construct an FTP code with length 2n , dimension n, and minimum distance at least 2√n. Distinguishingly, an FTP code defined with any element (if it exists) of order 2, 3 or 5 in a finite field is a maximum distance separable code. In this letter, we extend the FTP codes to generalized FTP (GFTP) codes. To show the superiority of the GFTP codes over the FTP codes, we compute the binary weight spectra of the GFTP codes, approaching more close than the FTP codes to that of the random codes. We also apply the ordered statistic decoding with local constraints (LC-OSD) algorithm to the binary image of GFTP codes. Numerical results show that the GFTP codes perform better than the FTP codes as the code length increases. Numerical results also show that GFTP codes are comparable with existing codes of the same code rate and similar code length. © 1997-2012 IEEE.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：