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

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

来源：评论

学校读者我要写书评

暂无评论

High-Performance Implementation Architecture for Additive Homomorphic Encryption Algorithms on FPGA

High-Performance Implementation Architecture for Additive Ho...

引用

IEEE International Conference on Big data security on Cloud (Bigdatasecurity), High Performance and Smart Computing (HPSC) and Intelligent data and security (IDS)

作者： Yuxuan Zhang Hua Guo Chen Junxin Chen Wenmao Liu School of Cyber Science and Technology Beihang University BeiJing China Key Laboratory of Data and Intelligent System Security Ministry of Education Tianjin China NSFOCUS Technologies Group Co. Ltd. BeiJing China

ISBN: (数字)9798331595104

ISBN: (纸本)9798331595111

Additive homomorphic encryption is one of the key technologies for ensure data privacy in federated learning. To accelerate these algorithms, several studies have deployed homomorphic encryption algorithms on parallel platforms, such as FPGAs. Although many works have demonstrated good acceleration effects, an efficient and generalizable implementation architecture remains lacking. In this paper, we propose an efficient FPGA implementation architecture compatible with various partially homomorphic encryption algorithms. First, an efficient modular multiplier which supports dynamic modulus length is designed. We introduce the redundant number system and design an iteration cycle control module to reduce computing cost and to fit the modulus with different length, respectively. Secondly, a high-performance FPGA implementation architecture compatible with multiple additive homomorphic encryption algorithms is proposed. Based on the processes of algorithms, we propose a customized multifunctional multiplier and a top-level control module to realize a full reuse without any performance loss. According to implementation results on Kintex UltraScale XCKU060, the encrypt speed of Paillier and OU achieves 473.79 OP/s and 88.96 OP/s under 128-bit security, respectively. Compared with existing similar works, our architecture achieves 8.4 × speedup, demonstrating its performance and functional advantages.

关键词： data privacy Additives Federated learning Heuristic algorithms Process control Computer architecture Hardware Cryptography Homomorphic encryption Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Local Differential Privacy is Not Enough: A Sample Reconstruction Attack against Federated Learning with Local Differential Privacy

arXiv

引用

arXiv 2025年

作者： You, Zhichao Dong, Xuewen Li, Shujun Liu, Ximeng Ma, Siqi Shen, Yulong School of Computer Science & Technology Xidian University China Shaanxi Key Laboratory of Network and System Security Xi’an China University of Kent Canterbury United Kingdom College of Computer and Data Science Fuzhou University Fuzhou China School of System and Computing University of New South Wales CanberraACT2612 Australia

Reconstruction attacks against federated learning (FL) aim to reconstruct users’ samples through users’ uploaded gradients. Local differential privacy (LDP) is regarded as an effective defense against various attacks, including sample reconstruction in FL, where gradients are clipped and perturbed. Existing attacks are ineffective in FL with LDP since clipped and perturbed gradients obliterate most sample information for reconstruction. Besides, existing attacks embed additional sample information into gradients to improve the attack effect and cause gradient expansion, leading to a more severe gradient clipping in FL with LDP. In this paper, we propose a sample reconstruction attack against LDP-based FL with any target models to reconstruct victims’ sensitive samples to illustrate that FL with LDP is not flawless. Considering gradient expansion in reconstruction attacks and noise in LDP, the core of the proposed attack is gradient compression and reconstructed sample denoising. For gradient compression, an inference structure based on sample characteristics is presented to reduce redundant gradients against LDP. For reconstructed sample denoising, we artificially introduce zero gradients to observe noise distribution and scale confidence interval to filter the noise. Theoretical proof guarantees the effectiveness of the proposed attack. Evaluations show that the proposed attack is the only attack that reconstructs victims’ training samples in LDP-based FL and has little impact on the target model’s accuracy. We conclude that LDP-based FL needs further improvements to defend against sample reconstruction attacks effectively. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal GNN-Based Cell-Free Massive MIMO Network with Maximal Benefit-Cost Ratio

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Jiang, Jing Li, Yanni Ye, Yinghui Feng, Dan Zhang, Jiayi Sutthiphan, Worakrin Niyato, Dusit Xi'an Uni versity of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security Xi'an710121 China Beijing Jiaotong University Frontiers Science Center for Smart High-Speed Railway System Beijing100044 China National Telecommunication Public Company Mobile System Development Department Bangkok10210 Thailand Nanyang Technological University College of Computing and Data Science Singapore

Due to the network's rapid expansion, mobile networks bear extra high deployment costs. Being a key enabler of 6th generation (6G) mobile networks, it is crucial that cell-free massive MIMO (CF mMIMO) networks achieve green and cost-effective development. In this correspondence, we propose spatio-temporal graph neural networks (STGNN)-based CF mMIMO networks with a maximal benefit-cost ratio. First, we formulate a new coverage cost metric named benefit-cost ratio (BCR), which can evaluate the deployment cost while fulfilling various traffic requirements. Next, CF mMIMO networks are modeled as a spatio-temporal graph to utilize STGNN to extract the spatial-temporal properties of traffic demands. Finally, STGNN optimizes the number and location of access points (APs) based on the maximal BCR criterion so that the CF mMIMO networks can achieve on-demand service capability with minimum deployment cost. Numerical results demonstrate that the proposed algorithm can significantly reduce the deployment cost while providing on-demand and high-quality mobile service. © 1967-2012 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Cross-Frequency Collaborative Training Network and dataset for Semi-supervised First Molar Root Canal Segmentation

arXiv

引用

arXiv 2025年

作者： Zhou, Zhenhuan Zhang, Yuchen He, Along Wang, Peng Xie, Xueshuo Li, Tao College of Computer Science Nankai University Tianjin300350 China Key Laboratory of Data and Intelligent System Security Ministry of Education China Department of stomatology Tianjin Union Medical Center Tianjin China Haihe Lab of ITAI Tianjin300459 China

Root canal (RC) treatment is a highly delicate and technically complex procedure in clinical practice, heavily influenced by the clinicians’ experience and subjective judgment. Deep learning has made significant advancements in the field of computer-aided diagnosis (CAD) because it can provide more objective and accurate diagnostic results. However, its application in RC treatment is still relatively rare, mainly due to the lack of public datasets in this field. To address this issue, in this paper, we established a First Molar Root Canal segmentation dataset called FMRC-2025. Additionally, to alleviate the workload of manual annotation for dentists and fully leverage the unlabeled data, we designed a Cross-Frequency Collaborative training semi-supervised learning (SSL) Network called CFC-Net. It consists of two components: (1) Cross-Frequency Collaborative Mean Teacher (CFC-MT), which introduces two specialized students (SS) and one comprehensive teacher (CT) for collaborative multi-frequency training. The CT and SS are trained on different frequency components while fully integrating multi-frequency knowledge through cross and full frequency consistency supervisions. (2) Uncertainty-guided Cross-Frequency Mix (UCF-Mix) mechanism enables the network to generate high-confidence pseudo-labels while learning to integrate multi-frequency information and maintaining the structural integrity of the targets. Extensive experiments on FMRC-2025 and three public dental datasets demonstrate that CFC-MT is effective for RC segmentation and can also exhibit strong generalizability on other dental segmentation tasks, outperforming state-of-the-art SSL medical image segmentation methods. Codes and dataset will be released. © 2025, CC BY-NC-ND.

关键词： Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

An Image Semantic Communication system Based on GAN and Relative Position-Encoding

引用

IEEE Communications Letters 2025年

作者： Zhang, Ziqi Tan, Weijie Li, Chunguo Guizhou University College of Big Data and Information Engineering Guiyang550025 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Ministry of Industry and Information Technology Laboratory of Cryptography Application Technology Innovation and Testing Verification Beijing100015 China Southeast University School of Information Science and Engineering Nanjing210096 China

In image semantic communication, the complex wireless channel environment leads to the loss of image details and performance degradation during transmission. To address this issue, we propose an image semantic communication system based on Generative Adversarial Networks (GAN) and Relative Position-Encoding (RPE), named GAN-RpeSC. Specifically, in the system design, we introduce the GAN network at the output of the semantic communication framework to enhance the image restoration. We integrate the RPE module into the Visual Transformer (ViT) module, adding the RPE module to its Multihead Self Attention (MHSA), so that the model can better capture the spatial location information of the image. Experimental results show that the proposed GAN-RpeSC has significant advantages in improving image transmission quality, with a 0.3 dB improvement in peak signal-to-noise ratio (PSNR) compared to the ViT module alone. © 1997-2012 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Multimodal Dialogue Emotion Recognition Based on Label Optimization and Coarse-Grained Assisted Fine-Grained

Multimodal Dialogue Emotion Recognition Based on Label Optim...

引用

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

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu 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) China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal dialogue emotion recognition integrates data from multiple modalities to accurately identify emotional states in conversations. However, differences in expression and information density across modalities complicate the fusion of features. Traditional methods may introduce redundant information from other utterances, reducing the accuracy of emotion recognition. Existing one-hot labels often fail to capture the full range of emotional expressions, leading to biased results. To address these issues, we propose a model that fuses different modalities within the same utterance to avoid redundancy. It employs a progressive classification process, refining emotion recognition from coarse to fine granularity. Additionally, we use emotion polarity probabilities as weights for fine-grained classification and introduce a multimodal information-rich label that considers both the data and their interactions. Experiments on IEMOCAP and MELD datasets demonstrate the model’s effectiveness, significantly improving dialog emotion recognition accuracy. Our code is available at https://***/r/LOCG-188E.

关键词： Emotion recognition Accuracy Fuses Refining Termination of employment Speech recognition Signal processing Speech processing Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Authenticated Key-Management Mechanism for e-Healthcare Environment

引用

IEEE Internet of Things Journal 2025年

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Ghaffar, Zahid Xie, Yong Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Douliu64002 Taiwan Qinghai Institute of Technology School of Computer and Information Science China Qinghai Provincial Laboratory for Intelligent Computing and Application China Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan250353 China

The Internet of Things (IoT) is rapidly permeating all aspects of human life, involving a network of devices that share sensitive data. A notable application is the e-healthcare systems, which employ connected sensors, medical servers, and wearable devices. However, the public nature of communication in e-healthcare systems poses challenges such as security, privacy, and authentication of participating entities. Recently, many authentication protocols have been introduced to address these challenges. However, most of these protocols remain vulnerable to various security attacks, including device or medical server impersonation, denial of service, physical or cloning, and de-synchronization attacks. Therefore, we introduce an authenticated key-management protocol utilizing hash functions and Cipher-Block Chaining-Advanced Encryption Standard encryption (CBC-AES) encryption. The proposed protocol also employs the Physical Unclonable Function (PUF), which makes it more robust and efficient in resisting physical or cloning attacks. Additionally, the proposed scheme resists various security threats, including impersonation, session key leakage, ephemeral secret leakage, and de-synchronization attacks. We analyze the scheme’s security and reliability through formal and informal analysis. The informal analysis demonstrates that the scheme encompasses crucial security features, while the formal analysis substantiates. Moreover, performance analysis of the proposed protocol with various competing results indicates that our protocol achieves an average reduction in communication and computation overheads by 36.03.% and 41.79%, respectively. © 2014 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

A Robust Key Exchange and Tamper-Resistant Protocol for HAN and NAN Networks in Smart Grids

引用

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart Grids (SG) rely on Home Area Networks (HAN) and Neighborhood Area Networks (NAN) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the Physical Unclonable Function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol's resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol's effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol's enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：