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

A Provably Secure and Lightweight Access Control Protocol for EI-Based Vehicle to Grid Environment

IEEE Internet of Things Journal 2023年第18期10卷 16650-16657页

作者： Shamshad, Salman Mahmood, Khalid Shamshad, Usman Hussain, Ibrar Hussain, Shafiq Das, Ashok Kumar The University of Lahore Department of Software Engineering Lahore54590 Pakistan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan Riphah International University Riphah School of Computing and Innovation Lahore54000 Pakistan University of Sahiwal Department of Computer Science Sahiwal57000 Pakistan International Institute of Information Technology Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India Old Dominion University Virginia Modeling Analysis and Simulation Center SuffolkVA23435 United States

The energy Internet (EI) presents a novel paradigm for renewable energy distribution that utilizes communication and computing technologies to revolutionize the conventional intelligent transportation systems (ITSs) and power grid into a structure that provides assistance to open innovation. The EI offers sustainable and bidirectional transmission for the improvement and analysis of energy convention among electric vehicles (EVs) and service providers. To ensure efficient, reliable, and secure operation, EI must be safe from security attacks. Therefore, efficient and secure key negotiation is a significant issue for the EI-based Vehicle-to-Grid (V2G) architecture. Thus, to ensure the system's security, we have devised a robust scheme to facilitate a secure key agreement between the entities involved for the secure and efficient renewable energy distribution for the EI-based energy vehicles in V2G. The devised scheme's robustness is solicited through the widely accepted formal random or real (RoR) model. In addition, the informal security analysis is conducted on the devised scheme, which is evident that the designed scheme achieves all the required security features of EI-based ITS. Moreover, the performance evaluation results endorse that the designed scheme achieves the desired security and minimizes the communication, computation, and energy overhead by 29.33%, 27.94%, and 28.08% in comparison to the existing competitive schemes. © 2014 IEEE.

关键词： Vehicle-to-grid

来源：评论

学校读者我要写书评

暂无评论

APT Adversarial Defence Mechanism for Industrial IoT Enabled Cyber-Physical System

引用

IEEE Access 2023年 11卷 74000-74020页

作者： Javed, Safdar Hussain Ahmad, Maaz Bin Asif, Muhammad Akram, Waseem Mahmood, Khalid Das, Ashok Kumar Shetty, Sachin College of Computing and Information Sciences Karachi75190 Pakistan Lahore Garrison University Department of Computer Science Lahore54810 Pakistan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan International Institute of Information Technology at Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India Old Dominion University Simulation and Visualization Engineering Virginia Modeling Analysis and Simulation Center Department of Modeling SuffolkVA23435 United States Old Dominion University Center for Cybersecurity Education and Research SuffolkVA23435 United States

The objective of Advanced Persistent Threat (APT) attacks is to exploit Cyber-Physical Systems (CPSs) in combination with the Industrial Internet of Things (I-IoT) by using fast attack methods. Machine learning (ML) techniques have shown potential in identifying APT attacks in autonomous and malware detection systems. However, detecting hidden APT attacks in the I-IoT-enabled CPS domain and achieving real-time accuracy in detection present significant challenges for these techniques. To overcome these issues, a new approach is suggested that is based on the Graph Attention Network (GAN), a multi-dimensional algorithm that captures behavioral features along with the relevant information that other methods do not deliver. This approach utilizes masked self-attentional layers to address the limitations of prior Deep Learning (DL) methods that rely on convolutions. Two datasets, the DAPT2020 malware, and Edge I-IoT datasets are used to evaluate the approach, and it attains the highest detection accuracy of 96.97% and 95.97%, with prediction time of 20.56 seconds and 21.65 seconds, respectively. The GAN approach is compared to conventional ML algorithms, and simulation results demonstrate a significant performance improvement over these algorithms in the I-IoT-enabled CPS realm. © 2013 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Blockchain and PUF-based secure key establishment protocol for cross-domain digital twins in industrial Internet of Things architecture

引用

Journal of Advanced Research 2024年 62卷 155-163页

作者： Mahmood, Khalid Shamshad, Salman Saleem, Muhammad Asad Kharel, Rupak Das, Ashok Kumar Shetty, Sachin Rodrigues, Joel J.P.C. School of Psychology and Computer Science University of Central Lancashire Preston United Kingdom Graduate School of Intelligent Data Science National Yunlin University of Science and Technology Yunlin 64002 Taiwan Department of Software Engineering The University of Lahore Lahore 54590 Pakistan Department of Computer Science University of Sahiwal Punjab Sahiwal 57000 Pakistan Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500 032 India Department of Modeling Simulation and Visualization Engineering Virginia Modeling Analysis and Simulation Center and Center for Cybersecurity Education and Research Old Dominion University Suffolk 23435 VA United States COPELABS Lusófona University Campo Grande 376 Lisbon 1749-024 Portugal

Introduction: The Industrial Internet of Things (IIoT) is a technology that connects devices to collect data and conduct in-depth analysis to provide value-added services to industries. The integration of the physical and digital domains is crucial for unlocking the full potential of the IIoT, and digital twins can facilitate this integration by providing a virtual representation of real-world entities. Objectives: By combining digital twins with the IIoT, industries can simulate, predict, and control physical behaviors, enabling them to achieve broader value and support industry 4.0 and 5.0. Constituents of cooperative IIoT domains tend to interact and collaborate during their complicated operations. Methods: To secure such interaction and collaborations, we introduce a blockchain-based cross-domain authentication protocol for IIoT. The blockchain maintains only each domain's dynamic accumulator, which accumulates crucial materials derived from devices, decreasing the overhead. In addition, we use the on-chain accumulator to effectively validate the unlinkable identities of cross-domain IIoT devices. Results: The implementation of the concept reveals the fact that our protocol is efficient and reliable. This efficiency and reliability of our protocol is also substantiated through comparison with state-of-the-art literature. In contrast to related protocols, our protocol exhibits a minimum 22.67% increase in computation cost efficiency and a 16.35% rise in communication cost efficiency. Conclusion: The developed protocol guarantees data transfer security across the domain and thwarts IoT devices from potential physical attacks. Additionally, in order to protect privacy, anonymity and unlinkability are also guaranteed. © 2024

关键词： Digital twins Industrial Internet of Things (IIoT) Key agreement Mutual authentication Physically Unclonable Functions (PUFs)

来源：评论

学校读者我要写书评

暂无评论

Sharing data with guaranteed privacy

Sharing data with guaranteed privacy

引用

European Conference on Machine Learning, ECML 1989

作者： Siebes, Arno Algorithmic Data Analysis Group Universiteit Utrecht Utrecht Netherlands

ISBN: (纸本)9783319417059

Big data is both a curse and a blessing. A blessing because the unprecedented amount of detailed data allows for research in, e.g., social sciences and health on scales that were until recently unimaginable. A curse, e.g., because of the risk that such - often very private - data leaks out though hacks or by other means causing almost unlimited harm to the individual. To neutralize the risks while maintaining the benefits, we should be able to randomize the data in such a way that the data at the individual level is random, while statistical models induced from the randomized data are indistinguishable from the same models induced from the original data. In this paper we first analyse the risks in sharing micro data - as statisticians tend to call it - even if it is anonymized, discretized, grouped, and perturbed. Next we quasi-formalize the kind of randomization we are after and argue why it is safe to share such data. Unfortunately, it is not clear that such randomizations of data sets exist. We briefly discuss why, if they exist at all, will be hard to find. Next I explain why I think they do exist and can be constructed by showing that the code tables computed by, e.g., Krimp are already close to what we would like to achieve. Thus making privacy safe sharing of micro-data possible. © Springer International Publishing Switzerland 2016.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Queries for data analysis

Queries for data analysis

引用

11th International Symposium on Intelligent data analysis, IDA 2012

作者： Siebes, Arno Algorithmic Data Analysis Group Universiteit Utrecht Netherlands

ISBN: (纸本)9783642341557

If we view data as a set of queries with an answer, what would a model be? In this paper we explore this question. The motivation is that there are more and more kinds of data that have to be analysed. data of such a diverse nature that it is not easy to define precisely what data analysis actually is. Since all these different types of data share one characteristic - they can be queried - it seems natural to base a notion of data analysis on this characteristic. The discussion in this paper is preliminary at best. There is no attempt made to connect the basic ideas to other - well known - foundations of data analysis. Rather, it just explores some simple consequences of its central tenet: data is a set of queries with their answer. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Diverse subgroup set discovery

Diverse subgroup set discovery

引用

作者： Van Leeuwen, Matthijs Knobbe, Arno Machine Learning Department of Computer Science Katholieke Universiteit Leuven Leuven Belgium Algorithmic Data Analysis Department of Information and Computer Sciences Universiteit Utrecht Utrecht Netherlands Leiden Institute of Advanced Computer Science Universiteit Leiden Leiden Netherlands

Large data is challenging for most existing discovery algorithms, for several reasons. First of all, such data leads to enormous hypothesis spaces, making exhaustive search infeasible. Second, many variants of essentially the same pattern exist, due to (numeric) attributes of high cardinality, correlated attributes, and so on. This causes top-k mining algorithms to return highly redundant result sets, while ignoring many potentially interesting results. These problems are particularly apparent with subgroup discovery (SD) and its generalisation, exceptional model mining. To address this, we introduce subgroup set discovery: one should not consider individual subgroups, but sets of subgroups. We consider three degrees of redundancy, and propose corresponding heuristic selection strategies in order to eliminate redundancy. By incorporating these (generic) subgroup selection methods in a beam search, the aim is to improve the balance between exploration and exploitation. The proposed algorithm, dubbed DSSD for diverse subgroup set discovery, is experimentally evaluated and compared to existing approaches. For this, a variety of target types with corresponding datasets and quality measures is used. The subgroup sets that are discovered by the competing methods are evaluated primarily on the following three criteria: (1) diversity in the subgroup covers (exploration), (2) the maximum quality found (exploitation), and (3) runtime. The results show that DSSD outperforms each traditional SD method on all or a (non-empty) subset of these criteria, depending on the specific setting. The more complex the task, the larger the benefit of using our diverse heuristic search turns out to be. © The Author(s) 2012.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

An experimental comparison of different inclusion relations in frequent tree mining

An experimental comparison of different inclusion relations ...

引用

作者： De Knijf, Jeroen Feelders, Ad Algorithmic Data Analysis Group Department of Information and Computing Sciences Universiteit Utrecht PO Box 80.089 3508 TB Utrecht Netherlands

In recent years a variety of mining algorithms, to derive all frequent subtrees from a database of labeled ordered rooted trees has been developed. These algorithms share properties such as enumeration strategies and pruning techniques. They differ however in the tree inclusion relation used and the way attribute values are dealt with. In this work we investigate the different approaches with respect to 'usefulness' of the derived patterns, in particular, the performance of classifiers that use the derived patterns as features. In order to find a good trade-off between expressiveness and runtime performance of the different approaches, we also take the complexity of the different classifiers into account, as well as the run time and memory usage of the different approaches. The experiments are performed on two real data sets, and two synthetic data sets. The results show that significant improvement in both predictive performance and computational efficiency can be gained by choosing the right tree mining approach.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：