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

Neural network-Based State Estimation for Nonlinear Systems With Denial-of-Service Attack Under Try-Once-Discard Protocol

引用

IEEE/CAA Journal of Automatica Sinica 2024年第10期11卷 2182-2184页

作者： Xueli Wang Shangwei Zhao Ming Yang Xin Wang Xiaoming Wu the Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan 250014 Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250014China Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China

Dear Editor,This letter deals with state estimation issues of discrete-time nonlinear systems subject to denial-of-service(DoS)attacks under the try-once-discard(TOD)*** specifically,to reduce the communication burden,a TOD protocol with novel update rules on protocol weights is designed for scheduling measurement *** addition,unknown nonlinear functions vulnerable to DoS attacks are considered due to the openness and vulnerability of the network.

关键词： Service DoS service

来源：评论

学校读者我要写书评

暂无评论

JFuzzer: Detecting Optimization Errors in JavaScript Just-In-Time Compilers 24

JFuzzer: Detecting Optimization Errors in JavaScript Just-In...

引用

24th IEEE International Conference on Software Quality, Reliability and Security Companion, QRS-C 2024

作者： Zhang, Chi Chen, Jinfu Cai, Saihua Chen, Jingyi Huang, Chunlei School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China Jiangsu Key Laboratory of Security Technology for Industrial Cyberspace Jiangsu University Zhenjiang China

ISBN: (纸本)9798350365658

As a crucial component of the internet, JavaScript plays an essential role in various web applications. However, to meet the demands of high-speed user experiences and an increasing array of functionalities, computationally intensive operations are becoming more frequent in JavaScript. This poses challenges for JavaScript engines. Consequently, in response to this situation, modern JavaScript engines are equipped with efficient just-in-time (JIT) compilers. Unfortu-nately, while optimizing code, JIT compiler introduces some security vulnerabilities due to its inherent complexity, thereby offering attackers a broad surface. In terms of vulnerability detection, fuzzing has consistently been considered an effective method for detecting bugs. However, existing JavaScript fuzzers are not mainly designed specifically for detecting JIT compiler vulnerabilities, making it challenging for them to uncover JIT-exclusive bugs. In this paper, we propose a new method called JFuzzer, specifically designed for detecting JIT compiler bugs. Specifically, we use some mutation strategies on the intermediate representation (IR) of JavaScript code to improve their syntactic and semantic correctness. On the other hand, we strive to ensure that the test cases can activate the JIT compiler each time. By employing the idea of differential testing, we compare the results when using the JavaScript engine's interpreter and the corresponding JIT compiler. This allows us to detect potential vulnerabilities in the JIT compiler. Through extensive experiments, our method has improved coverage on three widely used JavaScript engines. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

引用

Digital Communications and networks 2025年第2期11卷 473-481页

作者： Qi Li Gaozhan Liu Qianqian Zhang Lidong Han Wei Chen Rui Li Jinbo Xiong School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal UniversityHangzhou 311121China Tongda College of Nanjing University of Posts and Telecommunications Yangzhou 225127China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China School of Computer Science and Technology Xidian UniversityXi'an 710071China State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal UniversityXining 810008China Faculty of Software Fujian Normal UniversityFuzhou 350108China

Ciphertext-Policy Attribute-Based Encryption(CP-ABE)enables fine-grained access control on ciphertexts,making it a promising approach for managing data stored in the cloud-enabled Internet of *** existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute ***,resource-constrained IoT devices,especially those adopting wireless communication,frequently encounter affordability issues regarding decryption *** this paper,we propose an efficient and fine-grained access control scheme with fully hidden policies(named FHAC).FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them.A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access *** attacks are thwarted by providing unauthorized users with invalid *** heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud ***,users can verify the correctness of multiple outsourced decryption results *** analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption.

关键词： Access control Policy hiding Verifiable outsourced computation Cloud IoT

来源：评论

学校读者我要写书评

暂无评论

A bitcoin service community classification method based on Random Forest and improved KNN algorithm

IET Blockchain

引用

IET Blockchain 2024年第3期4卷 276-286页

作者： Gao, Muyun Lin, Shenwen Tian, Xin He, Xi He, Ketai Chen, Shifeng School of Mechanical Engineering University of Science and Technology Beijing Beijing China Internet Financial Security Technology Key Laboratory National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing China

There are service communities with different functions in the Bitcoin transactions system. Identifying community categories helps to further understand the Bitcoin transactions system and facilitates targeted regulation of anonymized Bitcoin transactions. To this end, a Bitcoin service community classification method based on Random Forest and improved K-Nearest Neighbor (KNN) algorithm is proposed. First, the transaction characteristics of different types of communities are analyzed and summarized, and the corresponding transaction features are extracted from the address and entity levels;then multiple classification algorithms are compared, the optimal model to filter the effective features is selected, and the feature vector of entity addresses is constructed. Finally, a classification model is constructed based on Random Forest and improved KNN algorithm to classify the entities. By constructing different classification models for experimental comparison, the accuracy and stability advantages of the proposed method for classification in service community classification research are verified. © 2024 The Authors. IET Blockchain published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and technology.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Specification and counterexample generation for cyber-physical systems

引用

Soft Computing 2024年第17-18期28卷 9137-9155页

作者： Li, Zhen Cao, Zining Wang, Fujun Xing, Chao College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing211106 China Science and Technology on Electro-optic Control Laboratory Henan Luoyang471000 China Collaborative Innovation Center of Novel Software Technology and Industrializaton Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing210023 China Key Laboratory of Safety-Critical Software Ministry of Industry and Information Technology Jiangsu Nanjing211106 China

Cyber-Physical Systems (CPS) are complex systems that integrate information control devices with physical resources, which can be automatically and formalized verified by model checking according to the expected requirements in the formal specification. The counterexamples in model checking are witnesses to the violation of the specification properties of the system and can provide important diagnostic information for debugging, controlling, and synthesizing CPS. Designing a rational specification language for CPS and generating effective counterexamples allows security vulnerabilities to be detected and addressed early in the system development. However, CPS involve frequent interactions between cyber and physical systems and often operate in unreliable environments, which poses new challenges for comprehensive modeling and designing specification languages for CPSs with discrete, continuous, time, probabilistic, and concurrent behaviors. Moreover, finding the smallest counterexample of CPS with probabilistic behavior in the shortest possible time has been identified as a Non-Deterministic Polynomial-complete (NP-complete) problem. Although a number of heuristics have been devised to address this challenge, the accuracy and efficiency of the solved counterexamples need to be improved due to the difficulty in determining the heuristic functions. We first provide a comprehensive model for CPS by introducing the Hybrid Probabilistic Time Labeled Transition System (HPTLTS). Subsequently, we design a specification language HPTLTS Temporal Logic (HPTLTS-TL) that can describe the properties of CPS. In addition, we propose an optimization algorithm CACO-A, which combines the Ant Colony Optimization (ACO) algorithm and the A-algorithm to efficiently generate the counterexample of CPS, which is represented as the diagnostic subgraph. Finally, we discuss a typical CPS example to demonstrate the feasibility of our approach. © The Author(s), under exclusive licence to Springer-

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

DBT-PDP:Provable data possession with outsourced data batch transfer based on blockchain

引用

High-Confidence Computing 2024年第2期4卷 62-72页

作者： Chengming Yi Hua Zhang Weiming Sun Jun Ding State key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China Zhe Jiang Computer Network Emergency Response Technical Team Hangzhou 310052China

In the scenario of large-scale data ownership transactions,existing data integrity auditing schemes are faced with security risks from malicious third-party auditors and are inefficient in both calculation and communication,which greatly affects their *** paper proposes a data integrity audit scheme based on blockchain where data ownership can be traded in batches.A data tag structure which supports data ownership batch transaction is adopted in our *** update process of data tag does not involve the unique information of each data,so that any user can complete ownership transactions of multiple data in a single transaction through a single transaction auxiliary *** the same time,smart contract is introduced into our scheme to perform data integrity audit belongs to third-party auditors,therefore our scheme can free from potential security risks of malicious third-party *** analysis shows that our scheme is proved to be safe under the stochastic prediction model and k-CEIDH *** with similar schemes,the experiment shows that communication overhead and computing time of data ownership transaction in our scheme is ***,the communication overhead and computing time of our scheme is similar to that of similar schemes in data integrity audit.

关键词： Data integrity Cloud outsourcing audit Data ownership batch transaction Blockchain Smart contract

来源：评论

学校读者我要写书评

暂无评论

FRACTAL: Data-aware Clustering and Communication Optimization for Decentralized Federated Learning

引用

IEEE Transactions on Big Data 2024年 1-16页

作者： Ma, Qianpiao Liu, Jianchun Xu, Hongli Jia, Qingmin Xie, Renchao Purple Mountain Laboratories Nanjing Jiangsu China School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

Decentralized federated learning (DFL) is a promising technique to enable distributed machine learning over edge nodes without relying on a centralized parameter server. However, existing DFL network topologies, such as fully connected, partially connected, or lower-tier hierarchical topology often struggle to effectively address the unique challenges presented by edge networks, including edge heterogeneity, communication resource constraint, and data Non-IID. In order to tackle these challenges, we propose a data-aware clustering algorithm, called FRACTAL, to construct a multi-tier hierarchical topology in a bottomup manner taking into consideration both data distribution and communication efficiency for DFL. We theoretically explore the quantitative relationship between the convergence bound of multi-tier FL and the data distribution among each-tier servers. To further improve communication efficiency and address edge heterogeneity, we deploy a time-sharing communication scheduling algorithm within each fractal unit (the basic structure in FRACTAL consisting of multiple nodes and an aggregator), called magic mirror method (MMM), to determine the optimal order of model distributing and uploading for nodes. We conduct extensive experiments on the classical models and datasets to evaluate the performance of FRACTAL, and the results show that FRACTAL can significantly accelerate the DFL model training by 48.6%- 72.3% compared with the state-of-the-art solutions. IEEE

关键词： network topology

来源：评论

学校读者我要写书评

暂无评论

The Demonstration of Traffic Prediction based on SDN Controller for High-quality Private Line in OTN

The Demonstration of Traffic Prediction based on SDN Control...

引用

2024 Asia Communications and Photonics Conference, ACP 2024 and International Conference on Information Photonics and Optical Communications, IPOC 2024

作者： Qin, Xin Su, Guangnan Gao, Xia Liu, Jie Hu, Qian Lv, Hongwei Xie, Jiuyu Li, Junjie State Key Laboratory of Optical Fiber and Cable Manufacture Technology China Telecom Research Institute Beijing China Network Operations Center China Telecom Jiangsu Branch Jiangsu China Network Operations Department China Telecom Jiangsu Branch Jiangsu China

We propose a customized traffic prediction method based on software defined network controller. The field trial in optical transport network demonstrates that our proposed method can realize the intelligent and dynami... 详细信息

ISBN: (纸本)9798350379266

关键词： Air traffic control

来源：评论

学校读者我要写书评

暂无评论

SoK: Post-Quantum key Encapsulation Mechanisms—Security Definitions, Constructions, and Applications 9th

SoK: Post-Quantum Key Encapsulation Mechanisms—Security Def...

引用

9th International Conference on Security Standardisation Research, SSR 2024

作者： Zhou, Biming Liu, Yiting Jiang, Haodong Zhao, Yunlei College of Computer Science and Technology Fudan University Shanghai200433 China Henan Key Laboratory of Network Cryptography Technology Henan Zhengzhou450001 China

ISBN: (纸本)9783031875403

The key Encapsulation Mechanism (KEM) is one of the most important foundational cryptographic primitives. It can be used to construct Public key Encryption (PKE), key Exchange, and Authenticated key Exchange. With the continuing advances in quantum computing (e.g., Shor’s algorithm), traditional KEMs based on RSA and ECC will eventually become insecure. As the NIST Post-Quantum Cryptography (PQC) Standardization progresses, exploring the construction of post-quantum secure KEMs has become a highly relevant topic. This paper presents a comprehensive survey of general constructions of post-quantum secure KEMs in both the random oracle model (ROM) and quantum random oracle model (QROM), focusing on their security definitions, general constructions, and practical applications. We examine key security notions for KEMs, such as OW-CPA, IND-CPA, IND-1CCA, and IND-CCA, as well as their general construction from CPA-secure PKE schemes alongside applications in real-world protocols, including TLS 1.3, KEMTLS, Signal, and Noise. Specifically, we examine the FO and modular variants for IND-CCA KEMs, three distinct T-transforms for IND-1CCA KEMs, and the CPA transform for CPA-secure KEMs derived from CPA-secure PKEs. We further discuss the security requirements of KEMs within various protocols and highlight that IND-1CCA KEMs can be used to construct practical protocols such as KEMTLS, Signal, and Noise. In particular, CPA-secure KEMs can be employed in constructing post-quantum TLS 1.3. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Inductive Link Prediction in N-ary Knowledge Graphs 31

Inductive Link Prediction in N-ary Knowledge Graphs

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761964

N-ary Knowledge Graphs (NKGs), where a fact can involve more than two entities, have gained increasing attention. Link Prediction in NKGs (LPN) aims to predict missing elements in facts to facilitate the completion of NKGs. Current LPN methods implicitly operate under a closed-world assumption, meaning that the sets of entities and roles are fixed. These methods focus on predicting missing elements within facts composed of entities and roles seen during training. However, in reality, new facts involving unseen entities and roles frequently emerge, requiring completing these facts. Thus, this paper proposes a new task, Inductive Link Prediction in NKGs (ILPN), which aims to predict missing elements in facts involving unseen entities and roles in emerging NKGs. To address this task, we propose a Meta-learning-based Nary knowledge Inductive Reasoner (MetaNIR), which employs a graph neural network with meta-learning mechanisms to embed unseen entities and roles adaptively. The obtained embeddings are used to predict missing elements in facts involving unseen elements. Since no existing dataset supports this task, three datasets are constructed to evaluate the effectiveness of MetaNIR. Extensive experimental results demonstrate that MetaNIR consistently outperforms representative models across all datasets. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：