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

26th International Conference on information and Communications security, ICICS 2024

作者： Xin, Mingfeng Wen, Hui Deng, Liting Li, Hong Li, Qiang Sun, Limin Beijing Key Laboratory of IOT Information Security Technology Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer and Information Technology Beijing Jiaotong University Beijing China

ISBN: (纸本)9789819788002

The rapid growth of the Industrial Internet of Things (IIoT) has brought real-time operating system (RTOS) into focus as major targets for both security analysts and malicious adversaries. Due to the non-standard hardware and diverse software, embedded RTOS devices present unique challenges to security analysts for the accurate analysis of firmware binaries. The diversity in hardware components and tight coupling between firmware and hardware makes it hard to perform dynamic analysis, which must have the ability to execute firmware code in virtualized environments. However, emulating the large expanse of hardware peripherals makes analysts have to frequently modify the emulator for executing various firmware code in different virtualized environments, which greatly limits the ability of analysis. In this work, we explore the problem of firmware re-hosting related to the RTOS. A device driver is developed by developers so that RTOS can be run on their platform. By providing alternative implementations for device drivers, we can make minimal modifications to the firmware that is to be migrated from its original hardware environment into a virtualized one. We show that an approach is capable of offering the ability to emulate various RTOS firmware in an automated manner without modifying existing emulators. Our approach, called static binary-level driver porting, first locates device driver initialization function and identify driver types in the target firmware, then adapts pre-built drivers to the existing emulator hardware. Finally, it replaces the drivers in the firmware with ours by utilizing binary rewriting technique. We demonstrate the practicality of the proposed method on multiple hardware platforms and firmware samples for security analysis. The results show that the approach is flexible enough to emulate firmware for vulnerability assessment and exploit development. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

引用

8th International Congress on Edge Computing, EDGE 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Tian, Yun Wu, Bin Shi, Jiaoli Zhang, Caicai Xu, Du School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China School of Modern Information Technology Zhejiang Polytechnic University of Mechanical and Electrical Engineering Hangzhou310053 China

ISBN: (纸本)9783031770685

The development of cloud computing and the widespread application of cloud services have made outsourcing services more convenient. The need for individuals and businesses to store and manipulate the graph data they generate is growing rapidly. The unreliability and insecurity of cloud servers make outsourcing graph data a great risk of information leakage. To effectively protect data security, encrypting outsourced data is a useful method. The adjacent vertex query is a very commonly used and fundamental operation, and similarity search is a widely used and powerful tool to improve the scope and functionality of queries. After outsourcing encrypted sparse graph data to cloud servers, it becomes very inconvenient to use and manipulate the data. In this work, we present a scheme to realize the adjacent vertex query supporting similarity search on sparse graph data in cloud environment (SSAQ), which also protects the security of the information. This work uses edit distance and the searchable encryption principle to construct query index, and next implement the similar adjacent vertex query on cloud server. This work provides a formal security analysis, and also gives the experimental comparison and analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： information leakage

来源：评论

学校读者我要写书评

暂无评论

EPI-Mamba: State Space Model for Semantic Segmentation from Light Fields

EPI-Mamba: State Space Model for Semantic Segmentation from ...

引用

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

作者： Li, Yan Chen, Jianan Wang, Qiong Xu, Jinshan College of Computer Science & Technology Zhejiang University of Technology Hangzhou China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China

ISBN: (纸本)9798350368741

Global contextual dependency is of significance for semantic segmentation from light fields. However, previous works mostly exploit attention mechanisms to model spatial context dependency and angular context dependency separately, since a light field capture is very data-intensive. Considering that self-attention is resource-consuming, existing methods only use it to capture spatial contextual dependency for the central view of light fields, and employ resource-efficient attention mechanisms to model angular view dependencies instead. Inspired by the recent success of State Space Sequence model (SSM), we present a novel SSM-based encoder for light field semantic segmentation, which models spatio-angular contextual dependency together. The proposed method is evaluated on the existing light field semantic segmentation datasets, and experimental results show that the proposed method significantly outperforms previous state-of-the-art methods. The code and models used in this work are available in https://***/YanWQ/EPI-Mamba. © 2025 IEEE.

关键词： Light field semantic segmentation Mamba State space model

来源：评论

学校读者我要写书评

暂无评论

A Code-Based ISE to Protect Boolean Masking in Software

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2025年第2期2025卷 293-332页

作者： Tian, Qi Cheng, Hao Guo, Chun Page, Daniel Wang, Meiqin Wang, Weijia School of Cyber Science and Technology Shandong University Qingdao China Quan Cheng Laboratory Jinan China Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Qingdao China School of Computer Science University of Bristol Bristol United Kingdom

Side-Channel Attacks (SCAs) pose a significant threat to data security in embedded environments. To counteract the power-based SCAs, masking is a widely used defense technique, that introduces randomness to obscure the side-channel information generated during the processing of secret data. However, in practice, some challenges exist when implementing masking schemes. For example, in the implementation of Boolean masking, they may refer to low noise level and implementation flaws. To address the said implementation challenges, we present an effective and efficient solution that incorporates the code-based masking technique: We mask the shares of Boolean masking with code-based masking and then use a self-designed Instruction Set Extension (ISE) to perform efficient private computations within this masked domain. Based on a 32-bit RISC-V Ibex core, we develop a prototype implementation of our ISE, whereby it mainly wraps the ALU with three code-based encoders/decoders and integrates a leakage-resilient pseudo-random generator (PRG). Compared to the base core (vanilla Ibex), the hardware overhead of the ISE implementation is only 8%. The security evaluation based on formal verification and practical evaluation demonstrates that our ISE can provide a more robust practical security guarantee. Furthermore, our approach significantly reduces the signal-to-noise ratio (SNR) of each share, decreasing it to just 2% of the original SNR on the base core. © 2025, Ruhr-University of Bochum. All rights reserved.

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

ICCG:low-cost and efficient consistency with adaptive synchronization for metadata replication

引用

Frontiers of computer Science 2025年第1期19卷 53-70页

作者： Chenhao ZHANG Liang WANG Jing SHANG Zhiwen XIAO Limin XIAO Meng HAN Bing WEI Runnan SHEN Jinquan WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyberspace Security Hainan UniversityHaikou 570228China China Mobile Information Technology Center Beijing 100033China

The rapid growth in the storage scale of wide-area distributed file systems (DFS) calls for fast and scalable metadata management. Metadata replication is the widely used technique for improving the performance and scalability of metadata management. Because of the POSIX requirement of file systems, many existing metadata management techniques utilize a costly design for the sake of metadata consistency, leading to unacceptable performance overhead. We propose a new metadata consistency maintenance method (ICCG), which includes an incremental consistency guaranteed directory tree synchronization (ICGDT) and a causal consistency guaranteed replica index synchronization (CCGRI), to ensure system performance without sacrificing metadata consistency. ICGDT uses a flexible consistency scheme based on the state of files and directories maintained through the conflict state tree to provide an incremental consistency for metadata, which satisfies both metadata consistency and performance requirements. CCGRI ensures low latency and consistent access to data by establishing a causal consistency for replica indexes through multi-version extent trees and logical time. Experimental results demonstrate the effectiveness of our methods. Compared with the strong consistency policies widely used in modern DFSes, our methods significantly improve the system performance. For example, in file creation, ICCG can improve the performance of directory tree operations by at least 36.4 times.

关键词： metadata management metadata replication consistency directory tree replica index

来源：评论

学校读者我要写书评

暂无评论

FedFLD: Heterogeneous Federated Learning via Forget-Less Distillation

FedFLD: Heterogeneous Federated Learning via Forget-Less Dis...

引用

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

作者： Yi, Xiaoyang Zhang, Jian Chen, Jing Bao, Yuru Xing, Lingkai College of Cyber Science Nankai University China College of Computer Science Nankai University China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China

ISBN: (纸本)9798350368741

Federated learning, as a distributed machine learning paradigm, enhances privacy protection but faces the challenge of heterogeneity. Data-free knowledge distillation (DFKD) methods attempt to overcome this challenge by using a generator to synthesize samples for fine-tuning a global model. However, these methods often suffer from significant shifts in output distribution, leading to catastrophic forgetting. To tackle these issues, we propose FedFLD, a novel federated forget-less distillation framework that mitigates catastrophic forgetting in DFKD while addressing the heterogeneity challenge. Specifically, FedFLD guides the generator's training from three key aspects and constrains the output distribution with an elastic weight consolidation penalty term. By synthesizing diverse samples from different perspectives through additional generator updates, FedFLD facilitates effective knowledge distillation from local models to the global model. Additionally, the global model is further optimized via the heterogeneity fine-tuning process, mitigating the bias from heterogeneity and resulting in a more expressive and robust model. © 2025 IEEE.

关键词： Catastrophic Forgetting Data-free Knowledge Distillation Federated learning Heterogeneity

来源：评论

学校读者我要写书评

暂无评论

Defending Data Inference Attacks Against Machine Learning Models by Mitigating Prediction Distinguishability

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2687-2704页

作者： Yang, Ziqi Zhu, Yiran Wan, Jie Xiang, ChuXiao Tang, Tong Wang, Yilin Xu, Ruite Wang, Lijin Zhang, Fan Xu, Jiarong Qin, Zhan Zhejiang University State Key Laboratory of Blockchain and Data Security Hangzhou310027 China Institute of Blockchain and Data Security Hangzhou310027 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China Fudan University Department of Information Management and Business Intelligence Shanghai200437 China

Neural networks are vulnerable to data inference attacks, including the membership inference attack, the model inversion attack, and the attribute inference attack. In this paper, we propose PURIFIER to defend against membership inference attacks by quantifying the differences between dataset members and non-members in three dimensions: individual shape, statistical distribution, and prediction label. PURIFIER involves transforming the confidence scores produced by the target classifier, resulting in purified confidence scores that are indistinguishable across the dimensions above. We conduct experiments on widely-used datasets and models. The results show that Purifier offers robust defense against membership inference attacks with superior efficacy compared to prior defense techniques while maintaining minimal utility degradation (e.g., less than 0.7% classification accuracy drop of most datasets). Additionally, our extended experiments explore the effectiveness of PURIFIER in defending against the model inversion attack and the attribute inference attack. © 2004-2012 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Deep anomaly detection on attributed networks by graph update

引用

Computing 2025年第6期107卷 1-25页

作者： Li, Yifan Li, Jiayin Liu, Ximeng Xu, Li College of Computer and Cyber Security Fujian Normal University Fuzhou China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China University Key Laboratory of Information Security of Network Systems Fuzhou University Fuzhou China

Anomaly detection on attributed networks has become extremely important as attributed networks are modeled in various real-world scenarios such as financial, communication, and social networks. Traditional anomaly detection methods such as degree-based or ego-network-based methods do not address well the complex interactions of attributes and structures in graph structures. Nowadays, graph autoencoder-based methods are a dominant graph anomaly detection method as the deep learning approach that better captures the complex interactions of graph data. However, the current approach ignores how to change the structure of the graph to improve the performance of graph anomaly detection leading to less than optimal anomaly detection results because there are many invalid or even obstructive edges in the original graph, which largely affect the results of graph anomaly detection. To address the above problems, we propose an applicable graph update method for graph anomaly detection, and we combine this method with that of a graph autoencoder to construct a new unsupervised graph anomaly detection framework to better utilize the updated graph structure. Specifically, we first make the anomalous nodes easier to distinguish by making similar nodes connected and removing unreasonable edges through graph updating. Then we use a graph autoencoder to reconstruct the error on the updated graph. Meanwhile the nodes with large errors we consider to be anomalous nodes. Particularly, when reconstructing the error, we reconstruct the original node attributes through the attributes of similar neighbors, which can better utilize the updated structure to improve the performance of anomaly detection. Experimental results show that our proposed framework outperforms the state-of-the-art baseline methods on all five real-world benchmark datasets.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Crop Classification Methods Based on Siamese CBMM-CNN Architectures Using Hyperspectral Remote Sensing Data 24th

Crop Classification Methods Based on Siamese CBMM-CNN Archi...

引用

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

作者： Xie, Bin Zhang, Jiahao Li, Yuling Li, Yusong Dong, Xinyu College of Computer and Cyber Security Hebei Normal University Hebei Shijiazhuang China Hebei Provincial Key Laboratory of Network and Information Security Hebei Normal University Hebei Shijiazhuang China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics and Data Security Hebei Normal University Hebei Shijiazhuang China

ISBN: (纸本)9789819615278

Amidst global population growth and escalating food demands, real-time agricultural monitoring is crucial for ensuring food security. During the initial stages of crop growth, however, it faces significant challenges in obtaining accurate ground truth data via remote sensing, thereby impeding effective crop classification. Traditional Convolutional Neural network (CNN) models, although effective in image processing and feature extraction within computer vision, are notably limited in their ability to handle the high dimensionality and complex spectral information inherent in hyperspectral non-image remote sensing data. To address this problem, we designed an enhanced CNN model, CBM-CNN. The CBM-CNN incorporates additional convolutional layers (C), batch normalization (B), and MLP(M) to convert one-dimensional data into two-dimensional data for classification, thus improving the processing efficiency of highly nonlinear data features. Building on CBM-CNN, we add multiple attention mechanisms (CBMM-CNN) to enhance feature extraction capabilities. The Siamese CBMM-CNN (SCBMM-CNN) is employed for in-depth learning of data features, with supervised learning precisely adjusting the model to improve classification performance. Experimental results on hyperspectral remote sensing datasets demonstrate that SCBMM-CNN outperforms traditional machine learning models (PCA-RF, GBDT, GMO-SVM, Random Forest, Decision Tree) and deep learning models (CNN, CNN-LSTM) in terms of accuracy, recall rate, F1 score, and kappa coefficient. These results confirm that SCBMM-CNN significantly improves crop classification accuracy and provides a novel method for early crop growth classification. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Shorter ZK-SNARKs from square span programs over ideal lattices

引用

Cybersecurity 2025年第1期8卷 208-226页

作者： Xi Lin Heyang Cao Feng‑Hao Liu Zhedong Wang Mingsheng Wang Key Laboratory of Cyberspace Security Defense Institute of Information EngineeringChinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina School of Electrical Engineering&Computer Science Washington State UniversityPullmanWAUSA School of Cyber Science and Engineering Shanghai Jiaotong UniversityShanghaiChina

Zero-knowledge succinct non-interactive arguments of knowledge(zk-SNARKs)are cryptographic protocols that ofer efcient and privacy-preserving means of verifying NP language relations and have drawn considerable atten‑tion for their appealing applications,e.g.,verifable computation and anonymous payment *** with the pre-quantum case,the practicability of this primitive in the post-quantum setting is still unsatisfactory,espe‑cially for the space *** tackle this issue,this work seeks to enhance the efciency and compactness of lat‑tice-based zk-SNARKs,including proof length and common reference string(CRS)*** this paper,we develop the framework of square span program-based SNARKs and design new zk-SNARKs over cyclotomic *** with previous works,our construction is without parallel repetition and achieves shorter proof and CRS lengths than previous lattice-based zk-SNARK ***,the proof length of our scheme is around 23.3%smaller than the recent shortest lattice-based zk-SNARKs by Ishai et al.(in:Proceedings of the 2021 ACM SIGSAC conference on computer and communications security,pp 212-234,2021),and the CRS length is 3.6×*** constructions follow the framework of Gennaro et al.(in:Proceedings of the 2018 ACM SIGSAC conference on computer and com‑munications security,pp 556-573,2018),and adapt it to the ring setting by slightly modifying the knowledge *** develop concretely small constructions by using module-switching and key-switching procedures in a novel way.

关键词： Zk-SNARKs Post-quantum Succinct argument

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：