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

Provably Secure and Efficient One-to-Many Authentication and Key Agreement Protocol for Resource-Asymmetric Smart Environments

引用

IEEE Internet of Things Journal 2025年

作者： Li, Long Hsu, Chingfang Cui, Jianqun Au, Man Ho Harn, Lein Li, Quanrun Central China Normal University Computer School Wuhan430079 China Central China Normal University Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Wuhan430079 China Department of Computing Hong Kong Polytechnic University 25809 Hong Kong University of Missouri-Kansas City Department of Computer Science Electrical Engineering MO64110 United States Zhejiang Sci-Tech University School of Cyber Science and Engineering Hangzhou310020 China

The smart environment is a crucial application of the Internet of Things(IoT). Due to its growing security and efficiency needs, recent years have seen the proposal of numerous authentication and key agreement (AKA) protocols. Unfortunately, most of existing AKA protocols only support one-to-one AKA and rely on the elliptic curve cryptosystem, resulting in huge overhead. In addition, these protocols fail to consider the resource-asymmetric characteristics of this scenario. That is, the resources on the gateway side are abundant, while the resources on user sides and device sides are limited. In order to achieve efficient and secure one-to-many AKA establishment in this scenario, where one-to-many means that users can realize key agreements with multiple smart devices at the same time. For the first time, this paper uses the one-to-many computing structure of the Chinese Remainder Theorem (CRT) to design an efficient one-to-many AKA establishment, which is perfectly adapted to resource-asymmetric allocation in smart environments. Compared with existing solutions, this solution has the following advantages. Firstly, our protocol is suitable for resource-asymmetric environments, where the gateway acts as an intermediate node and uses rich resources to integrate multiple AKA requests. Secondly, the solution supports users to negotiate session keys with multiple smart devices at the same time. Thirdly, we prove the protocol’s security under the Real-or-Random (ROR) model. In addition, we perform formal security verification of the protocol using the Automated Validation of Internet Security Protocols and Applications(AVISPA) tool. Finally, the security and efficiency of this solution are superior to similar solutions. Specifically, our solution can meet 18 security and functionality requirements. Compared with the latest similar scheme, assuming that the number of smart devices is 10, our scheme reduces the computational cost by 75.75%. At the same time, in terms of comm

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Cyber-Security Knowledge Graph Generation by Hierarchical Nonnegative Matrix Factorization

arXiv

引用

arXiv 2024年

作者： Barron, Ryan Eren, Maksim E. Bhattarai, Manish Wanna, Selma Solovyev, Nicholas Rasmussen, Kim Alexandrov, Boian S. Nicholas, Charles Matuszek, Cynthia Theoretical Division Los Alamos National Laboratory Los Alamos United States Advanced Research in Cyber Systems Los Alamos National Laboratory Los Alamos United States Department of Computer Science and Electrical Engineering University of Maryland Baltimore CountyMD United States

Much of human knowledge in cybersecurity is encapsulated within the ever-growing volume of scientific papers. As this textual data continues to expand, the importance of document organization methods becomes increasingly crucial for extracting actionable insights hidden within large text datasets. Knowledge Graphs (KGs) serve as a means to store factual information in a structured manner, providing explicit, interpretable knowledge that includes domain-specific information from the cybersecurity scientific literature. One of the challenges in constructing a KG from scientific literature is the extraction of ontology from unstructured text. In this paper, we address this topic and introduce a method for building a multi-modal KG by extracting structured ontology from scientific papers. We demonstrate this concept in the cybersecurity domain. One modality of the KG represents observable information from the papers, such as the categories in which they were published or the authors. The second modality uncovers latent (hidden) patterns of text extracted through hierarchical and semantic non-negative matrix factorization (NMF), such as named entities, topics or clusters, and keywords. We illustrate this concept by consolidating more than two million scientific papers uploaded to arXiv into the cyber-domain, using hierarchical and semantic NMF, and by building a cyber-domain-specific KG. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Binary Bleed: Fast Distributed and Parallel Method for Automatic Model Selection

arXiv

引用

arXiv 2024年

作者： Barron, Ryan Eren, Maksim E. Bhattarai, Manish Boureima, Ismael Matuszek, Cynthia Alexandrov, Boian S. Theoretical Division Los Alamos National Laboratory Los Alamos United States Advanced Research in Cyber Systems Los Alamos National Laboratory Los Alamos United States Department of Computer Science and Electrical Engineering University of Maryland Baltimore CountyMD United States

In several Machine Learning (ML) clustering and dimensionality reduction approaches, such as non-negative matrix factorization (NMF), RESCAL, and K-Means clustering, users must select a hyper-parameter k to define the number of clusters or components that yield an ideal separation of samples or clean clusters. This selection, while difficult, is crucial to avoid overfitting or underfitting the data. Several ML applications use scoring methods (e.g., Silhouette and Davies Boulding scores) to evaluate the cluster pattern stability for a specific k. The score is calculated for different trials over a range of k, and the ideal k is heuristically selected as the value before the model starts overfitting, indicated by a drop or increase in the score resembling an elbow curve plot. While the grid-search method can be used to accurately find a good k value, visiting a range of k can become time-consuming and computationally resource-intensive. In this paper, we introduce the Binary Bleed method based on binary search, which significantly reduces the k search space for these grid-search ML algorithms by truncating the target k values from the search space using a heuristic with thresholding over the scores. Binary Bleed is designed to work with single-node serial, single-node multi-processing, and distributed computing resources. In our experiments, we demonstrate the reduced search space gain over a naive sequential search of the ideal k and the accuracy of the Binary Bleed in identifying the correct k for NMFk, K-Means pyDNMFk, and pyDRESCALk with Silhouette and Davies Boulding scores. We make our implementation of Binary Bleed for the NMF algorithm available on GitHub. Copyright © 2024, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Deep Subspace Encoders for Nonlinear System Identification

arXiv

引用

arXiv 2022年

作者： Beintema, Gerben I. Schoukens, Maarten Toth, Roland Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

Using Artificial Neural Networks (ANN) for nonlinear system identification has proven to be a promising approach, but despite of all recent research efforts, many practical and theoretical problems still remain open. Specifically, noise handling and models, issues of consistency and reliable estimation under minimisation of the prediction error are the most severe problems. The latter comes with numerous practical challenges such as explosion of the computational cost in terms of the number of data samples and the occurrence of instabilities during optimization. In this paper, we aim to overcome these issues by proposing a method which uses a truncated prediction loss and a subspace encoder for state estimation. The truncated prediction loss is computed by selecting multiple truncated subsections from the time series and computing the average prediction loss. To obtain a computationally efficient estimation method that minimizes the truncated prediction loss, a subspace encoder represented by an artificial neural network is introduced. This encoder aims to approximate the state reconstructability map of the estimated model to provide an initial state for each truncated subsection given past inputs and outputs. By theoretical analysis, we show that, under mild conditions, the proposed method is locally consistent, increases optimization stability, and achieves increased data efficiency by allowing for overlap between the subsections. Lastly, we provide practical insights and user guidelines employing a numerical example and state-of-the-art benchmark results. © 2022, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Uncertainty Quantification and Quality Control for Heatmap-based Landmark Detection Models

引用

IEEE Transactions on Medical Imaging 2025年

作者： Feng, Yong Yang, Jinzhu Tang, Lingzhi Sun, Song Wang, Yonghuai Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang China Northeastern University School of Computer Science and Engineering Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China The First Hospital of China Medical University Department of Cardiovascular Ultrasound Shenyang China

Uncertainty quantification is a vital aspect of explainable artificial intelligence that fosters clinician trust in medical applications and facilitates timely interventions, leading to safer and more reliable outcomes. Although deep learning models have reached clinically acceptable accuracy in anatomical landmark detection, their predictions remain susceptible to contextual noise due to the small size of the target structures, making uncertainty quantification more challenging than in classification and segmentation tasks. This paper presents an end-to-end uncertainty quantification method tailored for heatmapbased anatomical landmark detection models, designed to improve both interpretability and controllability in clinical applications. Leveraging Dempster-Shafer Theory and Subjective Logic Theory, we implement probability assignment and uncertainty quantification through a single forward pass to ensure computational efficiency. We introduce an evidence map that captures the strength of landmark evidence, alongside an uncertainty map that calibrates predicted probabilities within the Subjective Logic framework. The interaction between these two components, facilitated by a cross-attention mechanism, further improves landmark detection accuracy and enhances the effectiveness of uncertainty quantification. Experimental results demonstrate that the proposed method maintains detection accuracy, even in noisy environments, while outperforming state-of-the-art methods in terms of uncertainty quantification and quality control. Furthermore, the model effectively identifies out-of-distribution data solely through calibrated probabilities when encountering inconsistencies in multi-center data and novel data, underscoring its potential for clinical applications. © 1982-2012 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Fixed-time Adaptive Neural Control for Physical Human-Robot Collaboration with Time-Varying Workspace Constraints

arXiv

引用

arXiv 2023年

作者： Sun, Yuzhu Van, Mien McIlvanna, Stephen Nhat, Nguyen Minh McLoone, Seán Ceglarek, Dariusz Ge, Shuzhi Sam The Centre for Intelligent Autonomous Manufacturing Systems School of Electronics Electrical Engineering and Computer Science Queen’s University Northern Ireland Belfast United Kingdom The Warwick Manufacturing Group University of Warwick Coventry United Kingdom The Department of Electrical and Computer Engineering Social Robotics Laboratory National University of Singapore Singapore

Physical human-robot collaboration (pHRC) requires both compliance and safety guarantees since robots coordinate with human actions in a shared workspace. This paper presents a novel fixed-time adaptive neural control methodology for handling time-varying workspace constraints that occur in physical human-robot collaboration while also guaranteeing compliance during intended force interactions. The proposed methodology combines the benefits of compliance control, time-varying integral barrier Lyapunov function (TVIBLF) and fixed-time techniques, which not only achieve compliance during physical contact with human operators but also guarantee time-varying workspace constraints and fast tracking error convergence without any restriction on the initial conditions. Furthermore, a neural adaptive control law is designed to compensate for the unknown dynamics and disturbances of the robot manipulator such that the proposed control framework is overall fixed-time converged and capable of online learning without any prior knowledge of robot dynamics and disturbances. The proposed approach is finally validated on a simulated two-link robot manipulator. Simulation results show that the proposed controller is superior in the sense of both tracking error and convergence time compared with the existing barrier Lyapunov functions based controllers, while simultaneously guaranteeing compliance and safety. Copyright © 2023, The Authors. All rights reserved.

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

BLTESTI: Benchmarking Lightweight TinyJAMBU on Embedded systems for Trusted IoT

BLTESTI: Benchmarking Lightweight TinyJAMBU on Embedded Syst...

引用

IEEE International SOC Conference

作者： Mohamed El-Hadedy Russell Hua Shahzman Saqib Kazutomo Yoshii Wen-Mei Hwu Martin Margala Department of Electrical and Computer Engineering California State Polytechnic University Pomona USA Coordinated Science Laboratory University of Illinois at Urbana-Champaign USA College of Computing University of Louisiana at Lafayette Louisiana USA Argonne National Laboratory Lemont Illinois USA

Embedded systems face an increasing number of attacks, necessitating improved security measures. However, the physical constraints of these devices often limit the use of traditional cryptographic techniques. To address this challenge, NIST organized a competition focused on lightweight cryptographic algorithms (LWC) tailored for embedded systems, aiming to minimize resource usage in low-power devices. This paper benchmarks the Rust, C, and Golang programming languages, considering their advantages in memory safety, portability, and concurrency, to implement the LWC algorithm finalist named TinyJAMBU. TinyJAMBU utilizes the non-linear feedback shift register (NLFSR) model as a core security element. The evaluation is conducted on embedded systems and FPGAs to determine the optimal strategy for mapping LWC cryptographic algorithms onto resource-constrained devices. Among the three languages, the C-based implementation achieves the highest runtime efficiency, while TinyGo demonstrates the lowest power consumption. Rust falls between the two, indicating trade-offs associated with each language. Despite its larger memory footprint of 73kB, the C-based implementation of TinyJAMBU outperforms other language implementations, achieving a faster runtime of ≈ 81 seconds for the same algorithm and 4-byte message size. Golang exhibits the smallest memory footprint of 19kB, while Rust’s memory footprint falls between the other two at 66kB. Furthermore, implementing TinyJAMBU on an FPGA using software-hardware partitioning with MicroBlaze takes ≈ 6.30 seconds to complete 10,000 encryption and decryption cycles, consuming around 1.09W of power. Although employing a proposed NLFSR co-processor with MicroBlaze for the 128-bit version of TinyJAMBU may not be the fastest approach, the reconfigurable nature of FPGAs allows for replicating the co-processor multiple times, offering significant advantages over the current state-of-the-art architecture of embedded systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RECO-LFSR: Reconfigurable Low-power Cryptographic processor based on LFSR for Trusted IoT platforms

RECO-LFSR: Reconfigurable Low-power Cryptographic processor ...

引用

IEEE International Symposium on Quality Electronic Design

作者： Mohamed El-Hadedy Russell Hua Kazutomo Yoshii Wen-Mei Hwu Martin Margala Department of Electrical and Computer Engineering California State Polytechnic University Pomona USA Coordinated Science Laboratory University of Illinois at Urbana-Champaign USA College of Computing University of Louisiana at Lafayette Louisiana USA Argonne National Laboratory Lemont Illinois USA

Today we see lightweight computer hardware utilized in large volumes, especially with the growing use of IoT devices in homes. However, such devices often ignore security until it is too late and sensitive data breaches have *** here, the importance of finding lightweight cryptographic primitives to secure IoT devices is exponentially increasing, while not impacting the limited resources and limitation of the battery lifetime. In the search for a lightweight cryptographic standard, one must consider how to implement such algorithms optimally. For example, certain parts of an algorithm might be faster in hardware than in software and vice *** paper presents a hardware extension supporting the MicroBlaze softcore processor to efficiently implement one of the Lightweight Cryptography (LWC) finalists (TinyJAMBU) on Digilent Nexys A7-100T. The proposed hardware extension consists of a reconfigurable Non-Linear Feedback Shift Register (NLFSR), the central computing part for the authenticated encryption with associated data (AEAD) TinyJAMBU. The proposed NLFSR can run different variants of TinyJAMBU while only consuming 186 mWh in just ten minutes at 100 MHz. The total resources needed to host the proposed NLFSR on the FPGA are 610 LUT and 505 Flip-Flops while executable the binary size is 352 bytes smaller. Therefore, the proposed solution based on the hardware extension is x2.17 times faster than the pure software implementation of the whole TinyJAMBU using MicroBlaze while consuming six mWh more. To our knowledge, this is the first implementation of TinyJAMBU using software/hardware partitioning on FPGA with the softcore processor MicroBlaze.

关键词： Microprocessors Software algorithms Shift registers Hardware Software Table lookup Internet of Things

来源：评论

学校读者我要写书评

暂无评论

FIRE: A Dataset for Feedback Integration and Refinement Evaluation of Multimodal Models

arXiv

引用

arXiv 2024年

作者： Li, Pengxiang Gao, Zhi Zhang, Bofei Yuan, Tao Wu, Yuwei Harandi, Mehrtash Jia, Yunde Zhu, Song-Chun Li, Qing Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China State Key Laboratory of General Artificial Intelligence BIGAI China State Key Laboratory of General Artificial Intelligence Peking University China Department of Electrical and Computer System Engineering Monash University Australia Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Automation Tsinghua University China

Vision language models (VLMs) have achieved impressive progress in diverse applications, becoming a prevalent research direction. In this paper, we build FIRE, a feedback-refinement dataset, consisting of 1.1M multi-turn conversations that are derived from 27 source datasets, empowering VLMs to spontaneously refine their responses based on user feedback across diverse tasks. To scale up the data collection, FIRE is collected in two components: FIRE-100K and FIRE-1M, where FIRE-100K is generated by GPT-4V, and FIRE-1M is freely generated via models trained on FIRE-100K. Then, we build FIRE-Bench, a benchmark to comprehensively evaluate the feedback-refining capability of VLMs, which contains 11K feedback-refinement conversations as the test data, two evaluation settings, and a model to provide feedback for VLMs. We develop the FIRE-LLaVA model by fine-tuning LLaVA on FIRE-100K and FIRE-1M, which shows remarkable feedback-refining capability on FIRE-Bench and outperforms untrained VLMs by 50%, making more efficient user-agent interactions and underscoring the significance of the FIRE dataset. Copyright © 2024, The Authors. All rights reserved.

关键词： Fireclay

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. The Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multi-player non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. Copyright © 2024, The Authors. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：