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

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

来源：评论

学校读者我要写书评

暂无评论

Map2Schedule: An End-to-End Link Scheduling Method for Urban V2V Communications

arXiv

引用

arXiv 2023年

作者： Zhang, Lihao Sun, Haijian Sun, Jin Parasuraman, Ramviyas Ye, Yinghui Hu, Rose Qingyang The School of Electrical and Computer Engineering University of Georgia AthensGA United States The School of Computing University of Georgia AthensGA United States Shanxi Key Laboratory of Information Communication Network and Security Xi’an University of Posts & Telecommunications China The Electrical and Computer Engineering Department Utah State University LoganUT United States

Urban vehicle-to-vehicle (V2V) link scheduling with shared spectrum is a challenging problem. Its main goal is to find the scheduling policy that can maximize system performance (usually the sum capacity of each link or their energy efficiency). Given that each link can experience interference from all other active links, the scheduling becomes a combinatorial integer programming problem and generally does not scale well with the number of V2V pairs. Moreover, link scheduling requires accurate channel state information (CSI), which is very difficult to estimate with good accuracy under high vehicle mobility. In this paper, we propose an end-to-end urban V2V link scheduling method called Map2Schedule, which can directly generate V2V scheduling policy from the city map and vehicle locations. Map2Schedule delivers comparable performance to the physical-model-based methods in urban settings while maintaining low computation complexity. This enhanced performance is achieved by machine learning (ML) technologies. Specifically, we first deploy the convolutional neural network (CNN) model to estimate the CSI from street layout and vehicle locations and then apply the graph embedding model for optimal scheduling policy. The results show that the proposed method can achieve high accuracy with much lower overhead and latency. © 2023, CC BY.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

BERT-based Sentiment Analysis of Chinese Online Social Movements 27

BERT-based Sentiment Analysis of Chinese Online Social Movem...

引用

27th International Conference on Automation and computing, ICAC 2022

作者： Li, Hao Ding, Yulong Jiang, Jie Deng, Peng Yuan, Diping Yang, Shuang-Hua Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen China Southern University of Science and Technology Shenzhen Key Laboratory of Future Industrial Internet Safety and Security Shenzhen China Southern University of Science and Technology Academy for Advanced Interdisciplinary Studies Shenzhen China Shenzhen Urban Public Safety and Technology Institute Shenzhen China Ministry of Emergency Management Key Laboratory of Urban Safety Risk Monitoring and Early Warning Shenzhen China

ISBN: (数字)9781665498074

ISBN: (纸本)9781665498074

Online social movements are a group of netizens with the same or similar purpose, spontaneously discussing and disseminating certain information, trying to attract more people to participate, and creating a public opinion on the internet or even a social atmosphere of anxiety. Online social movements analysis can reveal the evolution of sentiment during the movements and therefore prevent the relevant social disasters from happening. The literature shows the lack of public sentiment analysis text datasets and effective analysis methods for Chinese online social movements. In this paper, we classify sentiment into four categories: positive, anger, anxiety, and weak negative. We believe anger and anxiety are the two most important sentiments in forming an online social movement. Afterwards, we first time create a public sentiment analysis dataset about Chinese online social movements, and then propose a bidirectional encoder representation from transformers (BERT)-based model to classify the sentiment. Moreover, we use the focal loss in the BERT model rather than cross entropy loss to enhance the contribution of minority classes to the total loss to address the imbalance issue in the dataset. The proposed BERT-based model is compared with six baseline methods. The results show that our method outperforms those baseline models by achieving higher macroF1 scores. © 2022 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient Graph Neural Network Driven Recurrent Reinforcement Learning for GNSS Position Correction 36

Efficient Graph Neural Network Driven Recurrent Reinforcemen...

引用

36th International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS+ 2023

作者： Zhao, Haoli Tang, Jianhao Li, Zhenni Wu, Zhuoyu Xie, Shengli Wu, Zhaofeng Liu, Ming Kumara, Banage T.G.S. School of Automation Guangdong University of Technology Guangzhou510006 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou510006 China Key Laboratory of Intelligent Detection and The Internet of Things in Manufacturing Guangzhou510006 China Guangdong Key Laboratory of IoT Information Technology Guangzhou510006 China Techtotop Microelectronics Technology Co. Ltd. Guangzhou510000 China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Department of Computing and Information Systems Sabaragamuwa University of Sri Lanka Belihuloya Sri Lanka

ISBN: (纸本)9780936406350

With the wide applications of the Global Navigation Satellite System (GNSS) in autonomous driving scenarios, the demand for high-precision positioning of navigation systems has increased dramatically in complex multipath environments. Conventional model-based methods are constrained by strict assumptions about noise models and can hardly model complex environment errors. In contrast, approaches based on artificial intelligent learning have become an important direction to solving the problem of high-precision positioning because learning-based approaches only require simple assumptions. However, current learning-based approaches are facing the following issues. The existing Graph Neural Network-based (GNN) method could hardly adapt to dynamically changing driving environment scenarios since it considers positioning discretely. On the other hand, existing Reinforcement Learning-based (RL) approaches ignore the relationship between multi-constellation satellites, resulting in an inadequate description of the driving correction environment observations. In this paper, we construct a GNN-driven recurrent reinforcement learning method to consider the GNSS measurement of multi-constellation satellites and to learn real-time correction strategy in the dynamic driving environment. To establish a comprehensive positioning correction environment, we construct a multi-constellation graph observation, based on the feature vector concerning GNSS measurement of multi-constellation satellites and edges for satellites in and between constellations. To make more effective use of GNSS measurements, we employ the graph embedding module to deal with the multi-constellation graph inputs, to extract hidden topological features to form the brief states about relationships between multi-constellation satellites for the RL environment. Finally, we construct a recurrent actor-critic structured RL model with cumulative reward and continuous action space to exploit historical information and a

关键词：

来源：评论

学校读者我要写书评

暂无评论

How Hard is Takeover in DPoS Blockchains? Understanding the security of Coin-based Voting Governance

arXiv

引用

arXiv 2023年

作者： Li, Chao Palanisamy, Balaji Xu, Runhua Duan, Li Liu, Jiqiang Wang, Wei Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing China Department of Informatics and Networked Systems School of Computing and Information University of Pittsburgh Pittsburgh United States School of Computer Science and Engineering Beihang University Beijing China

Delegated-Proof-of-Stake (DPoS) blockchains, such as EOSIO, Steem and TRON, are governed by a committee of block producers elected via a coin-based voting system. We recently witnessed the first de facto blockchain takeover that happened between Steem and TRON. Within one hour of this incident, TRON founder took over the entire Steem committee, forcing the original Steem community to leave the blockchain that they maintained for years. This is a historical event in the evolution of blockchains and Web 3.0. Despite its significant disruptive impact, little is known about how vulnerable DPoS blockchains are in general to takeovers and the ways in which we can improve their resistance to takeovers. In this paper, we demonstrate that the resistance of a DPoS blockchain to takeovers is governed by both the theoretical design and the actual use of its underlying coin-based voting governance system. When voters actively cooperate to resist potential takeovers, our theoretical analysis reveals that the current active resistance of DPoS blockchains is far below the theoretical upper bound. However in practice, voter preferences could be significantly different. This paper presents the first large-scale empirical study of the passive takeover resistance of EOSIO, Steem and TRON. Our study identifies the diversity in voter preferences and characterizes the impact of this diversity on takeover resistance. Through both theoretical and empirical analyses, our study provides novel insights into the security of coin-based voting governance and suggests potential ways to improve the takeover resistance of any blockchain that implements this governance model. © 2023, CC BY-NC-ND.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Protecting Personalized Trajectory with Differential Privacy under Temporal Correlations

arXiv

引用

arXiv 2024年

作者： Cao, Mingge Zhu, Haopeng Min, Minghui Li, Yulu Li, Shiyin Zhang, Hongliang Han, Zhu School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of CyberScience and Engineering Wuhan University Wuhan430072 China School of Electronics Peking University Beijing100871 China Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States

Location-based services (LBSs) in vehicular ad hoc networks (VANETs) offer users numerous conveniences. However, the extensive use of LBSs raises concerns about the privacy of users’ trajectories, as adversaries can exploit temporal correlations between different locations to extract personal information. Additionally, users have varying privacy requirements depending on the time and location. To address these issues, this paper proposes a personalized trajectory privacy protection mechanism (PTPPM). This mechanism first uses the temporal correlation between trajectory locations to determine the possible location set for each time instant. We identify a protection location set (PLS) for each location by employing the Hilbert curve-based minimum distance search algorithm. This approach incorporates the complementary features of geo-indistinguishability and distortion privacy. We put forth a novel Permute-and-Flip mechanism for location perturbation, which maps its initial application in data publishing privacy protection to a location perturbation mechanism. This mechanism generates fake locations with smaller perturbation distances while improving the balance between privacy and quality of service (QoS). Simulation results show that our mechanism outperforms the benchmark by providing enhanced privacy protection while meeting user’s QoS requirements. Copyright © 2024, The Authors. All rights reserved.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

arXiv

引用

arXiv 2023年

作者： Li, Zhen Zhang, Ruqian Zou, Deqing Wang, Ning Li, Yating Xu, Shouhuai Chen, Chen Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Colorado Colorado Springs United States Center for Research in Computer Vision University of Central Florida United States School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier;the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing Multi-DNN Inference on Mobile Devices through Heterogeneous Processor Co-Execution

arXiv

引用

arXiv 2025年

作者： Gao, Yunquan Zhang, Zhiguo Donta, Praveen Kumar Dehury, Chinmaya Kumar Wang, Xiujun Niyato, Dusit Zhang, Qiyang School of Computer Science and Technology Anhui Engineering Research Center for Intelligent Applications and Security of Industrial Internet Anhui University of Technology Anhui Ma’anshan243032 China Computer Science and Technology Anhui University of Technology Anhui Ma’anshan243032 China Department of Computer and Systems Sciences Stockholm University Stockholm106 91 Sweden Institute of Computer Science University of Tartu IISER Berhampur India College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Computer Science School Peking University Beijing100876 China

Deep Neural Networks (DNNs) are increasingly deployed across diverse industries, driving a growing demand to enable their capabilities on mobile devices. However, existing mobile inference frameworks are often rely on a single processor to handle each model’s inference, limiting hardware utilization and leading to suboptimal performance and energy efficiency. Expanding DNNs accessibility on mobile platforms requires more adaptive and resource-efficient solutions to meet increasing computational demands without compromising device functionality. Nevertheless, parallel inference of multiple DNNs on heterogeneous processors remains a significant challenge. Several works have explored partitioning DNN operations into subgraphs to enable parallel execution across heterogeneous processors. However, these approaches typically generate excessive subgraphs based solely on hardware compatibility, increasing scheduling complexity and memory management overhead. To address these limitations, we propose an Advanced Multi-DNN Model Scheduling (ADMS) strategy that optimizes multi-DNN inference across heterogeneous processors on mobile devices. ADMS constructs an optimal subgraph partitioning strategy offline, considering both hardware support of operations and scheduling granularity, while employing a processor-state-aware scheduling algorithm that dynamically balances workloads based on real-time operational conditions. This ensures efficient workload distribution and maximizes the utilization of available processors. Experimental results show that, compared to vanilla inference frameworks, ADMS reduced multi-DNN inference latency by 4.04×.MSC Codes 68T07, 68W40 Copyright © 2025, The Authors. All rights reserved.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

HD-Bind: Encoding of Molecular Structure with Low Precision, Hyperdimensional Binary Representations

arXiv

引用

arXiv 2023年

作者： Jones, Derek Allen, Jonathan E. Zhang, Xiaohua Khaleghi, Behnam Kang, Jaeyoung Xu, Weihong Moshiri, Niema Rosing, Tajana S. Department of Computer Science and Engineering University of California La Jolla San DiegoCA United States Global Security Computing Applications Division Lawrence Livermore National Laboratory LivermoreCA United States Biosciences and Biotechnology Division Lawrence Livermore National Laboratory LivermoreCA United States

Purpose: Publicly available collections of drug-like molecules have grown to comprise 10s of billions of possibilities in recent history due to advances in chemical synthesis (i.e. combinatorial chemistry). Traditional methods for identifying "hit" molecules from a large collection of potential drug-like candidates have relied on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug to its protein target. A major drawback of the approaches are that they require exceptional computing capabilities to consider for even relatively small collections of molecules. Methods: Hyperdimensional computing (HDC) is a recently proposed learning paradigm that is able to leverage low-precision binary vector arithmetic to build effecient representations of the data that can be obtained without the need for gradient-based optimization approaches that are required in many conventional machine learning and deep learning approaches. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated for a range of application areas. We consider existing HDC approaches for molecular property classification and introduce two novel encoding algorithms that leverage the extended connectivity fingerprint (ECFP) algorithm. Results: We show that HDC-based inference methods are as much as 90 × more efficient than more complex representative machine learning methods, and achieve an acceleration of nearly 9 orders of magnitude as compared to inference with molecular docking. We also show that HDC-methods implemented in a variety of tools can match competitive performance in terms of training with respect to simple baseline ML models while retaining competitive predictive performance on a number of tasks ranging from well-studied benchmarks such as MoleculeNet molecular property prediction tasks as well as the DUD-E and LIT-PCBA bind/no-bind activity classification datasets. Conclusions: We demonstrate mu

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Training of Spiking Neural Network joint Curriculum Learning Strategy

arXiv

引用

arXiv 2023年

作者： Tang, Lingling Chu, Jielei Gong, Zhiguo Li, Tianrui The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

Starting with small and simple concepts, and gradually introducing complex and difficult concepts is the natural process of human learning. Spiking Neural Networks (SNNs) aim to mimic the way humans process information, but current SNNs models treat all samples equally, which does not align with the principles of human learning and overlooks the biological plausibility of SNNs. To address this, we propose a CL-SNN model that introduces Curriculum Learning(CL) into SNNs, making SNNs learn more like humans and providing higher biological interpretability. CL is a training strategy that advocates presenting easier data to models before gradually introducing more challenging data, mimicking the human learning process. We use a confidence-aware loss to measure and process the samples with different difficulty levels. By learning the confidence of different samples, the model reduces the contribution of difficult samples to parameter optimization automatically. We conducted experiments on static image datasets MNIST, Fashion-MNIST, CIFAR10, and neuromorphic datasets N-MNIST, CIFAR10-DVS, DVS-Gesture. The results are promising. To our best knowledge, this is the first proposal to enhance the biologically plausibility of SNNs by introducing CL. Copyright © 2023, The Authors. All rights reserved.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：