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

Fine-Grained Access Control with Privacy-Preserving Data Retrieval for Cloud-Assisted IoV

IEEE Transactions on Vehicular Technology 2025年

作者： Li, Wenchao Xia, Chunhe Yang, Simiao Wang, Kangming Huang, Guotao Huang, Luqi Guo, Fuchun Susilo, Willy Wang, Tianbo Beihang University School of Cyber Science and Technology Beijing100191 China University of Wollongong School of Computing and Information Technology Institute of Cybersecurity and Cryptology WollongongNSW2522 Australia Beihang University Beijing Key Laboratory of Network Technology Beijing100191 China Guangxi Normal University Guangxi Collab. Innovation Center of Multi-source Information Integration and Intelligent Processing Guilin541004 China Beihang University Sino-French Engineer School Beijing100191 China Beihang University Computer Science and Engineering School Beijing100191 China

In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving Data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

A knowledge-enhanced interest segment division attention network for click-through rate prediction

引用

Neural computing and Applications 2024年第34期36卷 21817-21837页

作者： Liu, Zhanghui Chen, Shijie Chen, Yuzhong Su, Jieyang Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

引用

IEEE Transactions on Mobile computing 2025年

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

DRLO: Optimizing edge server placement in dynamic MEC scenarios using deep reinforcement learning

引用

Computer networks 2025年 268卷

作者： Yingya Guo Cen Chen College of Computer and Data Science Fuzhou University PR China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University PR China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian PR China

As an emerging computing paradigm, Mobile Edge computing (MEC) significantly enhances user experience and alleviates network congestion by strategically deploying edge servers in close proximity to mobile users. However, the effectiveness of MEC hinges on the precise placement of these edge servers, a critical factor in determining the Quality of Experience (QoE) for mobile users. While existing studies predominantly focus on optimizing edge server placement in static scenarios, they often fall short when faced with user mobility, resulting in a degradation of QoE. To address this challenge, we propose an adaptive edge server placement approach that leverages Deep Reinforcement Learning (DRL) to select the base stations for placing edge servers in a dynamic MEC environment. Our objective is to minimize access delay by optimizing edge server placement for adapting to dynamic environment. To tackle the vast action space associated with edge server placement, we introduce a novel activation function in the actor neural network for efficient exploration. Furthermore, to enhance the adaptability of the derived edge server placement strategy, we meticulously design a new reward function, which takes into account the minimization of total access delay within dynamic MEC scenarios. Finally, to validate the effectiveness of our proposed method, extensive experiments were conducted using the Shanghai Telecom dataset. The results demonstrate that our approach outperforms baseline methods in minimizing access delay for users in dynamic MEC scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive resource allocation for cloud-based software services based on progressive QoS prediction model

引用

Science China(information Sciences) 2019年第11期62卷 192-194页

作者： Xing CHEN Junxin LIN Yun MA Bing LIN Haijiang WANG Gang HUANG College of Mathematics and Computer Science Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University School of Software Tsinghua University College of Physics and Energy Fujian Normal University Key Laboratory of High Confidence Software Technologies Ministry of Education

Dear editor,Self-adaptation is a promising approach to allocate resources for cloud-based software services [1, 2].Traditional self-adaptive resource-allocation methods are rule-driven, which leads to high administrat... 详细信息

关键词： service Self-adaptive resource allocation for cloud-based software services based on progressive QoS prediction model

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

arXiv

引用

arXiv 2025年

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian Key Laboratory of Network Fuzhou350002 China Computing and Intelligent Information Processing [Fuzhou University Fuzhou350116 China Department of Computer Science Faculty of Environment Science and Economy University of Exeter ExeterEX4 4QF United Kingdom School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Informatics University of Oslo Oslo0316 Norway

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Detecting community structures in social networks with particle swarm optimization

Detecting community structures in social networks with parti...

引用

2nd CCF Internet Conference of China, ICoC 2013

作者： Chen, Yuzhong Qiu, Xiaohui Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou University China

ISBN: (纸本)9783642539589

Community detection in social networks is usually considered as an objective optimization problem. Due to the limitation of the objective function, the global optimum cannot describe the real partition well, and it is time consuming. In this paper, a novel PSO (particle swarm optimization) algorithm based on modularity optimization for community detection in social networks is proposed. Firstly, the algorithm takes similarity-based clustering to find core areas in the network, and then a modified particle swarm optimization is performed to optimize modularity in a new constructed weighted network which is compressed from the original one, and it is equivalent to optimize modularity in the original network with some restriction. Experiments are conducted in the synthetic and four real-world networks. The experimental results show that the proposed algorithm can effectively extract the intrinsic community structures of social networks. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Attack intent analysis method based on attack path graph 9

Attack intent analysis method based on attack path graph

引用

9th International Conference on Communication and network Security, ICCNS 2019

作者： Chen, Biqiong Liu, Yanhua Li, Shijin Gao, Xiaoling College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

With the rapid development of network technology, network security problems are gradually increasing, and the network attack situation is very severe. In a complex attack scenario, timely detection of potential attack behaviors and timely identification and pre-judgment of attack intentions are important components of security risks. However, the attack behavior in the network presents complexity, multi-step and uncertainty, which brings new technical challenges to attack intent analysis. Aiming at the problem that the attack intention of multi-step complex attack is difficult to identify, this paper proposes an attack intention analysis method based on attack path graph. Firstly, aiming at the multi-step complex attack behavior analysis problem, the key asset assessment technology is used to find out the key assets in the network system, and the hypothetical attack intention is generated according to the security protection requirements of the network system. Then, it is difficult to manually construct the attack path map in the large-scale network, and the automatic generation of the attack path map is realized. Finally, a method of network attack intent identification is proposed and a calculation method of attack intent probability is designed, which improves the efficiency and accuracy of attack intent recognition. © 2019 Association for computing Machinery.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

A comprehensive assessment method of asset importance for key asset protection 9

A comprehensive assessment method of asset importance for ke...

引用

9th International Conference on Communication and network Security, ICCNS 2019

作者： Gao, Xiaoling Liu, Yanhua Qiu, Yanbin Liu, Huajun College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

In a given system network, an important prerequisite for security risk control is how to accurately calculate the impact of different host assets in the topology on the spread of attack risk. In this regard, we propose a comprehensive asset importance assessment model for critical asset protection. First, the importance of local static assets in the topology was evaluated using three methods: degree centrality, mediation centrality, and closeness centrality. At the same time, PageRank was used to assess the importance of local dynamic assets for asset level changes. By combining the above two methods, and using K-CORE to evaluate the core position of the host in the network topology as the global weight indicator of the importance of assets. The comprehensive evaluation results of the importance of topology-oriented assets was finally obtained, and the validity of the model was verified through the experiment of the simulation ER random network. © 2019 Association for computing Machinery.

关键词： network topology

来源：评论

学校读者我要写书评

暂无评论

Abnormal network traffic detection based on leaf node density ratio 9

Abnormal network traffic detection based on leaf node densit...

引用

9th International Conference on Communication and network Security, ICCNS 2019

作者： Liu, Huajun Liu, Zhanghui Liu, Yanhua Gao, Xiaoling College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

As the network evolves, cyber-attacks become more and more diverse. In the process of detecting network traffic, the most complicated but also the most important task is to find unknown abnormal network traffic data in time. In the existing abnormal network traffic detection method based on Extended Isolation Forest, there are limitations such as unbalanced detection accuracy and insufficient generalization ability. An improved abnormal network traffic detection method EIF-LNDR is proposed for the above problems. Based on the leaf node density ratio, the anomaly score of the instance can be calculated differently for each iTree. The experiments show that EIF-LNDR has significant improvement in precision, false negative rate, and detector efficiency compared with Extended Isolation Forest and LOF methods. © 2019 Association for computing Machinery.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：