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

The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2024, CC BY.

关键词： Bamboo

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

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Dee...

IEEE International Conference on Automated Software Engineering (ASE)

作者： Zhen Li Ruqian Zhang Deqing Zou Ning Wang Yating Li Shouhuai Xu Chen Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security Department of Computer Science University of Colorado Colorado Springs USA Center for Research in Computer Vision University of Central Florida USA School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 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.

关键词：

Grace: An Efficient Parallel SPARQL Query system over Large-Scale RDF Data

学校读者我要写书评

暂无评论

Grace: An Efficient Parallel SPARQL Query System over Large-...

International Conference on Computer Supported Cooperative Work in Design

作者： Xiang Kang Yuying Zhao Pingpeng Yuan Hai Jin 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 Huazhong University of Science and Technology Wuhan China

As a markup language for describing web resources, RDF is often used to represent graph data. SPARQL is a standard query language for RDF data, which is convenient in querying RDF. As RDF data grows rapidly, how to deal with complex queries over large-scale data in a reasonable time still remains many challenges. The existing RDF query systems often fail to respond within a reasonable time when dealing with complex SPARQL queries. Therefore, we propose an efficient parallel SPARQL query system and novel in three aspects. First, the proposed design provides a dynamic selectivity estimation strategy and generates an optimal query plan for parallel query processing. Second, the new design proposes a parallel processing model to maximize the parallelism of the system. Finally, chunk-based task distribution strategy is implemented to assist the parallel processing model. Based on the proposed design, we implement an efficient parallel query system (Grace). Extensive experiments on LUBM and BTC benchmarks show that Grace outperforms RDF-3X, Virtuoso, TripleBit and achieves a good performance of scalability on the number of threads.

关键词： Distribution strategy Scalability Query processing Markup languages Instruction sets Estimation Parallel processing

Text-augmented long-term relation dependency learning for knowledge graph representation

学校读者我要写书评

暂无评论

High-Confidence Computing

High-Confidence computing 2025年

作者： Quntao Zhu Mengfan Li Yuanjun Gao Yao Wan Xuanhua Shi Hai Jin 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 Huazhong University of Science and Technology Wuhan 430074 China

Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) Graph-based approaches encode KG elements into vectors using structural score functions. (2) Text-based approaches embed text descriptions of entities and relations via pre-trained language models (PLMs), further fine-tuned with triples. We argue that graph-based approaches struggle with sparse data, while text-based approaches face challenges with complex relations. To address these limitations, we propose a unified Text-Augmented Attention-based Recurrent Network, bridging the gap between graph and natural language. Specifically, we employ a graph attention network based on local influence weights to model local structural information and utilize a PLM based prompt learning to learn textual information, enhanced by a mask-reconstruction strategy based on global influence weights and textual contrastive learning for improved robustness and generalizability. Besides, to effectively model multi-hop relations, we propose a novel semantic-depth guided path extraction algorithm and integrate cross-attention layers into recurrent neural networks to facilitate learning the long-term relation dependency and offer an adaptive attention mechanism for varied-length information. Extensive experiments demonstrate that our model exhibits superiority over existing models across KG completion and question-answering tasks.

关键词： Knowledge graph representation Graph attention network Pre-trained language model Attention-based recurrent network Masked autoencoder Contrastive learning

Cross-Language Binary-Source Code Matching with Intermediate Representations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Gui, Yi Wan, Yao Zhang, Hongyu Huang, Huifang Sui, Yulei Xu, Guandong Shao, Zhiyuan Jin, Hai 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 Huazhong University of Science and Technology Wuhan China The University of Newcastle Australia School of Mathematics and Statistics Huazhong University of Science and Technology Wuhan China School of Computer Science University of Technology Sydney Australia

Binary-source code matching plays an important role in many security and software engineering related tasks such as malware detection, reverse engineering and vulnerability assessment. Currently, several approaches have been proposed for binary-source code matching by jointly learning the embeddings of binary code and source code in a common vector space. Despite much effort, existing approaches target on matching the binary code and source code written in a single programming language. However, in practice, software applications are often written in different programming languages to cater for different requirements and computing platforms. Matching binary and source code across programming languages introduces additional challenges when maintaining multi-language and multi-platform applications. To this end, this paper formulates the problem of cross-language binary-source code matching, and develops a new dataset for this new problem. We present a novel approach XLIR, which is a Transformer-based neural network by learning the intermediate representations for both binary and source code. To validate the effectiveness of XLIR, comprehensive experiments are conducted on two tasks of cross-language binary-source code matching, and cross-language source-source code matching, on top of our curated dataset. Experimental results and analysis show that our proposed XLIR with intermediate representations significantly outperforms other state-of-the-art models in both of the two tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Binary codes

MISA: UNVEILING THE VULNERABILITIES IN SPLIT FEDERATED LEARNING

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wan, Wei Ning, Yuxuan Hu, Shengshan Xue, Lulu Li, Minghui Zhang, Leo Yu Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab China

Federated learning (FL) and split learning (SL) are prevailing distributed paradigms in recent years. They both enable shared global model training while keeping data localized on users' devices. The former excels in parallel execution capabilities, while the latter enjoys low dependence on edge computing resources and strong privacy protection. Split federated learning (SFL) combines the strengths of both FL and SL, making it one of the most popular distributed architectures. Furthermore, a recent study has claimed that SFL exhibits robustness against poisoning attacks, with a fivefold improvement compared to FL in terms of robustness. In this paper, we present a novel poisoning attack known as MISA. It poisons both the top and bottom models, causing a misalignment in the global model, ultimately leading to a drastic accuracy collapse. This attack unveils the vulnerabilities in SFL, challenging the conventional belief that SFL is robust against poisoning attacks. Extensive experiments demonstrate that our proposed MISA poses a significant threat to the availability of SFL, underscoring the imperative for academia and industry to accord this matter due attention. Copyright © 2023, The Authors. All rights reserved.

关键词：

Deep Learning for Code Intelligence: Survey, Benchmark and Toolkit

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wan, Yao He, Yang Bi, Zhangqian Zhang, Jianguo Zhang, Hongyu Sui, Yulei Xu, Guandong Jin, Hai Yu, Philip S. 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 Huazhong University of Science and Technology Wuhan China Simon Fraser University Vancouver Canada School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Salesforce Research United States Chongqing University China University of New South Wales Australia University of Technology Sydney Australia University of Illinois at Chicago Chicago United States

Code intelligence leverages machine learning techniques to extract knowledge from extensive code corpora, with the aim of developing intelligent tools to improve the quality and productivity of computer programming. Currently, there is already a thriving research community focusing on code intelligence, with efforts ranging from software engineering, machine learning, data mining, natural language processing, and programming languages. In this paper, we conduct a comprehensive literature review on deep learning for code intelligence, from the aspects of code representation learning, deep learning techniques, and application tasks. We also benchmark several state-of-the-art neural models for code intelligence, and provide an open-source toolkit tailored for the rapid prototyping of deep-learning-based code intelligence models. In particular, we inspect the existing code intelligence models under the basis of code representation learning, and provide a comprehensive overview to enhance comprehension of the present state of code intelligence. Furthermore, we publicly release the source code and data resources to provide the community with a ready-to-use benchmark, which can facilitate the evaluation and comparison of existing and future code intelligence models (https://***). At last, we also point out several challenging and promising directions for future research. Copyright © 2023, The Authors. All rights reserved.

关键词： Computer programming languages

A Multi-Dimensional Assessment Model and Its Application in E-learning Courses of Computer Science 20

学校读者我要写书评

暂无评论

A Multi-Dimensional Assessment Model and Its Application in ...

21st Annual Conference of the Special Interest Group in Information technology Education, SIGITE 2020

作者： Luo, Jiwen Lu, Feng Wang, Tao Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha China 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 Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781450370455

Computer science is a practical discipline. It is always a great challenge to evaluate students' computer practice using computer-aided means for large scale students. We always need to address problems such as suspected plagiarism and deviation of the overall difficulty factor. In this paper, a multi-dimensional assessment model is designed for CS courses based on the detailed practice processing data in an E-learning system. The model comprehensively evaluates the students' learning process and results in three aspects of correctness, originality, and quality detection. Besides, the teacher can easily participate in the assessment according to their needs. The correctness is an essential requirement, and the originality is based on the clustering results of students' behaviors after clone detection to curb homework plagiarism. SonarQube is used to detect code quality and put forward higher requirements for codes. Manual participation intelligence has improved the flexibility and applicability of the model to a certain extent. We applied this model on the EduCoder online education platform and carried out a comprehensive analysis of 485 students in the Parallel Programming Principles and Practice Class of Huazhong University of Science and technology. Experiment results confirm the distinction, rationality, and fairness of the model in assessing student performance. It not only gives students a credible, comprehensive score in large-scale online practical programming courses but also gives teachers and students corresponding suggestions based on the evaluation results. Furthermore, the model can be extended to other online education platforms. © 2020 ACM.

关键词： Students

Shielding Federated Learning: Robust Aggregation with Adaptive Client Selection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wan, Wei Hu, Shengshan Lu, Jianrong Yu Zhang, Leo Jin, Hai He, Yuanyuan School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab School of Information Technology Deakin University Australia

Federated learning (FL) enables multiple clients to collaboratively train an accurate global model while protecting clients’ data privacy. However, FL is susceptible to Byzantine attacks from malicious participants. Although the problem has gained significant attention, existing defenses have several flaws: the server irrationally chooses malicious clients for aggregation even after they have been detected in previous rounds;the defenses perform ineffectively against sybil attacks or in the heterogeneous data setting. To overcome these issues, we propose MAB-RFL, a new method for robust aggregation in FL. By modelling the client selection as an extended multi-armed bandit (MAB) problem, we propose an adaptive client selection strategy to choose honest clients that are more likely to contribute high-quality updates. We then propose two approaches to identify malicious updates from sybil and non-sybil attacks, based on which rewards for each client selection decision can be accurately evaluated to discourage malicious behaviors. MAB-RFL achieves a satisfying balance between exploration and exploitation on the potential benign clients. Extensive experimental results show that MAB-RFL outperforms existing defenses in three attack scenarios under different percentages of attackers. Copyright © 2022, The Authors. All rights reserved.

关键词： Data privacy