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

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

作者： Yang, Ke Yuan, Shuguang Yu, Jing Wang, Yuyang Yang, Tengfei Chen, Chi Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Cyberspace Security Defense Beijing China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing China

ISBN: (纸本)9789819788002

A relational database is an infrastructure that manages and shares structured data. To safeguard the copyrights of data within such databases, database watermarking is an effective technique. Most watermarking schemes rely on the primary key (PK) to locate and embed watermarks, which preserves high watermark synchronization during detection. However, these schemes become invalid once PK is erased or changed. To avoid this vulnerability, virtual primary key (VPK) schemes are proposed to replace PK. Nevertheless, duplicate values in virtual primary keys compromise synchronization. Besides, current VPK schemes fail to utilize the primary key, even when it remains unchanged. This strategy decreases detection accuracy in many cases. In addition, we find an attribute name attack. It is a common challenge of existing watermarking schemes, which distort the link between detected attributes and watermarked attributes. In this paper, we propose a high-synchronization and robust VPK scheme. It introduces a classifier to maintain the original order and number of attributes to resist attribute name attacks. To resist primary key erasure or change and mitigate synchronization problems, it generates distinct virtual primary keys. Moreover, to improve detection accuracy, our watermarking scheme integrates the primary key when it remains unchanged. Experiments demonstrate that our scheme achieves high watermark synchronization. It is robust against various attacks, even when 98% of tuples or over half of the attributes are distorted. It is also practical in terms of data distortion and overhead. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Relational databases Virtual primary key Watermarking

来源：评论

学校读者我要写书评

暂无评论

HybridFL: Hybrid Approach Toward Privacy-Preserving Federated Learning 6th

HybridFL: Hybrid Approach Toward Privacy-Preserving Federate...

引用

6th International Conference on Security and Privacy in New Computing Environments, SPNCE 2023

作者： Ali, Sheraz Mamoon, Saqib Usman, Areeba Abidin, Zain ul Zhao, Chuan School of Information Science and Engineering University of Jinan Jinan250022 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China University of Sargodha Sargodha Pakistan Shandong Provincial Key Laboratory of Network-Based Intelligent Computing University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Software Engineering University of Jinan Jinan250022 China

ISBN: (纸本)9783031736988

In this study, we introduce a novel Hybrid Federated Learning (HybridFL) approach aimed at enhancing privacy and accuracy in collaborative machine learning scenarios. Our methodology integrates Differential Privacy (DP) and secret sharing techniques to address inference risks during training and protect against information leakage in the output model. Drawing inspiration from recent advances, we present a HybridFL framework that combines the strengths of Homomorphic Encryption (HE) and Multi-Party Computation (MPC) to achieve secure computation without the computational overhead of pure HE methods. Our contributions include a privacy-preserving design for Federated Learning (FL) that ensures local data privacy through secret sharing while leveraging DP mechanisms for noise addition. The system offers resilience against unreliable participants and is evaluated using various machine learning models, including Convolutional Neural networks (CNN), Multi-Layer Perceptrons (MLP), and linear regression. Furthermore, we address potential external threats by deploying predictive model outputs as robust services against inference attacks. Experimental results demonstrate improved accuracy and convergence speed, establishing the viability of HybridFL as an effective solution for collaborative machine learning with enhanced privacy guarantees. © ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Rapid Maize Seedling Detection Based on Receptive-Field and Cross-Dimensional information Interaction

Rapid Maize Seedling Detection Based on Receptive-Field and ...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Hao, Fengqi Zhu, Shulei Ma, Dexin Dong, Xiangjun Kong, Hoiio Liu, Xia Mu, Chunhua Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China City University of Macau Faculty of Data Science 999078 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China Communication College Qingdao Agricultural University Qingdao266109 China Maize Research Institute Shandong Academy of Agricultural Sciences National Engineering Laboratory of Wheat and Maize Key Laboratory of Biology and Genetic Improvement of Maize in Northern Yellow-huai River Plain Ministry of Agriculture Jinan250100 China

ISBN: (纸本)9781665410205

The seedling stage is important in the growth and development of maize, and it is also a critical period that affects maize yield and quality. Accurately recognizing this stage of maize is challenging, as current maize seedling detection methods struggle with small sizes and complex environments. This paper proposes a rapid maize seedling detection method that emphasizes spatial feature extraction in the receptive field and cross-dimensional interaction - receptive field triplet attention YOLO (RFT-YOLO). First, we design a convolutional module for cross-dimensional information interaction within the receptive field. Second, we introduce an advanced selective fusion network, which boosts the multi-scale fusion capability of small object features while reducing the GFLOPs of the model. Additionally, we employ Inner-IoU to diminish sensitivity to positional biases of small objects and expedite the convergence of the loss function. Finally, we create a dataset of maize seedlings to conduct our experiments. Experimental results demonstrate that the RFT-YOLO significantly enhances performance, reducing the number of parameters by 35.3% and GFLOPs by 14.24%, compared to the baseline model. Moreover, the mean average precision (mAP) improves from 89.6% to 91.5%. These improvements confirm the model's effectiveness in detecting maize seedlings. © 2024 IEEE.

关键词： Deep learning Maize seedling detection Object detection UAV

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

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

作者： Qin, Libo Wei, Fuxuan Chen, Qiguang Zhou, Jingxuan Huang, Shijue Si, Jiasheng Lu, Wenpeng Che, Wanxiang School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China

ISBN: (纸本)9798350368741

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MISP: An Efficient Quantum-resistant Misbehavior Preventing Scheme with Self-enforcement for Vehicle-to-Everything

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Chen, Ying He, Debiao Bao, Zijian Wang, Huaqun Luo, Min Wuhan University School of Cyber Science and Engineering Wuhan430072 China Key Laboratory of Computing Power Network & Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Nanjing University of Posts and Telecommunications College of Computer Nanjing210023 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network & Information System Security Jinan250014 China

In the Vehicle-to-Everything (V2X) communication system, the presence of ambiguous warnings significantly increases the risk of severe accidents, posing a substantial threat to the safety of autonomous driving. It is crucial to detect such confusing warnings to avoid danger. Existing solutions to address this issue heavily rely on trust entities or are constructed based on number theory assumptions, leading to low efficiency and vulnerability to quantum attacks. In this paper, we leverage the double authentication-preventing signature scheme (DAPS) to present a revocable identity-based double-authentication preventing signature scheme (RIDAPS) and provides an instantiation from lattice. Furthermore, we propose a post-quantum secure misbehavior preventing scheme (Misp) based on our RIDAPS scheme. We give a detailed proof in the random oracle model (ROM) to demonstrate that our contribution achieves security requirements. Additionally, the efficiency evaluation results demonstrate that our scheme is suitable to be applied in V2X. © 2004-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

CurMIM: Curriculum Masked Image Modeling

CurMIM: Curriculum Masked Image Modeling

引用

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

作者： Liu, Hao Wang, Kun Han, Yudong Wang, Haocong Hu, Yupeng Wang, Chunxiao Nie, Liqiang School of Software Shandong University Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences Jinan China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China

ISBN: (纸本)9798350368741

Masked Image Modeling (MIM), following "mask-and-reconstruct" scheme, is a promising self-supervised method to learn scalable visual representation. Studies indicate that selecting an effective mask strategy is vital for MIM. However, existing approaches often rely on static pre-defined priors, which limit their ability to adapt mask strategies dynamically for network optimization. In this paper, we focus on the learning process of the network and introduce human-like curriculum into MIM for dynamic representation refinement, and propose an end-to-end framework Curriculum Masked Image Modeling (CurMIM). CurMIM consists of two components: Mask Priority Measurer, which acts as a curriculum learner to determine mask priority values using the network's intrinsic state information, and Dual Adaptive Selector, which serves as a curriculum scheduler to create effective masks based on these values. With negligible extra parameters, our curriculum-based method consistently establishes noticeable improvements across varying model sizes and benchmarks, showing effectiveness and generalization. © 2025 IEEE.

关键词： Curriculum Learning Image Representation Masked Image Modeling Visual Pre-training

来源：评论

学校读者我要写书评

暂无评论

Towards Public Integrity Audition for Cloud-IoT Data Based on Blockchain

引用

computer Systems Science & Engineering 2022年第6期41卷 1129-1142页

作者： Hao Yan Yanan Liu Shuo Qiu Shengzhou Hu Weijian Zhang Jinyue Xia School of Network Security Jinling Institute of TechnologyNanjing211169China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal UniversityFuzhou350007China Department of Mathematics and Computer Science Gannan Normal UniversityGanzhou341000China Network Security and Information Office Hohai UniversityNanjing210098China International Business Machines Corporation(IBM) New YorkNYUSA

With the rapidly developing of Internet of Things (IoT), the volume ofdata generated by IoT systems is increasing quickly. To release the pressure ofdata management and storage, more and more enterprises and individuals preferto integrate cloud service with IoT systems, in which the IoT data can be outsourced to cloud server. Since cloud service provider (CSP) is not fully trusted,a variety of methods have been proposed to deal with the problem of data integritychecking. In traditional data integrity audition schemes, the task of data auditing isusually performed by Third Party Auditor (TPA) which is assumed to be ***, in real-life TPA is not trusted as people thought. Therefore, theseschemes suffer from the underlying problem of single-point failure. Moreover,most of the traditional schemes are designed by RSA or bilinear map techniqueswhich consume heavy computation and communication cost. To overcome theseshortcomings, we propose a novel data integrity checking scheme for cloud-IoTdata based on blockchain technique and homomorphic hash. In our scheme, thetags of all data blocks are computed by a homomorphic hash function and storedin blockchain. Moreover, each step within the process of data integrity checking issigned by the performer, and the signatures are stored in blockchain through smartcontracts. As a result, each behavior for data integrity checking in our scheme canbe traced and audited which improves the security of the scheme greatly. Furthermore, batch-audition for multiple data challenges is also supported in our *** formalize the system model of our scheme and give the concrete *** performance analyses demonstrate that our proposed scheme is efficientand practical without the trust-assumption of TPA.

关键词： Blockchain cloud-IoT data integrity checking homomorphic hash function batch audition

来源：评论

学校读者我要写书评

暂无评论

A Parallelizable Counterfactual Generation Method Based on Gradient Optimization 29

A Parallelizable Counterfactual Generation Method Based on G...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Ding, Haorun Jiang, Xuesong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China State Key Laboratory of High-end Server and Storage Technology Jinan China

ISBN: (纸本)9798350330717

Post-hoc explanations are important for people to understand the predictions of explanation models. One class of methods in post-hoc explanation is the generation of counterfactuals, where a hypothetical example is obtained by perturbing the inputs to show how one could obtain a different prediction from the decision model. Counter-factual explanations should satisfy several properties: One is that counterfactuals generated under specific scenarios and constraints should be feasible for users, i.e., they should accommodate different causal constraints. The other is that it is more desirable for users to have a wider variety of viable examples, i.e., counterfactual diversity. To this end, we propose a parallelizable method based on gradient optimization. We partition the input feasible domains, perform counterfactual generation independently for each feasible domain, and then parallelize the counterfactual generation process for each feasible domain. Experimental results show that our approach effectively improves the diversity, sparsity, and proximity of the generated counterfactual instances on the public datasets Adult-Income, Lending-Club, German-Credit, and COMPAS compared to other models. © 2023 IEEE.

关键词： counterfactual explanation machine learning parallel computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Wildcard Searchable Symmetric Encryption with Forward and Backward Security 1st

Efficient Wildcard Searchable Symmetric Encryption with For...

引用

1st International Conference on Artificial Intelligence Security and Privacy, AIS and P 2023

作者： Zhang, Xi Su, Ye Wei, Zhongkai Shen, Wenting Qin, Jing College of Computer and Cyber Security Hebei Normal University Shijiazhuang050024 China Hebei Provincial Key Laboratory of Network and Information Security Hebei Normal University Shijiazhuang050024 China School of Information Science and Engineering Shandong Normal University Jinan250358 China School of Mathematics Shandong University Jinan250100 China College of Computer Science and Technology Qingdao University Qingdao266071 China

ISBN: (纸本)9789819997848

Wildcard Searchable Symmetric Encryption can achieve flexibility and pattern matching while protecting data privacy. There is a promising future for combining secure wildcard search with emerging technologies such as AI. However, there are challenges in reducing the communication cost and improving security. In this paper, we propose an efficient wildcard searchable symmetric encryption with forward and backward security. The complexity of communication costs in the search protocol is O(1), independent of the number of characters of wildcard keywords, or files in the search result. It is achieved by a double-compressed index in which the character set and file identifiers are encoded simultaneously. Then, the double-compressed index provides a possibility to achieve oblivious keyword query and update, so that the proposed scheme only reveals the query type (search or update) without anything else. It achieves forward and backward security using the distributed multi-point function and an additively homomorphic symmetric encryption scheme. Detailed security proof and the theoretical comparison show the improvement in security and efficiency. The acceptable overheads of the proposed scheme are presented by the extensive performance evaluation. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search 31

NeuVSA: A Unified and Efficient Accelerator for Neural Vecto...

引用

31st IEEE International Symposium on High Performance computer Architecture, HPCA 2025

作者： Yuan, Ziming Dai, Lei Li, Wen Zhang, Jie Liang, Shengwen Wang, Ying Liu, Cheng Li, Huawei Li, Xiaowei Guo, Jiafeng Wang, Peng Chen, Renhai Zhang, Gong Shanxi University School of Computer and Information Technology China Peking University School of Computer Science China Institute of Computing Technology CAS State Key Lab of Processors China University of Chinese Academy of Sciences China Zhongguancun National Laboratory Beijing China Institute of Computing Technology CAS Key Lab of Network Data Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9798331506476

Neural Vector Search (NVS) has exhibited superior search quality over traditional key-based strategies for information retrieval tasks. An effective NVS architecture requires high recall, low latency, and high throughput to enhance user experience and cost-efficiency. However, implementing NVS on existing neural network accelerators and vector search accelerators is sub-optimal due to the separation between the embedding stage and vector search stage at both algorithm and architecture levels. Fortunately, we unveil that Product Quantization (PQ) opens up an opportunity to break separation. However, existing PQ algorithms and accelerators still focus on either the embedding stage or the vector search stage, rather than both simultaneously. Simply combining existing solutions still follows the beaten track of separation and suffers from insufficient parallelization, frequent data access conflicts, and the absence of scheduling, thus failing to reach optimal recall, latency, and throughput. To this end, we propose a unified and efficient NVS accelerator dubbed NeuVSA based on algorithm and architecture co-design philosophy. Specifically, on the algorithm level, we propose a learned PQ-based unified NVS algorithm that consolidates two separate stages into the same computing and memory access paradigm. It integrates an end-to-end joint training strategy to learn the optimal codebook and index for enhanced recall and reduced PQ complexity, thus achieving smoother acceleration. On the architecture level, we customize a homogeneous NVS accelerator based on the unified NVS algorithm. Each sub-accelerator is optimized to exploit all parallelism exposed by unified NVS, incorporating a structured index assignment strategy and an elastic on-chip buffer to alleviate buffer conflicts for reduced latency. All sub-accelerators are coordinated using a hardware-aware scheduling strategy for boosted throughput. Experimental results show that the joint training strategy improves recall

关键词： network embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：