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

34th ACM Web Conference, WWW 2025

作者： Li, Ken Shi, Bin Wei, Jiazhe Dong, Bo School of Computer Science and Technology Xi’an Jiaotong University Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China School of Distance Education Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9798400712746

Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d

关键词： Backdoor Attacks Federated Graph Learning

来源：评论

学校读者我要写书评

暂无评论

A Provably Secure Certificateless Signature Scheme With Anonymity for Healthcare IIoT

引用

IEEE Internet of Things Journal 2025年

作者： Qiao, Zirui Xu, Ran Zhou, Yanwei Yang, Bo Zhu, Tianqing Zhang, Mingwu Xi’an University of Posts and Telecommunications School of Cyberspace Security Xi’an China Ministry of Education Key Laboratory of Data Protection and Intelligent Management China Shaanxi Normal University School of Computer Science Xi’an China City University of Macau Faculty of Data Science Macau China Hubei University of Technology School of Computer Wuhan China

The industrial Internet of Things (IIoT) is changing our way of life and work. As the number of mobile devices connected to IIoT increases, users will face many security challenges such as insecure communication environments. The certificateless signature (CLS) scheme can ensure the integrity and validity of data and provide secure identity authentication for the IIoT, and several pairing-free CLS schemes have been proposed in recent years. However, we find they are vulnerable to the signature forgery attack of malicious key generation centers by safety analysis, which does not realize the security they have claimed. To solve this problem, we show an improved CLS scheme that achieves anonymity and formally proves its security under the hardness of the discrete logarithm problem in the random oracle. Comprehensive performance analysis and comparison show that our scheme has less communication and computation costs with higher security, and our construction is suitable for scenarios with limited resources. Finally, we apply this scheme to construct a mutual identity authentication protocol in the healthcare IIoT environment. 2014 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Identity-Based Inner-Product Functional Re-Encryption in Vaccine data Sharing

引用

IEEE Transactions on Cloud Computing 2025年

作者： Wang, Jing Zhou, Yanwei Zhu, Yasi Liu, Zhiquan Yang, Bo Zhang, Mingwu Shaanxi Normal University School of Computer Science Xi'an710119 China Sichuan University Key Laboratory of Data Protection and Intelligent Management Ministry of Education China Jinan University College of Cyber Security Guangzhou510632 China Hubei University of Technology School of Computer Wuhan430068 China

With the development of cloud computing, more and more data is stored in cloud servers, which leads to an increasing degree of privacy of data stored in cloud servers. For example, in the critical domain of medical vaccine trials, where public health outcomes hinge on the analysis of sensitive patient data, the imperative to safeguard privacy has never been more pronounced. Traditional encryption methods, though effective at protecting data, often expose vulnerabilities during decryption and lack the ability to support granular data access and computation. One-way re-encryption schemes further impede the agility of data sharing, which is indispensable for the collaborative efforts of research institutions. To address these limitations, we propose a novel bidirectional re-encryption scheme for inner-product functional encryption (IPFE). Our scheme secures data while allowing computation and sharing in an encrypted state, preserving patient privacy without hindering research. By harnessing inner-product functional encryption, our approach allows authorized researchers to extract valuable insights from encrypted data, significantly enhancing privacy protections. Our scheme's security is predicated on the $l$-ABDHE (augmented bilinear Diffie-Hellman exponent) assumption, ensuring robustness against chosen plaintext attacks within the standard model. This foundation not only secures the data but also yields compact ciphertext length, minimizing storage demands. We introduce a protocol specifically designed for medical vaccine trials, which leverages our bidirectional IB-IPFRE (Identity-Based Inner-Product Functional Re-Encryption) scheme. This protocol enhances data security, supports collaborative research, and maintains patient privacy. Its application in vaccine trials demonstrates the scheme's effectiveness in protecting sensitive information while enabling critical research insights. © 2013 IEEE.

关键词： Bidirectional re-encryption CPA security identity-based encryption inner-product function encryption

来源：评论

学校读者我要写书评

暂无评论

CoGAP: A Personalized Federated Learning Method Using Collaborative Optimization for Medical Image Classification

CoGAP: A Personalized Federated Learning Method Using Collab...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Shenhai Zheng Congyu Li Sian Wen Xi Gao Lei Yu College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China Emergency Department The Second Affiliated Hospital of Chongqing Medical University Chongqing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Federated learning (FL) has been widely used in medical image processing to protect data privacy, but it has issues with data heterogeneity. Personalized federated learning have emerged to tackle these issues but often focuses too much on personalized models at the expense of global models. To address these problem, we propose a personalized federated learning method CoGAP, using collaborative optimization to enhance both personalized and global model performance. On the client side, it employs adaptive weight aggregation to initialize personalized models and uses a training strategy based on L 2 regularization. On the server side, it implements a gradient accumulation-based aggregation method. These modules facilitate a collaborative optimization process where the global model guides the personalized models, and the personalized models provide positive feedback to the global model, ultimately leading to mutual improvement for both. We conducted extensive comparative experiments on the OCT2017 dataset, as well as the BloodMnist and PathMnist (subsets from MedMnist), to evaluate both global and personalized models. Results show that CoGAP own a unique strength which not only outperforms other personalized federated learning methods in personalization capability while also remarkably achieving satisfying global generalization. Code is available at https://***/lcyCQUPT/CoGAP.

关键词： Training Adaptation models Federated learning Collaboration Signal processing Servers Speech processing Optimization Image classification Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Joint Secure and Covert Communications for Active STAR-RIS Assisted ISAC systems

引用

IEEE Transactions on Wireless Communications 2025年

作者： Guo, Liang Jia, Jie Mu, Xidong Liu, Yuanwei Chen, Jian Wang, Xingwei Northeastern University School of Computer Science and Engineering China Northeastern University Engineering Research Center of Security Technology of Complex Network System Ministry of Education China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China BelfastBT3 9DT United Kingdom Department of Electrical and Electronic Engineering China

This paper investigates the design of jointly supporting physical layer security (PLS) and covert communications (CCs) in an active simultaneously transmitting and reflecting reconfigurable intelligent surface (a-STAR-RIS) assisted integrated sensing and communication (ISAC) system. Due to the unified waveform design of ISAC signals, we consider a challenging scenario with two targets being suspicious attackers, where one warden target potentially detects the confidential transmission behavior of covert users and another eavesdropper target attempts to intercept the broadcasted confidential information of security users. We investigate the joint beamforming design at the base station (BS) and the a-STAR-RIS to achieve a high-quality sensing beampattern while meeting covertness and security communication requirements. (1) For the ideal scenario with perfect channel state information (CSI) and precise target locations, we propose an alternative optimization (AO) method to address the optimization problem involving highly coupled variables. Specifically, the optimal beamforming design at the BS is handled using the semi-definite relaxation (SDR) technique, while the beamforming design at the a-STAR-RIS is addressed through a penalty-based iterative algorithm. (2) A more practical case with uncertain target locations and imperfect CSI is considered to achieve a robust beamforming design, where the non-deterministic outage probability constraints are effectively transformed by employing the Bernstein-type inequality. Numerical results demonstrate the superiority of the a-STAR-RIS over the baseline cases and certify that the proposed algorithms can effectively balance the tradeoff among the sensing quality, covert and secure communication requirements. Besides, results also show that the proposed robust beamforming scheme can construct adequate sensing beampattern, even with imperfect CSI and uncertain target locations. © 2002-2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

SOT-MRAM-based true in-memory computing architecture for approximate multiplication

引用

Chip 2025年第2期4卷

作者： Song, Min Tang, Qilong Ouyang, Xintong Duan, Wei Xu, Yan Zhang, Shuai You, Long Key Laboratory of Intelligent Sensing System and Security of the Ministry of Education Hubei Key Laboratory of Micro-Nanoelectronic Materials and Devices School of Microelectronics Hubei University Wuhan 430062 China School of Integrated Circuits Huazhong University of Science and Technology Wuhan 430074 China

The in-memory computing (IMC) paradigm emerges as an effective solution to break the bottlenecks of conventional von Neumann architecture. In the current work, an approximate multiplier in spin-orbit torque magnetoresistive random access memory (SOT-MRAM) based true IMC (STIMC) architecture was presented, where computations were performed natively within the cell array instead of in peripheral circuits. Firstly, basic Boolean logic operations were realized by utilizing the feature of unipolar SOT device. Two majority gate-based imprecise compressors and an ultra-efficient approximate multiplier were then built to reduce the energy and latency. An optimized data mapping strategy facilitating bit-serial operations with an extensive degree of parallelism was also adopted. Finally, the performance enhancements by performing our approximate multiplier in image smoothing were demonstrated. Detailed simulation results show that the proposed 8 × 8 approximate multiplier could reduce the energy and latency at least by 74.2% and 44.4% compared with the existing designs. Moreover, the scheme could achieve improved peak signal-to-noise ratio (PSNR) and structural similarity index metric (SSIM), ensuring high-quality image processing outcomes. © 2025 The Author(s)

关键词： Approximate multiplier data mapping strategy In-memory computing (IMC) Magnetoresistive random access memory (MRAM) Spin-orbit torque (SOT)

来源：评论

学校读者我要写书评

暂无评论

Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes

arXiv

引用

arXiv 2025年

作者： Wang, Xiaoqiang Li, Liuyi Wu, Yansheng Zheng, Dabin Lu, Shuxian Hubei Key Laboratory of Applied Mathematics Key Laboratory of Intelligent Sensing System and Security Ministry of Education Faculty of Mathematics and Statistics Hubei University Wuhan430062 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China National Mobile Communications Research Laboratory Southeast University Nanjing211111 China

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite family of Euclidean self-dual binary and nonbinary cyclic codes, whose minimum distances have a square-root lower bound and have a lower bound better than square-root lower bounds are constructed in [6] for the lengths of these codes being unbounded. Let q be a power of a prime number and Q = q2. In this paper, we first improve the lower bounds on the minimum distances of Euclidean and Hermitian duals of BCH codes with length (formula presented) over (formula presented) and (formula presented) over FQ in [11], [13], [31] for the designed distances in some ranges, respectively, where (formula presented). Then based on matrix-product construction and some lower bounds on the minimum distances of BCH codes and their duals, we obtain several classes of Euclidean and Hermitian self-dual codes, whose minimum distances have square-root lower bounds or a square-root-like lower bounds. Our lower bounds on the minimum distances of Euclidean and Hermitian self-dual cyclic codes improved many results in [6]. In addition, our lower bounds on the minimum distances of the duals of BCH codes are almost qs − 1 or q times that of the existing lower bounds. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Modulation of Asymmetric Magnetic Domain-Wall Motion via Noncolinear Interlayer Exchange Coupling

引用

IEEE Transactions on Magnetics 2025年第5期61卷

作者： Zhou, Xiangqing Chen, Shiwei Wu, Chuangwen Li, Peizhi Meng, Dequan Tomasello, Riccardo Finocchio, Giovanni Liang, Shiheng Hubei University Key Laboratory for Intelligent Sensing System and Security of Ministry of Education School of Physics Wuhan430062 China Politecnico di Bari Department of Electrical and Information Engineering Bari70125 Italy University of Messina Department of Mathematical and Computer Sciences Physical Sciences and Earth Sciences Messina98166 Italy

The search of scalable approach to design field-free deterministic switching is currently a key challenge. Here, we investigate current and magnetic driven magnetization switching in a T-type magnetic heterojunction with a structure composed by a hybrid synthetic antiferromagnet (SAF) Co/Ta/CoTb/Pt, where the bottom Co layer has in-plane magnetic anisotropy (IMA) and the top CoTb layer has perpendicular magnetic anisotropy (PMA). The interlayer exchange coupling (IEC) interaction allows a tilted easy axis of the perpendicular CoTb layer. The main result achieved is the field-free magnetization switching driven by spin-orbit torque (SOT) with a switching direction (clockwise or counterclockwise), which can be controlled by the in-plane direction of the Co magnetization. Meanwhile, we demonstrate that the IEC also induces the asymmetric bubble expansion in the CoTb layer in field-driven experiments and favors the propagation of the domain walls (DWs) with internal magnetization antiparallel to the in-plane IEC field. Our results demonstrate versatile control of the DW motion by noncollinear IEC, which paves a potential way for designing energy-efficient spintronic memory and logic devices, as well as provides a promising and high-efficiency approach for detecting the IEC type by magneto-optical Kerr effect (MOKE) in T-type magnetic heterojunction. © 1965-2012 IEEE.

关键词： Heterojunctions

来源：评论

学校读者我要写书评

暂无评论

Cramér-Rao Bound Minimization for a Passive Sensing Multi-ISAC system

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Chen, Jian Chen, Qikai Deng, Yansha Jia, Jie Yin, Baoxin Wang, Xingwei Northeastern University School of Computer Science and Engineering Shenyang110819 China Northeastern University Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China King's College London LondonWC2R 2LS United Kingdom

The integrated sensing and communication (ISAC) system can simultaneously provide communication and radar sensing, effectively improving spectrum utilization. However, existing research mainly focuses on the mono-static sensing ISAC system, which has shortcomings in limited sensing range and accuracy. We thus investigate a passive sensing multi-ISAC system with multiple communication users and sensing targets, and consider two cases for multi-target sensing without and with prior target knowledge at the base stations (BSs), in which the BSs are interested in estimating the targets' response matrix and channel coefficients, respectively. We also formulate a joint beamforming problem to minimize the Cramér-Rao bound (CRB) of the worst estimation constrained by communication requirements, and obtain the optimal solution with semidefinite relaxation (SDR) assisted transformation. To verify the advantages of our proposed scheme, we consider the bi-static BSs system (B-B) and beamforming with sensing interference cancellation (W-S) as two benchmark schemes. Numerical results illustrate that the proposed scheme obtains better sensing performance and effectively alleviates the effect caused by sensing interference. © 1967-2012 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：