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

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Jianghong Wei Guohua Tian Ding Wang Fuchun Guo Willy Susilo Xiaofeng Chen State Key Laboratory of Integrated Service Networks (ISN) Xidian University and State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Integrated Service Networks (ISN) Xidian University College of Cyber Science Nankai University School of Computing and Information Technology University of Wollongong

ISBN: (纸本)9781939133441

Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the security of PoS blockchains once signing keys get corrupted. That is, after an adversary obtains enough signing keys, it can break the immutable nature of PoS blockchains by forking the chain and modifying the history from some point in the past. Forward-secure multi-signature (FS-MS) schemes can overcome this issue by periodically updating signing keys. The only FS-MS construction currently available is Drijvers et al's Pixel, which builds on pairing groups and only achieves forward security at the time period *** this work, we present new FS-MS constructions that either are free from pairing or capture forward security at the individual message level (i.e., fine-grained forward security). Our first construction Pixel+ works for a maximum number of time periods T. Pixel+ signatures consist of only one group element, and can be verified using two exponentiations. It is the first FS-MS from RSA assumption, and has 3.5x and 22.8x faster signing and verification than Pixel, respectively. Our second FS-MS construction Pixel++ is a pairing-based one. It immediately revokes the signing key's capacity of re-signing the message after creating a signature on this message, rather than at the end of the current time period. Thus, it provides more practical forward security than Pixel. On the other hand, Pixel++ is almost as efficient as Pixel in terms of signing and verification. Both Pixel+ and Pixel++ allow for non-interactive aggregation of signatures from independent signers and are proven to be secure in the random oracle model. In addition, they also support the aggregation of public keys, significantly reducing the storage overhead on PoS *** demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we provid

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and systems 2025年

作者： Wang, Hongfei Wan, Caixue Jin, Hai Huazhong University of Science and Technology 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 School of Cyber Science and Engineering Wuhan430074 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

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

Personalized Medical Federated Learning Based on Mutual Knowledge Distillation in Object Heterogeneous Environment 1st

Personalized Medical Federated Learning Based on Mutual Kno...

引用

1st Conference on Blockchain and Web3.0 technology Innovation and Application, BWTAC 2024

作者： Ni, Lina Song, Chenglin Zhao, Hanmo Tang, Yuncan Ma, Yunshen Zhang, Jinquan College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9789819794119

Federated Learning (FL), hailed as a potent approach in merging medical expertise, promises to elevate collaborative efforts among healthcare institutions while safeguarding the privacy and security of sensitive medical data, thereby energizing the trajectory of intelligent healthcare advancements. However, the diversity in training objectives across medical institutions can diminish their active participation in a unified federated training process. To address this issue of waning enthusiasm due to diverse training goals, in this paper, we propose Personalized Medical Federated Learning method based on Mutual Distillation Knowledge (pFedMKD). Specifically, we propose a similarity-based mutual distillation model selection algorithm that reduces interference among medical institutions with notably diverse data distributions. Moreover, we develop a server-side local model update method leveraging mutual knowledge distillation, enabling each local model to gain beneficial insights for personalization from analogous models. Additionally, we formulate a personalized model update method utilizing knowledge distillation from specifically labeled samples, thereby improving the performance of personalized models. Experimental results demonstrate that compared to the baseline algorithm, pFedMKD can more effectively address the target heterogeneity problem among different medical institutions, enabling each institution to achieve higher personalized performance in federated learning tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Source-free Domain Adaptation with Multiple Alignment for Efficient Image Retrieval

Source-free Domain Adaptation with Multiple Alignment for Ef...

引用

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

作者： Ni, Jinghui Cui, Hui Zhao, Lihai Li, Fengling Han, Xiaohui Xu, Lijuan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center 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 Quan Cheng Laboratory China Shandong Open University China University of Technology Sydney Australia

ISBN: (纸本)9798350368741

Domain adaptation techniques help models generalize to target domains by addressing domain discrepancies between the source and target domain data distributions. These techniques are particularly valuable for cross-domain hashing retrieval, as they reduce training costs while maintaining high retrieval efficiency. However, existing unsupervised domain adaptative hashing methods often require access to both source and target domain data, which may raise privacy concerns regarding source domain data. To address these concerns, restricting access to source domain data is crucial, but this restriction also makes the alignment process between domains more challenging. In this paper, we propose a Source-free Domain Adaptive Hashing with Multiple Alignment (SFDAH-MA) approach for image retrieval. SFDAH-MA integrates model structure alignment, class moment alignment, and semantic relationship alignment to maximize inter-domain knowledge transfer. This comprehensive alignment strategy not only enhances retrieval performance across domains but also minimizes reliance on source domain data, thereby supporting data privacy protection. Extensive experiments show that SFDAH-MA achieves state-of-the-art performance in source-free settings and achieves comparable results to existing unsupervised domain adaptive hashing methods under conventional settings. The source codes of our method are available at: https://***/Nikphyc/SFDAH-MA. © 2025 IEEE.

关键词： Deep hashing image retrieval source-free domain adaptation

来源：评论

学校读者我要写书评

暂无评论

FIRE: combining multi-stage filtering with taint analysis for scalable recurring vulnerability detection 24

FIRE: combining multi-stage filtering with taint analysis fo...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Siyue Feng Yueming Wu Wenjie Xue Sikui Pan Deqing Zou Yang Liu Hai Jin 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 and School of Cyber Science and Engineering Huazhong University of Science and Technology China Nanyang Technological University Singapore 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 and School of Cyber Science and Engineering Huazhong University of Science and Technology China and Jinyinhu Laboratory China 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 and School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133441

With the continuous development of software open-sourcing, the reuse of open-source software has led to a significant increase in the occurrence of recurring vulnerabilities. These vulnerabilities often arise through the practice of copying and pasting existing vulnerabilities. Many methods have been proposed for detecting recurring vulnerabilities, but they often struggle to ensure both high efficiency and consideration of semantic information about vulnerabilities and patches. In this paper, we introduce FIRE, a scalable method for large-scale recurring vulnerability detection. It utilizes multi-stage filtering and differential taint paths to achieve precise clone vulnerability scanning at an extensive scale. In our evaluation across ten open-source software projects, FIRE demonstrates a precision of 90.0% in detecting 298 recurring vulnerabilities out of 385 ground truth instance. This surpasses the performance of existing advanced recurring vulnerability detection tools, detecting 31.4% more vulnerabilities than VUDDY and 47.0% more than MOVERY. When detecting vulnerabilities in large-scale software, FIRE outperforms MOVERY by saving about twice the time, enabling the scanning of recurring vulnerabilities on an ultra-large scale.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Federated Learning Based on Device Performance in a Heterogeneous Environment of Medical computing Devices 1st

Adaptive Federated Learning Based on Device Performance in...

引用

1st Conference on Blockchain and Web3.0 technology Innovation and Application, BWTAC 2024

作者： Zhang, Jinquan Wang, Chongbo Yang, Rendong Tang, Yuncan Ma, Yunshen Ni, Lina College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9789819794119

Federated Learning (FL), as one of the effective methods to solve the problem of medical data silos, can promote mutual cooperation among medical institutions under the premise of safeguarding the privacy and security of medical data, and effectively promote the development of intelligent medical treatment. However, the characteristics of medical data with multiple sources and heterogeneity bring certain challenges to the application of federated learning in the medical field. Due to the wide range of medical data sources, some medical institutions are unable to complete the federated learning training task on time due to the limitation of device performance, which leads to the failure of federated learning training. To address the problem of heterogeneity of computing devices among medical institutions that may cause some clients to fall behind, we propose an Adaptive Federated Learning based on Device Performance (AFedDP) method. Specifically, we design an adaptive local model training method to reduce the computational burden of medical institutions with poor equipment performance in the local model training process by adaptively constructing a local training model. Additionally, we propose a hierarchical model aggregation algorithm based on dynamic weight. This allows the heterogeneous adaptive local model to actively participate in the global model aggregation, making full use of the local data of each medical institution and improving the performance of the global model. Finally, we design an aggregation weight update algorithm based on momentum optimization to enhance the stability of global model aggregation. This algorithm updates contribution and aggregation weight with the idea of momentum optimization. Simulation experiments demonstrate that AFedDP achieves higher accuracy compared to the baseline algorithm. AFedDP can better address the issue of some devices being unable to participate in federated training properly. © The Author(s), under exclusive lic

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Federated Meta Continual Learning for Efficient and Autonomous Edge Inference 24th

Federated Meta Continual Learning for Efficient and Autono...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Li, Bingze Ho, Stella Qu, Youyang Xu, Chenhao Luan, Tom H. Gao, Longxiang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Biomedical Engineering The University of Melbourne VIC Melbourne Australia School of Information Technology Deakin University VIC Geelong Australia School of Cyber Engineering Xidian University Xi’an China

ISBN: (纸本)9789819615476

With an increasing volume of data being collected and processed on edge, Federated Learning (FL) has become a dominant approach to train shared global models on distributed data held by diverse edge clients without exposing privacy. However, with expectations of high-quality user experience, instantaneous intelligent decisions must be made at the network edge to meet performance, security, and latency requirements. Intuitively, this challenge becomes more daunting as edge devices are constrained by limited computing and storage resources. Furthermore, edge clients need to continuously acquire, update, accumulate, and apply knowledge in domains requiring the processing of sensitive data and long-term model training. It has been proven that edge clients often forget previous tasks knowledge after learning new tasks, resulting in catastrophic forgetting. To mitigate this, we propose a Federated Meta Continual Learning (FMCL) approach. It requires edge clients not only to learn new tasks quickly but also to memorize rapidly. Specifically, we adopted a MAML (Model-Agnostic Meta-Learning) framework with memory replay, setting up buffers at edge clients to consolidate old tasks. In such a way, the model learns optimal initialization to quickly adapt to all seen tasks while preventing catastrophic forgetting. Extensive evaluation results indicate that FMCL performs well in alleviating catastrophic forgetting and achieves a good balance between learning new tasks and remembering existing tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Cooperation Multi-Agent Reinforcement Learning for Intelligent Traffic Signal Control

引用

IEEE Internet of Things Journal 2025年第10期12卷 14362-14374页

作者： Shang, Jing Meng, Shunmei Hou, Jun Zhao, Xiaoran Zhou, Xiaokang Jiang, Rong Qi, Lianyong Li, Qianmu Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210049 China Nanjing Vocational University of Industry Technology School of Social Science Nanjing210046 China Qufu Normal University School of Computer Science Qufu273165 China Kansai University Faculty of Business and Data Science Osaka Prefecture 564-8680 Japan Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650399 China College of Computer Science and Technology Qingdao266580 China

In the trend of continuously advancing urban intelligent transport construction, traditional traffic signal control (TSC) struggles to make effective decisions with complex traffic conditions. Although multi-agent deep reinforcement learning (MARL) shows promise in optimizing traffic flow, most existing studies ignore the complex relationships between signal lights and fail to communicate with neighbors effectively. Moreover, the deterministic strategies generated by Q-learning-based methods struggle to be extended to large-scale urban road networks. Therefore, this paper proposes a multi-agent graph-based soft actor-critic (MAGSAC) approach for TSC, which combines graph neural networks with the Soft Actor-Critic (SAC) algorithm and extends it to multi-agent environments to address the TSC problem. Specifically, we employ graph-based networks and attention mechanism to expand the receptive domain of agents, enable environmental information to be shared among agents, and utilize the attention mechanism to filter out unimportant information. The algorithm adheres to the Centralized Training Decentralized Execution (CTDE) paradigm to minimize the non-stationarity of MARL. Finally, a rigorous experimental evaluation was conducted using the CityFlow simulator on both synthetic traffic grids and real-world urban road networks. Experimental results show that MAGSAC outperforms other TSC methods in performance metrics, including average queue length and waiting time, and achieves excellent performance under complex urban traffic conditions. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Model-Agnostic Hierarchical Framework Towards Trajectory Prediction

引用

Journal of Computer Science and technology 2025年第2期40卷 322-339页

作者： Qian, Tang-Wen Wang, Yuan Xu, Yong-Jun Zhang, Zhao Wu, Lin Qiu, Qiang Wang, Fei Domain-Oriented Intelligent System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100190 China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Predicting the future trajectories of multiple agents is essential for various applications in real life, such as surveillance systems, autonomous driving, and social robots. The trajectory prediction task is influenced by many factors, including the individual historical trajectory, interactions between agents, and the fuzzy nature of the observed agents’ motion. While existing methods have made great progress on the topic of trajectory prediction, they treat all the information uniformly, which limits the effectiveness of information utilization. To this end, in this paper, we propose and utilize a model-agnostic framework to regard all the information in a two-level hierarchical view. Particularly, the first-level view is the inter-trajectory view. In this level, we observe that the difficulty in predicting different trajectory samples varies. We define trajectory difficulty and train the proposed framework in an "easy-to-hard" schema. The second-level view is the intra-trajectory level. We find the influencing factors for a particular trajectory can be divided into two parts. The first part is global features, which keep stable within a trajectory, i.e., the expected destination. The second part is local features, which change over time, i.e., the current position. We believe that the two types of information should be handled in different ways. The hierarchical view is beneficial to take full advantage of the information in a fine-grained way. Experimental results validate the effectiveness of the proposed model-agnostic framework. © Institute of computing technology, Chinese Academy of Sciences 2025.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Towards Robust Video Anomaly Detection in 6G Networks: A Scene-Adaptive Framework

引用

IEEE Network 2025年

作者： Zhang, Sijia Yu, Yong Tao, Xiaoling Wang, Lianhai Shaanxi Normal University School of Computer Science China Guilin University of Electronic Technology Guangxi Cooperative Innovation Center of Cloud Computing and Big Data China Qilu University of Technology Shandong Academy of Sciences Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing China

With the rapid advancement of 5th Generation (5G) networks, their low latency and high bandwidth facilitate the development of smart city systems. Among the smart city systems, anomaly detection in surveillance videos has been an essential part due to its importance to public safety and security. With the transition to 6G technology, the practical applications of video anomaly detection are expanding to encompass a variety of scenarios, such as sidewalks, shopping malls and campuses, which exhibit significant differences. However, most existing anomaly detection methods deployed in the cloud typically rely on the fixed datasets for training and apply the trained uniform model to the edge services across different scenarios. The distinct environmental conditions may lead to varying performance of a uniform anomaly detection model. To alleviate these issues, we propose a scene-adaptive video anomaly detection framework in 6G-based applications. The proposed framework leverages the advantages of 6G networks to facilitate localized processing and rapid adaptation to diverse environments. To enable the anomaly detection model to adapt more robustly to local environments, the proposed framework integrates a pre-trained model and simulates anomalies to train the anomaly detection model in a denoising manner. By integrating pre-trained teacher models with edge computing nodes, the proposed method facilitates accurate anomaly detection while maintaining robust performance across varying scenarios. The framework utilizes both original data and simulated anomalous data to fine-tune the edge model, ensuring it aligns with the unique characteristics of each environment. Experimental results demonstrate the effectiveness of the proposed method across different scenarios, enabling smarter and more responsive surveillance systems in the 6G era. © 2025 IEEE.

关键词： Video analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：