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

RoPA: Robust Privacy-Preserving Forward Aggregation for Split Vertical Federated Learning

IEEE Transactions on network and Service Management 2025年

作者： Wang, Lingling Zhang, Zhengyin Huang, Mei Gai, Keke Wang, Jingjing Shen, Yulong Qingdao University of Science and Technology School of Information Science and Technology Shandong Qingdao 266061 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing 100081 China Xidian University School of Computer Science and Technology China Shaanxi Key Laboratory of Network and System Security Xi’an 710071 China

Split Vertical Federated Learning (Split VFL) is an increasingly popular framework for collaborative machine learning on vertically partitioned data. However, it is vulnerable to various attacks, resulting in privacy leakage and robust aggregation issues. Recent works have explored the privacy protection of raw data samples and labels, neglecting malicious attacks launched by dishonest passive parties. Since they may deviate from the protocol and launch embedding poisoning attacks and free-riding attacks, it will inevitably result in model performance loss. To address this issue, we propose a Robust Privacy-preserving forward Aggregation (RoPA) protocol, which can resist embedding poisoning attacks and free-riding attacks and protect the privacy of embedding vectors. Specifically, we first present a modified Secret-shared Non-Interactive Proofs (SNIP) algorithm to guarantee the integrity verification of embedding vectors. To prevent free-riding attacks, we also give a validity verification protocol using matrix commitment. In particular, we utilize probability checking and batch verification to improve the verification efficiency of the protocol. Moreover, we adopt arithmetic secret sharing to protect data privacy. Finally, we conduct rigorous theoretical analysis to prove the security of RoPA and evaluate the performance of RoPA. The experimental results show that the proof verification overhead of RoPA is approximately 8× lower than the original SNIP, and the model accuracy is improved by ranging from 3% to 15% under the above two malicious attacks. © 2004-2012 IEEE.

关键词： Integrity Privacy-preserving Robust SNIP Vertical federated learning

来源：评论

学校读者我要写书评

暂无评论

NOMA-Based Ze-RIS Empowered Backscatter Communication with Energy-Efficient Resource Management

引用

IEEE Transactions on Communications 2025年

作者： Asif, Muhammad Bao, Xu Ihsan, Asim Khan, Wali Ullah Li, Xingwang Chatzinotas, Symeon Dobre, Octavia A. The School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China The Department of Electrical Engineering University of Cambridge Cambridge United Kingdom University of Luxembourg Luxembourg City1855 Luxembourg The School of Physics and Electronic Information Engineering Henan Polytechnic University the Jiaozuo Key Laboratory of Crow-Sensing Network Jiaozuo454003 China The Department of Electrical and Computer Engineering Faculty of Engineering and Applied Science Memorial University St. John’sNLA1B 3X9 Canada

This manuscript introduces a novel energy-efficient optimization strategy for a zero-energy reconfigurable intelligent reflecting surface (Ze-RIS) supported backscatter communication system employing non-orthogonal multiple access (NOMA). The central objective is to maximize the energy efficiency of the system by optimizing the several key parameters, including the amplitude reflection coefficient of Ze-RIS, the reflection coefficients of the backscatter tags, transmit beamforming at the base station, and passive beamforming at the Ze-RIS node, while incorporating a practical non-linear energy harvesting model both for the Ze-RIS and backscatter nodes. The proposed algorithm addresses the complex non-convex problem through three stages. Firstly, the transmit beamforming vectors are determined by leveraging the semi-definite programming and successive-convex approximation, while handling the rank-1 constraint with the semi-definite relaxation. Secondly, we determine the amplitude reflection coefficient of Ze-RIS by leveraging the monotonicity property of the objective function. Simultaneously, we compute the reflection coefficients of backscatter tags using the Dinkelbach algorithm, Lagrange duality, and the sub-gradient method. Thirdly, we compute passive beamforming using successive-convex approximation and semi-definite programming techniques, achieving a rank-1 solution through the penalty-based method. Finally, the numerical simulations confirm the effectiveness of the proposed approach, demonstrating its superiority over the benchmark competitors with rapid convergence within a few iterations. © 1972-2012 IEEE. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Bandwidth Allocation and Rate Coordination for DiffServ Environment

引用

Wuhan University Journal of Natural Sciences 2006年第1期11卷 248-252页

作者： CHEN Gang WU Guo-xin ZHANG San-feng YOU Feng-qin Department of Computer Science and Engineering Southeast University Nanjing 210096 Jiangsu China Key Laboratory of Computer Network and Information Integration of MOE Southeast University Nanjing 210096Jiangsu China

This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker（BB）. In this model, assignment of bandwidth was made according to a periodic trace of network characteristics per application. And adjustment of transfer rate was accomplished through negotiation with applications by a bandwidth agent. This model was evaluated using network simulator 2 （NS-2）, and distinct improvements were found in respects of delay and packet loss of overall network and single flow. Finally, the model was suggested to be leveraged to multimedia applications with properties of lower delay and lower packet loss.

关键词： QoS bandwidth broker（BB） dynamic bandwidth allocation rate coordination

来源：评论

学校读者我要写书评

暂无评论

Splicer+: Secure Hub Placement and Deadlock-Free Routing for Payment Channel network Scalability

arXiv

引用

arXiv 2025年

作者： Yang, Lingxiao Dong, Xuewen Wang, Wei Gao, Sheng Qu, Qiang Tian, Wensheng Shen, Yulong The School of Computer Science and Technology Xidian University Xi’an710071 China The Shaanxi Key Laboratory of Network and System Security Xi’an710071 China The Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing100044 China The School of Information Central University of Finance and Economics Beijing100081 China The Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China The Huawei Blockchain Lab Huawei Cloud Tech Co. Ltd. Shenzhen518055 China The Nanhu Lab Jiaxing314001 China The Cryptology and Computer Security Laboratory Shanghai Jiao Tong University Shanghai200240 China

Payment channel hub (PCH) is a promising approach for payment channel networks (PCNs) to improve efficiency by deploying robust hubs to steadily process off-chain transactions. However, existing PCHs, often preplaced without considering payment request distribution across PCNs, can lead to load imbalance. PCNs' reliance on source routing, which makes decisions based solely on individual sender requests, can degrade performance by overlooking other requests, thus further impairing scalability. In this paper, we introduce Splicer+, a highly scalable multi-PCH solution based on the trusted execution environment (TEE). We study tradeoffs in communication overhead between participants, transform the original NP-hard PCH placement problem by mixed-integer linear programming, and propose optimal/approximate solutions with load balancing for different PCN scales using supermodular techniques. Considering global PCN states and local directly connected sender requests, we design a deadlock-free routing protocol for PCHs. It dynamically adjusts the payment processing rate across multiple channels and, combined with TEE, ensures high-performance routing with confidential computation. We provide a formal security proof for the Splicer+ protocol in the UC-framework. Extensive evaluations demonstrate the effectiveness of Splicer+, with transaction success ratio (↑51.1%), throughput (↑181.5%), and latency outperforming state-of-the-art PCNs. Copyright © 2025, The Authors. All rights reserved.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient Batch Verification and Privacy-Preserving Data Aggregation Scheme in V2G networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Congcong Wang, Chen Shen, Jian Vasilakos, Athanasios V. Wang, Bin Wang, Weizheng Department of Software Engineering Nanjing University of Information Science and Technology Nanjing210044 China the Zhejiang Key Laboratory of Digital Fashion and Data Governance the Zhejiang Provincial International Cooperation Base for Science and Technology on Cloud Computing Security and Data Aggregation Zhejiang Sci-Tech University Hangzhou310018 China Zhejiang Provincial Innovation Center of Advanced Textile Technology Shaoxing312000 China College of Computer Science and Information Technology IAU Saudi Arabia Grimstad4879 Norway Network and Data Security Hangzhou310053 China Computer Science Department City University of Hong Kong Hong Kong the Division of Computer Science University of Aizu Fukushima965–8580 Japan

In recent years, against the backdrop of smart grids, vehicle-to-grid (V2G) interaction has become a hot topic. With the increasing number of new energy vehicles, handling massive amounts of electricity transaction data has become an urgent problem in need of resolution. Ensuring the security of the vast quantities of electricity transaction data has emerged as a significant challenge. Therefore, two data aggregation schemes are proposed in this paper, both supporting batch verification and privacy protection in centralized and distributed scenarios, respectively. Firstly, an improved Paillier cryptosystem is utilized to achieve lightweight encryption in the proposed schemes. In addition, a novel distributed data aggregation structure that combines a large number of geographically distributed fog nodes with centralized cloud servers is introduced. This structure not only meets the requirements of lightweight encryption and resistance against single point failures but also reduces the communication complexity of distributed data aggregation to O(n). According to the security proofs and experimental analysis, it can be demonstrated that both proposed schemes are effective and secure, meeting the lightweight requirements of modern smart grid systems. © 2025 IEEE. All rights reserved,

关键词： Data aggregation

来源：评论

学校读者我要写书评

暂无评论

DRL-Based Optimization for AoI and Energy Consumption in C-V2X Enabled IoV

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and networking 2025年

作者： Zhang, Zheng Wu, Qiong Fan, Pingyi Cheng, Nan Chen, Wen Letaief, Khaled B. Jiangnan University School of Internet of Things Engineering Wuxi214122 China Tsinghua University Beijing National Research Center for Information Science and Technology Department of Electronic Engineering State Key laboratory of Space Network and Communications Tsinghua University Beijing100084 China Xidian University State Key Lab. of ISN School of Telecom-munications Engineering Xi'an710071 China Shanghai Jiao Tong University Department of Electronic Engineering Shanghai200240 China Department of Electrical and Computer Engineer-ing Hong Kong

To address communication latency issues, the Third Generation Partnership Project (3GPP) has defined Cellular-Vehicle to Everything (C-V2X) technology, which includes Vehicle-to-Vehicle (V2V) communication for direct vehicle-to-vehicle communication. However, this method requires vehicles to autonomously select communication resources based on the Semi-Persistent Scheduling (SPS) protocol, which may lead to collisions due to different vehicles sharing the same communication resources, thereby affecting communication effectiveness. Non-Orthogonal Multiple Access (NOMA) is considered a potential solution for handling large-scale vehicle communication, as it can enhance the Signal-to-Interference-plus-Noise Ratio (SINR) by employing Successive Interference Cancellation (SIC), thereby reducing the negative impact of communication collisions. When evaluating vehicle communication performance, traditional metrics such as reliability and transmission delay present certain contradictions. Introducing the new metric Age of information (AoI) provides a more comprehensive evaluation of communication system. Additionally, to ensure service quality, user terminals need to possess high computational capabilities, which may lead to increased energy consumption, necessitating a trade-off between communication energy consumption and effectiveness. Given the complexity and dynamics of communication systems, Deep Reinforcement Learning (DRL) serves as an intelligent learning method capable of learning optimal strategies in dynamic environments. Therefore, this paper analyzes the effects of multi-priority queues and NOMA on AoI in the C-V2X vehicular communication system and proposes an energy consumption and AoI optimization method based on DRL. Finally, through comparative simulations with baseline methods, the proposed approach demonstrates its advances in terms of energy consumption and AoI. © 2017 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

High-efficiency quantum steganography based on the tensor product of Bell states

引用

Science China(Physics,Mechanics & Astronomy) 2013年第9期56卷 1745-1754页

作者： XU ShuJiang CHEN XiuBo NIU XinXin YANG YiXian Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences

In this paper,we first propose a hidden rule among the secure message,the initial tensor product of two Bell states and the final tensor product when respectively applying local unitary transformations to the first particle of the two initial Bell states,and then present a high-efficiency quantum steganography protocol under the control of the hidden *** the proposed quantum steganography scheme,a hidden channel is established to transfer a secret message within any quantum secure direct communication(QSDC) scheme that is based on 2-level quantum states and unitary *** secret message hiding/unhiding process is linked with the QSDC process only by unitary *** accurately describe the capacity of a steganography scheme,a quantitative measure,named embedding efficiency,is introduced in this *** performance analysis shows that the proposed steganography scheme achieves a high efficiency as well as a good ***,it is shown that this scheme can resist all serious attacks including the intercept-resend attack,measurement-resend attack,auxiliary particle attack and even the Denial of Service *** improve the efficiency of the proposed scheme,the hidden rule is extended based on the tensor product of multiple Bell states.

关键词： quantum steganography embedding efficiency quantum secure direct communication tensor product Bell state

来源：评论

学校读者我要写书评

暂无评论

UAV-Edge Cloud collaboration for online offloading and trajectory control in multi-layer Mobile Edge Computing

引用

Ad Hoc networks 2025年 176卷

作者： Xu, Siyang Ma, Jingyi Lu, Qiuyu Xie, Zhigang Song, Xin Computer and Communication Engineering Northeastern University at Qinhunagdao Hebei Province Qinhuangdao066004 China Computer Science and Engineering Northeastern University Liaoning Province Shenyang110819 China Hebei Key Laboratory of Marine Perception Network and Data Processing Northeastern University Hebei Province Qinhuangdao066004 China Information Science and Engineering Yanshan University Hebei Province Qinhuangdao066000 China

Integrating Mobile Edge Computing (MEC) with Unmanned Aerial Vehicles (UAVs) offers enhanced coverage and computational support for mobile IoT devices (MIDs). Due to the inherent computational capacity and energy constraints of UAV, existing UAV-assisted MEC systems struggle to satisfy computation-intensive network services for numerous MIDs. To address this issue, this paper proposes a UAV and ground-based Edge Cloud (EC) collaboration MEC system. Specifically, the EC is equipped with an energy transmitter to provide wireless power transfer (WPT) to the UAV, thereby collaboratively managing backlog tasks in scenarios where task and energy arrive stochastically. To achieve optimal service delivery, we formulate a long-term stochastic optimization problem aiming to jointly optimize UAV energy consumption and system throughput while ensuring task queue stability. However, this NP-hard problem posed by the stochastic nature of task arrivals and energy constraints, we develop an online offloading and trajectory control (OOTC) algorithm. This algorithm uses Lyapunov optimization theory to transform the long-term stochastic optimization problem into a deterministic per-slot optimization problem. The OOTC algorithm decouples control decisions across consecutive time slots, reducing computational complexity and ensuring queue stability without relying on statistical knowledge. We further decompose it into three subproblems, and derive suboptimal solutions by the Successive Convex Approximation (SCA) and the Lagrangian duality. Simulations show OOTC algorithm outperforms benchmarks and maintains stability. © 2025 Elsevier B.V.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

A Novel Quantum Covert Channel Protocol Based on Any Quantum Secure Direct Communication Scheme

引用

Communications in Theoretical Physics 2013年第5期59卷 547-553页

作者：徐淑奖陈秀波钮心忻杨义先 Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center State Key Laboratory of Information Security (Institute of Information Engineering Chinese Academy of Sciences)

By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which employs unitary transformations to encode information. On the basis of the fact that the unitary transformations used in a QSDC protocol are secret and independent, a novel quantum covert channel protocol is proposed to transfer secret messages with unconditional security. The performance, including the imperceptibility, capacity and security of the proposed protocol are analyzed in detail.

关键词： quantum information hiding quantum covert channel quantum cryptography quantum communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：