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

arXiv 2023年

作者： Jia, Zian Xiong, Yun Nan, Yuhong Zhang, Yao Zhao, Jinjing Wen, Mi Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China School of Software Engineering Sun Yat-sen University China National Key Laboratory of Science and Technology on Information System Security China Shanghai University of Electric Power China

Advance Persistent Threats (APTs), adopted by most delicate attackers, are becoming increasing common and pose great threat to various enterprises and institutions. Data provenance analysis on provenance graphs has emerged as a common approach in APT detection. However, previous works have exhibited several shortcomings: (1) requiring attack-containing data and a priori knowledge of APTs, (2) failing in extracting the rich contextual information buried within provenance graphs and (3) becoming impracticable due to their prohibitive computation overhead and memory consumption. In this paper, we introduce MAGIC, a novel and flexible self-supervised APT detection approach capable of performing multi-granularity detection under different level of supervision. MAGIC leverages masked graph representation learning to model benign system entities and behaviors, performing efficient deep feature extraction and structure abstraction on provenance graphs. By ferreting out anomalous system behaviors via outlier detection methods, MAGIC is able to perform both system entity level and batched log level APT detection. MAGIC is specially designed to handle concept drift with a model adaption mechanism and successfully applies to universal conditions and detection scenarios. We evaluate MAGIC on three widely-used datasets, including both real-world and simulated attacks. Evaluation results indicate that MAGIC achieves promising detection results in all scenarios and shows enormous advantage over state-of-the-art APT detection approaches in performance overhead. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A Study on Semi-Supervised Semantic Segmentation of Ship Flame Images

A Study on Semi-Supervised Semantic Segmentation of Ship Fla...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Junwei Wan Yaojie Chen XueCong Zheng Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China

In addressing the challenges of limited semantic labeling data and imprecise segmentation regions prevalent in the semantic segmentation of ship flame images, this study introduces a semi-supervised semantic segmentation method tailored for ship flame images. This approach is grounded in the principles of pairwise similarity with strong-weak perturbations. Adopting a pseudo-label self-learning strategy, the method employs weak-strong perturbation pairwise similarity, ensuring the propagation of high-confidence predictions during label generation, and thereby enhancing performance. Additionally, to tackle the inherent difficulties presented by smoke enveloping and obscuring flame regions in ship images, we have conceived a Vertical Continuity Feature Enhancement module. This module empowers the model to discern more explicit inter-class boundaries. Empirical evaluations on our proprietary dataset substantiate the superiority of our method, registering an improvement of 4.12 percentage points in mIoU over other semi-supervised approaches. Such results attest to the efficacy of the proposed pairwise similarity approach and the Vertical Continuity Feature Enhancement module in flame semantic segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Driven Hierarchical Authentication and key Agreement Scheme for VANETs With Cloud-Edge Collaboration

引用

IEEE Transactions on information Forensics and security 2025年 20卷 6413-6428页

作者： Lu Wei Yongjuan Zhang Jie Cui Hong Zhong Irina Bolodurina Debiao He Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology and the Institute of Physical Science and Information Technology Anhui University Hefei China Anhui Engineering Laboratory of IoT Security Technologies Anhui University Hefei China Faculty of Mathematics and Information Technologies Orenburg State University Orenburg Russia School of Cyber Science and Engineering Wuhan University Wuhan China Shanghai Key Laboratory of Privacy Preserving Computation MatrixElements Technologies Shanghai China

Vehicular ad-hoc networks (VANETs) are the cornerstone of intelligent transportation systems, designed to enhance road safety and traffic efficiency. However, their dynamic and distributed nature poses significant challenges for secure communication and key management. Traditional authentication and key agreement (AKA) schemes for VANETs often rely on centralized trust architectures, resulting in system security and reliability issues. Despite the introduction of distributed trust architecture schemes that have appeared recently, they fail to solve one issue, i.e., how the key agreement requests can be authenticated in the distributed communication scenario where the authentication authorities are all non-full-credible and have differentiated credibility. To solve this issue, we propose a hierarchical AKA scheme for VANETs with cloud-edge collaboration powered by consortium blockchain. Specifically, we first proposed a vehicle reputation evaluation algorithm for evaluating the trustworthiness of the vehicle, so that the AKA requests sent by vehicles with low reputation will be rejected. On the basis of the reputation evaluation algorithm, we proposed a hierarchical threshold-based AKA scheme for VANETs where cloud servers (CSs) and edge servers (ESs) can collaboratively authenticate the AKA requests, so that the authentication service can be trusted upon getting authenticated by a series of valid combinations of CSs and ESs. Both formal and informal security proofs validate the security of our proposed scheme, and simulation experiments demonstrate its efficiency.

关键词： security Authentication Servers computer architecture Blockchains Elliptic curves Vehicular ad hoc networks Collaboration Real-time systems Galois fields

来源：评论

学校读者我要写书评

暂无评论

Ethereum smart contract security research:survey and future research opportunities

引用

Frontiers of computer science 2021年第2期15卷 143-160页

作者： Zeli WANG Hai JIN Weiqi DAI Kim-Kwang Raymond CHOO Deqing ZOU National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabHubei Engineering Research Center on Big Data SecurityWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057China Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249-0631USA

Blockchain has recently emerged as a research trend,with potential applications in a broad range of industries and *** particular successful Blockchain technology is smart contract,which is widely used in commercial settings(e.g.,high value financial transactions).This,however,has security implications due to the potential to financially benefit from a security incident(e.g.,identification and exploitation of a vulnerability in the smart contract or its implementation).Among,Ethereum is the most active and ***,in this paper,we systematically review existing research efforts on Ethereum smart contract security,published between 2015 and ***,we focus on how smart contracts can be maliciously exploited and targeted,such as security issues of contract program model,vulnerabilities in the program and safety consideration introduced by program execution *** also identify potential research opportunities and future research agenda.

关键词： smart contract security blockchain vulnerability unreliable data

来源：评论

学校读者我要写书评

暂无评论

Efficient Routing Protection Algorithm Based on Optimized Network Topology

引用

computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need

arXiv

引用

arXiv 2024年

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AirDIV: Over-the-Air Cloud-Fog Data Integrity Verification Scheme for Industrial Cyber-Physical systems

引用

IEEE Journal on Selected Areas in Communications 2025年

作者： Zhao, Yao Xiang, Yong Uddin, Md Palash Zhang, Yushu Liu, Lu Liu, Yansong Gao, Longxiang Deakin University School of Information Technology VIC Australia Jiangxi University of Finance and Economics School of Computing and Artificial Intelligence Nanchang330013 China University of Exeter Department of Computer Science Exeter United Kingdom RWTH Aachen University Department of Computer Science Aachen Germany Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China

Industrial Cyber-Physical systems (ICPSs) have been motivating various Industry 4.0 endeavours, particularly with the integration of fog computing. Cloud-fog data caching paradigms, as supportive elements of ICPSs, have been adopted to cache user data, catering to diverse ICPS requirements such as data sensitivity and reduced access latency. In this hierarchical caching context, ensuring Cloud-Fog Data Integrity (CFDI) is crucial for maintaining the consistent functionality of ICPSs. Existing solutions primarily focus on examining the integrity of data cached solely on either cloud or fog nodes. However, cloud-cached data and fog-cached data are tightly coupled and should be considered simultaneously when checking data integrity. In this work, we introduce an over-the-air CFDI verification scheme, namely AirDIV, with a high accuracy and security guarantee. Instead of aggregating integrity proofs after proof transmission, AirDIV completes proof aggregation and transmission over the air for efficiency improvement. To enhance practicability, we derive adjustable parameters and formulate an optimization problem to minimize over-the-air aggregation errors. Furthermore, with an effective proof generation method, AirDIV can defend against two common attacks, i.e., replay and forge attacks. We provide a theoretical analysis of AirDIV's correctness, accuracy and security, while conducting extensive experiments on both simulated and real platforms to validate its efficiency. © 1983-2012 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Neo: Towards Efficient Fully Homomorphic Encryption Acceleration using Tensor Core 25

Neo: Towards Efficient Fully Homomorphic Encryption Accelera...

引用

Proceedings of the 52nd Annual International Symposium on computer Architecture

作者： Dian Jiao Xianglong Deng Zhiwei Wang Shengyu Fan Yi Chen Dan Meng Rui Hou Mingzhe Zhang State Key Laboratory of Cyberspace Security Defense Institute of Information Engineering CAS Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China State Key Laboratory of Cyberspace Security Defense Institute of Information Engineering CAS Beijing China Huazhong University of Science and Technology Wuhan China Computing System Lab Ant Group Beijing China

来源：评论

学校读者我要写书评

暂无评论

Using Lock-Free Design for Throughput-Optimized Cache Eviction 25

Using Lock-Free Design for Throughput-Optimized Cache Evicti...

引用

Abstracts of the 2025 ACM SIGMETRICS International Conference on Measurement and Modeling of computer systems

作者： Chao Dong Fang Wang Hong Jiang Dan Feng Key Laboratory of Information Storage System (Wuhan National Laboratory for Optoelectronics) Engineering Research Center of data storage systems and Technology (School of Computer Science and Technology) Ministry of Education of China Huazhong University of Science and Techonolgy Wuhan Hubei China Department of Computer Science and Engineering University of Texas at Arlington Arlington Texas USA

ISBN: (纸本)9798400715938

This paper presents a practical approach to cache eviction algorithm design, called Mobius, that optimizes the concurrent throughput of caches and reduces cache operation latency by utilizing lock-free data structures, while maintaining high cache hit ratios. Mobius includes two key designs. First, Mobius employs two lock-free FIFO queues to manage cache items, ensuring that all cache operations are executed efficiently in concurrency. Second, Mobius integrates a consecutive detection mechanism that merges multiple modifications during eviction into a single operation, thereby reducing data races. The implementation of Mobius in CacheLib and RocksDB highlights its high concurrency in both synthetic and real-world workloads.

关键词： cache eviction policy

来源：评论

学校读者我要写书评

暂无评论

Discrete Jaya algorithm to solve the police resource deployment problem in emergency traffic accident 10

Discrete Jaya algorithm to solve the police resource deploym...

引用

10th IEEE Joint International information technology and Artificial Intelligence Conference, ITAIC 2022

作者： Jing, Zhang Weijie, Ding Zhejiang Police College Department of Computer and Information Security Hangzhou310053 China Big-data and Network Security Research Institute Zhejiang Police College Hangzhou310053 China College of Information Engineering Zhejiang University of Technology Hangzhou310023 China Key Laboratory of Public Security Information Application Based on Big-data Architecture Ministry of Public Security Hangzhou310053 China

ISBN: (数字)9781665422079

ISBN: (纸本)9781665422079

Aiming at the high frequency of urban traffic accidents and the relative shortage of police resources, a multi-objective discrete Jaya algorithm is proposed to solve the problem of police resource deployment in emergency traffic accident handling. The purpose is to make timely response and handling of traffic accidents through the rational allocation of police deployment points in the jurisdiction. Taking the coverage of accident points and the average response time of accidents as the optimization objectives, the discrete Jaya algorithm is used as the global search strategy to approach the Pareto front by constantly approaching the optimal solution and far away from the worst solution, and then the neighborhood search strategy is used to improve the local search ability of the algorithm. Finally, a practical example is given to verify the effectiveness of the proposed method. © 2022 IEEE.

关键词： Law enforcement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：