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

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

来源：评论

学校读者我要写书评

暂无评论

THL: Fast Targeted High Utility Itemset Mining within Length Consideration

Journal of Network Intelligence

引用

Journal of network Intelligence 2025年第1期10卷 541-558页

作者： Xu, Peiming Jiang, Yixin Kuang, Xiaoyun Luo, Yu Chen, Jiahui Guangdong Provincial Key Laboratory of Power System Network Security CSG Guangzhou510000 China School of Computer Science and Technology Guangdong University of Technology Guangzhou510006 China

High utility itemset mining is a research topic of the pattern mining domain, which has been widely applied in reality during the past decade. Although most high utility itemset mining algorithms show significant execution performance regarding runtime and memory usage, numerous results are useless for users. Targeted high utility itemset mining can reduce the number of high utility itemsets and improve the efficiency of pattern analysis. However, the targeted high utility itemset mining task aims to find targeted high utility itemsets with as many items as possible. Users are not that interested in long results in actual scenarios. Therefore, in this article, we first formulate the problem and then address this issue by proposing a new algorithm named THL for mining targeted high utility itemset within length constraints, based on utility list structure. Furthermore, to improve the performance of the novel algorithm, THL adopts several efficiency pruning strategies, including length and utility aspects. Finally, we conduct an extensive experimental evaluation to compare the SOTA algorithms with THL on several datasets. © 2025, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： data mining high utility itemset length constraint targeted items

来源：评论

学校读者我要写书评

暂无评论

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge Computing

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Ming Northeastern University School of Computer Science and Engineering Engineering Research Center of Security Technology of Complex Network System Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University School of Computer Science and Engineering Shenyang110819 China

Mobile edge computing (MEC) integrated with network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system information. We first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multi-per-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Textual Data De-Privatization Scheme Based on Generative Adversarial networks 24th

Textual Data De-Privatization Scheme Based on Generative Adv...

引用

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

作者： Du, Yanning Xu, Jinnan Zhang, Yaling Wang, Yichuan Wang, Zhoukai School of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China

ISBN: (纸本)9789819615506

In many fields, such as healthcare, finance, and scientific research, data sharing and collaboration are critical to achieving better outcomes. However, the sharing of personal data often involves privacy risks, so privacy-preserving techniques are needed to ensure data security and privacy. The superior performance and flexibility of generative models in data representation have led to significant progress in the development of data privacy. This paper proposes a textual data de-privatization scheme based on generative adversarial networks that well combines generative adversarial networks with privacy protection. The generated de-privacy data retains the statistical properties of the original data and effectively removes sensitive information. Moreover, feature sorting and reshaping modules are introduced to enable the generator to better capture the relationships between features, thus improving the quality of synthetic data. In this paper, the utility of synthetic data is evaluated from three aspects, including similarity assessment, privacy assessment, and model utility assessment. Experimental results show that this method achieves a good trade-off in terms of textual data privacy protection and data quality maintenance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Adjacency Query Supporting Homoionym Search over Medical Graph Data in Cloud Computing 17th

Privacy Preserving Adjacency Query Supporting Homoionym Sear...

引用

17th International Conference on Cloud Computing, CLOUD 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Li, Hourong Tian, Yun Wu, Bin Shi, Jiaoli School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China

ISBN: (纸本)9783031771521

Cloud computing is widely used in all walks of life today. Massive amounts of medical graph data are being outsourced to cloud servers to reduce overhead. The untrustworthiness of cloud servers puts the sensitive information of outsourced graph data at risk. To eliminate this security risk, it is an effective method to encrypt sensitive data. The adjacent queries are frequently used and highly valuable in graph data operations, and the adjacency query supporting homoionym search will enlarge the query effect and improve the query function. When the medical graph data is encrypted and stored on the cloud server, the operation of the data becomes extremely difficult. In this article, we propose a scheme to implement the adjacency query supporting homoionym search in cloud computing (AQHS), which maintains search contents privacy. We use a stem extraction algorithm and the searchable encryption mechanism to build secure index, and then achieve the adjacency query. The security of our proposed scheme is verified by formal analysis, and the effectiveness of the scheme is verified by experimental analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Unveiling the Superiority of Unsupervised Learning on GPU Cryptojacking Detection: Practice on Magnetic Side Channel-Based Mechanism

引用

IEEE Transactions on Information Forensics and security 2025年 20卷 4874-4889页

作者： Cao, Hangcheng Xu, Guowen He, Ziyang Shi, Shaoqing Xu, Shengmin Wu, Cong Ning, Jianting Hunan University College of Computer Science and Electronic Engineering Changsha410012 China City University of Hong Kong Department of Computer Science Hong Kong Hong Kong University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu610054 China Zhengzhou University School of Cyber Science and Engineering Zhengzhou450001 China Zhengzhou University International College Zhengzhou450001 China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou350007 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore Wuhan University School of Cyber Science and Engineering Wuhan430072 China City University of Macau Faculty of Data Science Macau China

Ample profits of GPU cryptojacking attract hackers to recklessly invade victims’ devices, for completing specific cryptocurrency mining tasks. Such malicious invasion undoubtedly obstructs normal device usage and wastes computation resources. To resist the threat of GPU cryptojacking, existing works aim to timely detect and clear away it, by distinguishing the dissimilitude between it and legitimate applications. However, these detection mechanisms inappropriately rely on two conflict cornerstones, manifested in leveraging mutable samples of illegitimate cryptojacking to design supervision-based detection models requiring samples with stable patterns. This limitation compromises the practicability of existing detection mechanisms in the face of mutable cryptojacking samples. To fill the gap, we explore the superiority of unsupervised learning in handling this issue and further propose an unsupervised manner-enabled detection mechanism named MagInspector, only using legitimate applications’ magnetic signatures from GPU side channels for model construction. MagInspector innovates in training an unsupervised autoencoder network by an adversarial mode that well learns the stable signature patterns of legitimate applications, while incompatible with mutable cryptojacking ones. In the process of model training, we elaborately extract mutual energy cumulation distribution features to represent legitimate applications to overcome the impact of their inter-type differences. Meanwhile, a locality sensitive hashing-driven outlier removal algorithm is designed to enhance MagInspector’s robustness to the noise samples. Finally, extensive experiments are conducted on GPUs covering four generations of common NVIDIA architectures and two generations of AMD architectures;the results show that applying MagInspector to mutable cryptojacking signature detection achieves a significant average accuracy improvement of 25.5% and 17.8%, respectively. © 2005-2012 IEEE.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

A novel coarse-grained knowledge graph embedding framework for platform risk identification from relational data

引用

Neural Computing and Applications 2025年 1-21页

作者： Zhang, Qi Wang, Shicheng Wang, Lihong Sheng, Jiawei Guo, Shu Li, Chen He, Min Zhang, Renqiang School of Economics and Management Beihang University Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China School of Computer Science and Engineering Beihang University Beijing China

Platform risk identification from relational data aims to determine whether the target platforms are risky or not. However, in such a scenario, the relation data involve massive types of relations and numerous numerical-aware relations composed of attributes and infinite continuous values are challenges in this field. It is paramount to capture semantic information of relations and precise control power, drastically affecting the power of learning and the performance of identifying risky platforms. Recent financial risk studies often employed graph neural networks (GNNs) to model relational data, which fall short of capturing the intricacies of such complex relationships resulting in incorrect identification of platforms. To solve this problem, we propose a novel coarse-grained knowledge graph embedding (CKGE) framework that integrates coarse-grained knowledge graph construction and adopts five well-known knowledge graph embedding methods and ensemble learning. The extensive experimental results based on a real-world peer-to-peer lending platform dataset demonstrate that the CKGE framework achieves state of the art over GNNs for platform risk identification. Our study highlights the importance of utilizing the relational data of multi-type and multi-numerical relations for revealing platform risk situations and provides an alternative solution for identifying platform risk. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Across-Platform Detection of Malicious Cryptocurrency Accounts via Interaction Feature Learning

引用

IEEE Transactions on Information Forensics and security 2025年 20卷 4783-4798页

作者： Che, Zheng Shen, Meng Tan, Zhehui Du, Hanbiao Wang, Wei Chen, Ting Zhao, Qinglin Xie, Yong Zhu, Liehuang Beijing Institute of Technology School of Computer Science Beijing100081 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China Xi'an Jiaotong University Key Laboratory for Intelligent Networks and Network Security Ministry of Education Xi'an710049 China University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Macau University of Science and Technology School of Computer Science and Engineering Taipa China Qinghai Institute of Technology School of Computer and Information Science Xining810016 China

With the rapid evolution of Web3.0, cryptocurrency has become a cornerstone of decentralized finance. While these digital assets enable efficient and borderless financial transactions, their pseudonymous nature has also attracted malicious activities such as money laundering, fraud, and other financial crimes. Effective detection of malicious accounts is crucial to maintaining the security and integrity of the Web 3.0 ecosystem. Existing malicious account detection methods rely on large amounts of labeled data and suffer from low generalization. Label-efficient and generalizable malicious account detection remains a challenging task. In this paper, we propose ShadowEyes, a framework for detecting malicious accounts by leveraging interaction feature learning with only a small labeled dataset. Specifically, We first propose a generalized account representation named TxGraph, which captures the universal interaction features of Ethereum and Bitcoin. Then we carefully design an account representation augmentation method tailored to simulate the evolution of malicious accounts to generate positive pairs. We conduct extensive experiments using public datasets to evaluate the performance of ShadowEyes. The results demonstrate that it outperforms state-of-the-art (SOTA) methods in four typical scenarios. Specifically, in the scenario of across-platform malicious account detection, ShadowEyes maintains an F1 score of around 90%, which is 10% higher than the SOTA method. In the zero-shot learning scenario, it can achieve an F1 score of 79.56% for detecting gambling accounts, surpassing the SOTA method by 10.44%. © 2005-2012 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Hedonic Coalition Formation Game and Contract-Based Federated Learning in AAV-Assisted Internet of Things

引用

IEEE Internet of Things Journal 2025年第9期12卷 11258-11272页

作者： Liu, Jia Li, Xiaoxu Xu, Yang Lyu, Chen Wang, Yichuan Liu, Xiaoying Xidian University School of Computer Science and Technology Xi’an710071 China Shanghai University of Finance and Economics School of Computing and Artificial Intelligence MoE Key Laboratory of Interdisciplinary Research of Computation and Economics Shanghai200433 China Xi’an University of Technology Shaanxi Key Laboratory of Network Computing and Security Technology Xi’an710071 China Zhejiang University of Technology School of Computer Science and Technology Hangzhou310023 China

Coupled with the rise of Deep Learning, the wealth of data and enhanced computation capabilities of Internet of Things (IoT) components enable effective artificial intelligence (AI)-based models to be built. Beyond ground data sources, autonomous aerial vehicles (AAVs)-based service providers for data collection and AI model training, i.e., Drones-as-a-Service (DaaS), have become increasingly popular in recent years. However, the stringent regulations governing data privacy potentially impede data sharing across independently owned AAVs. To this end, we propose in this article a federated learning (FL)-based architecture that enables privacy-preserving collaborative machine learning across a federation of independent DaaS providers for the development of IoT applications. Specifically, this work introduces a novel incentive mechanism based on the hedonic coalition formation game to enhance the sustainable efficiency and stability of the FL system. By establishing tailored operational rules and functions, the proposed mechanism enables IoT sensing nodes to autonomously form optimal coalitions with AAVs, thereby ensuring robust collaboration. To deal with incentive mismatches and information asymmetry, we leverage the contract theory and propose a self-disclosure mechanism that guarantees truthful reporting of AAV capabilities while optimizing the global model owner’s profits. The performance-based AAV type is also defined to offer a practical measure for heterogeneous AAVs and serve as the foundation for fair and effective contract design. Simulation results validate the superiority of the proposed approach, demonstrating significant improvements in utility optimization and system stability compared to existing benchmarks. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：