首页 > 最新文献

Frontiers in Computer Science最新文献

英文 中文
Cybersecurity for Industry 5.0: trends and gaps 工业 5.0 的网络安全:趋势与差距
Pub Date : 2024-07-26 DOI: 10.3389/fcomp.2024.1434436
Ravdeep Kour, Ramin Karim, Pierre Dersin, Naveen Venkatesh
Industry 5.0 promises to revolutionize the industry by focusing on human-centric, sustainability, and resilience empowered by emerging technologies such as Artificial Intelligence (AI) and digitalization. This paradigm shift is expected to bring significant advancements in sustainability, resilience, productivity, effectiveness, efficiency, customization, reliability, safety, security, maintainability etc. However, this shift of the industrial paradigm introduces substantial cybersecurity challenges due to the increased attack surface and data sensitivity. Therefore, the objective of this paper is to conduct a thorough literature review of the recent research on cybersecurity in Industry 5.0, highlighting emerging trends, gaps, and potential solutions. To conduct this research, the authors have applied the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology to investigate cybersecurity solutions in Industry 5.0. The findings reveal that conceptual research dominates, with AI, Blockchain, and Internet of Things (IoT) most prevalent but highlights a gap in linking cybersecurity to resilience and sustainability. Furthermore, the paper aims to present trends in cybersecurity research with more relevant results from 2022 to 2024. It conducts a thorough review of the literature, highlighting the evolving landscape of cybersecurity applications in Industry 5.0.
在人工智能(AI)和数字化等新兴技术的推动下,工业 5.0 将重点关注以人为本、可持续性和复原力,从而有望彻底改变整个行业。预计这一范式的转变将在可持续性、复原力、生产力、有效性、效率、定制化、可靠性、安全性、安全性、可维护性等方面带来重大进步。然而,由于攻击面和数据敏感性的增加,这种工业范式的转变带来了巨大的网络安全挑战。因此,本文旨在对近期有关工业 5.0 网络安全的研究进行全面的文献综述,突出强调新兴趋势、差距和潜在解决方案。为了开展这项研究,作者采用了系统综述和元分析首选报告项目(PRISMA)方法来调查工业 5.0 中的网络安全解决方案。研究结果表明,概念性研究占主导地位,其中人工智能、区块链和物联网(IoT)最为普遍,但在将网络安全与复原力和可持续性联系起来方面存在差距。此外,本文还旨在介绍网络安全研究的趋势,以及 2022 年至 2024 年的更多相关成果。本文对文献进行了全面回顾,重点介绍了工业 5.0 中网络安全应用的演变情况。
{"title":"Cybersecurity for Industry 5.0: trends and gaps","authors":"Ravdeep Kour, Ramin Karim, Pierre Dersin, Naveen Venkatesh","doi":"10.3389/fcomp.2024.1434436","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1434436","url":null,"abstract":"Industry 5.0 promises to revolutionize the industry by focusing on human-centric, sustainability, and resilience empowered by emerging technologies such as Artificial Intelligence (AI) and digitalization. This paradigm shift is expected to bring significant advancements in sustainability, resilience, productivity, effectiveness, efficiency, customization, reliability, safety, security, maintainability etc. However, this shift of the industrial paradigm introduces substantial cybersecurity challenges due to the increased attack surface and data sensitivity. Therefore, the objective of this paper is to conduct a thorough literature review of the recent research on cybersecurity in Industry 5.0, highlighting emerging trends, gaps, and potential solutions. To conduct this research, the authors have applied the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology to investigate cybersecurity solutions in Industry 5.0. The findings reveal that conceptual research dominates, with AI, Blockchain, and Internet of Things (IoT) most prevalent but highlights a gap in linking cybersecurity to resilience and sustainability. Furthermore, the paper aims to present trends in cybersecurity research with more relevant results from 2022 to 2024. It conducts a thorough review of the literature, highlighting the evolving landscape of cybersecurity applications in Industry 5.0.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"5 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141799417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Device-enabled neighborhood-slot allocation for the edge-oriented Internet of Things 为面向边缘的物联网分配支持设备的邻里插槽
Pub Date : 2024-07-26 DOI: 10.3389/fcomp.2024.1343778
Rahim Khan, Mushtaq Khan, Nadir Shah, Amal Al-Rasheed, Aftab Ahmad Khan
Internet of Things (IoT) has become an interesting research domain as numerous devices, preferably equipped with sensors, communication, and actuator modules, are deployed to capture real-time data in the different application areas, such as smart healthcare and industries. These devices have the built-in capacity to directly interact with the physical phenomenon and report any unusual situation within their respective coverage areas, i.e., monitoring a critical patient in the smart hospital but direct communication with a common destination module is not guaranteed and could possibly be very challenging if two or more devices, preferably those in closed proximity, are interested to transmit simultaneously. Therefore, in this manuscript, we are going to present a hybrid slot allocation approach, which is specifically designed for those devices resided in neighborhood and are eager to communication concurrently with a common destination device, i.e., server. In the beginning, the k-mean clustering algorithm is used to group these devices into clusters where server is forced to collect data from devices deployed in the respective coverage areas. Thus, every server generates dedicated slots for active devices and an additional slot for server(s). Similarly, the proposed neighborhood-enabled time division multiple access (TDMA) has the flexibility of assigning multiple slots to a requesting device if available, which is needed in scenarios, such as detection of pest in the field. Additionally, a member device is allowed to migrate (if needed and possible) from one server's coverage region to another. Simulation results confirmed that the proposed approach is better than the existing algorithms (opportunistic TDMA, hybrid TDMA, and non-orthogonal multiple access), particularly in terms of bandwidth, end-to-end delay, and empty slot utilization. The proposed scheme has improved bandwidth and empty slot utilization, which are approximately 15% and 12%, respectively, whereas it has achieved approximately 94.89% utilization of the available slots which was previously 93.4%.
物联网(IoT)已成为一个有趣的研究领域,因为在不同的应用领域,如智能医疗和工业领域,部署了大量设备(最好配备传感器、通信和执行器模块)来捕捉实时数据。这些设备具有与物理现象直接交互的内置能力,可在各自的覆盖范围内报告任何异常情况,例如,在智能医院中监测危重病人,但与共同目标模块的直接通信却无法保证,如果两个或更多设备(最好是距离较近的设备)有兴趣同时传输数据,则可能非常具有挑战性。因此,在本手稿中,我们将介绍一种混合时隙分配方法,该方法专为那些居住在邻近地区并渴望与共同目标设备(即服务器)同时通信的设备而设计。一开始,我们使用 k-mean 聚类算法将这些设备分组,服务器被迫从部署在各自覆盖区域内的设备收集数据。因此,每个服务器都会为活动设备生成专用插槽,并为服务器生成额外的插槽。同样,建议的邻区分时多路存取(TDMA)可以灵活地为请求设备分配多个可用时隙,这在现场虫害检测等场景中是必需的。此外,还允许成员设备从一个服务器的覆盖区域迁移到另一个服务器的覆盖区域(如果需要和可能的话)。仿真结果证实,建议的方法优于现有算法(机会式 TDMA、混合 TDMA 和非正交多址接入),特别是在带宽、端到端延迟和空时利用率方面。拟议方案提高了带宽和空时隙利用率,分别约为 15%和 12%,同时实现了约 94.89% 的可用时隙利用率,而之前的利用率为 93.4%。
{"title":"Device-enabled neighborhood-slot allocation for the edge-oriented Internet of Things","authors":"Rahim Khan, Mushtaq Khan, Nadir Shah, Amal Al-Rasheed, Aftab Ahmad Khan","doi":"10.3389/fcomp.2024.1343778","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1343778","url":null,"abstract":"Internet of Things (IoT) has become an interesting research domain as numerous devices, preferably equipped with sensors, communication, and actuator modules, are deployed to capture real-time data in the different application areas, such as smart healthcare and industries. These devices have the built-in capacity to directly interact with the physical phenomenon and report any unusual situation within their respective coverage areas, i.e., monitoring a critical patient in the smart hospital but direct communication with a common destination module is not guaranteed and could possibly be very challenging if two or more devices, preferably those in closed proximity, are interested to transmit simultaneously. Therefore, in this manuscript, we are going to present a hybrid slot allocation approach, which is specifically designed for those devices resided in neighborhood and are eager to communication concurrently with a common destination device, i.e., server. In the beginning, the k-mean clustering algorithm is used to group these devices into clusters where server is forced to collect data from devices deployed in the respective coverage areas. Thus, every server generates dedicated slots for active devices and an additional slot for server(s). Similarly, the proposed neighborhood-enabled time division multiple access (TDMA) has the flexibility of assigning multiple slots to a requesting device if available, which is needed in scenarios, such as detection of pest in the field. Additionally, a member device is allowed to migrate (if needed and possible) from one server's coverage region to another. Simulation results confirmed that the proposed approach is better than the existing algorithms (opportunistic TDMA, hybrid TDMA, and non-orthogonal multiple access), particularly in terms of bandwidth, end-to-end delay, and empty slot utilization. The proposed scheme has improved bandwidth and empty slot utilization, which are approximately 15% and 12%, respectively, whereas it has achieved approximately 94.89% utilization of the available slots which was previously 93.4%.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"35 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141800602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
High-quality implementation for a continuous-in-time financial API in C# 用 C# 实现高质量的连续实时金融 API
Pub Date : 2024-07-25 DOI: 10.3389/fcomp.2024.1371052
Tarik Chakkour
In recent years, there has been a rising interest in potentially complex software and financial industries with applications in many engineering fields. With this rise comes a host of developing a usable and consistent Application Programming Interface (API). Prioritize designing and building the software ensures to enrich the platform and emphasize inventorying APIs. In this paper, we proposed a high-quality API to implement the continuous-in-time financial model. The existing discrete framework cannot be evaluated at any time period, involving drawbacks in operating the data structures. Then, the continuous framework is implemented based on the measure theory paradigm. Our proposal uses mathematical modeling, which consists of some objects as measures and fields. It is suitable to develop this API in C# to provide the requirement quality in programming language professionally. This also integrates demands, codes, and verification in the system development life cycle. The advantages are aimed at increasing the structuring and readability. The presented work provides an overview of the design, implementation, testing, and delivery aspects of the API, highlighting the importance of architecture, testing, and numerical choices. The article gives an overview of the API by describing the implementation concerning the data structures and algorithms. These algorithms are based on using the Task Parallel Library (TPL) that makes the API easier and more fruitful for data parallel to benefit from the advantages provided by the .NET Framework.
近年来,潜在的复杂软件和金融行业在许多工程领域的应用日益受到关注。随之而来的是开发可用且一致的应用程序接口(API)。优先设计和构建软件确保丰富平台,并强调盘点 API。在本文中,我们提出了一种高质量的应用程序接口(API)来实现连续-实时财务模型。现有的离散框架无法在任何时间段进行评估,存在数据结构操作上的弊端。然后,基于度量理论范式实现连续框架。我们的建议使用数学建模,其中包括一些作为度量和字段的对象。该应用程序接口适合用 C# 开发,以提供专业编程语言的需求质量。这也将需求、代码和验证整合到了系统开发生命周期中。其优势在于提高结构化和可读性。本文概述了应用程序接口的设计、实施、测试和交付方面,强调了架构、测试和数值选择的重要性。文章通过描述有关数据结构和算法的实现,对应用程序接口进行了概述。这些算法基于任务并行库(TPL)的使用,TPL 使应用程序接口更容易、更富有成效地实现数据并行,从而受益于.NET 框架提供的优势。
{"title":"High-quality implementation for a continuous-in-time financial API in C#","authors":"Tarik Chakkour","doi":"10.3389/fcomp.2024.1371052","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1371052","url":null,"abstract":"In recent years, there has been a rising interest in potentially complex software and financial industries with applications in many engineering fields. With this rise comes a host of developing a usable and consistent Application Programming Interface (API). Prioritize designing and building the software ensures to enrich the platform and emphasize inventorying APIs. In this paper, we proposed a high-quality API to implement the continuous-in-time financial model. The existing discrete framework cannot be evaluated at any time period, involving drawbacks in operating the data structures. Then, the continuous framework is implemented based on the measure theory paradigm. Our proposal uses mathematical modeling, which consists of some objects as measures and fields. It is suitable to develop this API in C# to provide the requirement quality in programming language professionally. This also integrates demands, codes, and verification in the system development life cycle. The advantages are aimed at increasing the structuring and readability. The presented work provides an overview of the design, implementation, testing, and delivery aspects of the API, highlighting the importance of architecture, testing, and numerical choices. The article gives an overview of the API by describing the implementation concerning the data structures and algorithms. These algorithms are based on using the Task Parallel Library (TPL) that makes the API easier and more fruitful for data parallel to benefit from the advantages provided by the .NET Framework.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"30 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141803544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Editorial: HCI and worker well-being 社论:人机交互与工人福祉
Pub Date : 2024-07-23 DOI: 10.3389/fcomp.2024.1454694
Eva Geurts, Gustavo Alberto Rovelo Ruiz, Kris Luyten, Philippe Palanque
{"title":"Editorial: HCI and worker well-being","authors":"Eva Geurts, Gustavo Alberto Rovelo Ruiz, Kris Luyten, Philippe Palanque","doi":"10.3389/fcomp.2024.1454694","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1454694","url":null,"abstract":"","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"91 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141812375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extracting typing game keystroke patterns as potential indicators of programming aptitude 提取打字游戏按键模式作为编程能力的潜在指标
Pub Date : 2024-07-22 DOI: 10.3389/fcomp.2024.1412458
Toyohisa Nakada, Motoki Miura
This study attempted to determine whether individuals possess programming aptitude solely based on keystroke information from typing games where participants type computer programs. The participants were students enrolled in university programming courses. The results indicated that using typing speed alone as an indicator achieved an accuracy of 0.71, while employing a custom machine learning model achieved an accuracy of 0.83. Additionally, it was found that individuals with programming aptitude tended to type the enter key relatively slower compared to other keys.
本研究试图仅根据参与者在打字游戏中键入计算机程序的击键信息来确定个人是否具备编程能力。参与者是大学编程课程的学生。结果表明,仅使用打字速度作为指标的准确率为 0.71,而使用自定义机器学习模型的准确率为 0.83。此外,研究还发现,与其他按键相比,具有编程能力的人键入回车键的速度相对较慢。
{"title":"Extracting typing game keystroke patterns as potential indicators of programming aptitude","authors":"Toyohisa Nakada, Motoki Miura","doi":"10.3389/fcomp.2024.1412458","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1412458","url":null,"abstract":"This study attempted to determine whether individuals possess programming aptitude solely based on keystroke information from typing games where participants type computer programs. The participants were students enrolled in university programming courses. The results indicated that using typing speed alone as an indicator achieved an accuracy of 0.71, while employing a custom machine learning model achieved an accuracy of 0.83. Additionally, it was found that individuals with programming aptitude tended to type the enter key relatively slower compared to other keys.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"14 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141816204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A systematic literature review on contemporary and future trends in virtual machine scheduling techniques in cloud and multi-access computing 关于云计算和多访问计算中虚拟机调度技术的当代和未来趋势的系统性文献综述
Pub Date : 2024-07-08 DOI: 10.3389/fcomp.2024.1288552
Nadim Rana, Fathe Jeribi, Zeba Khan, Wagdi Alrawagfeh, Imed Ben Dhaou, Mohammad Haseebuddin, Mueen Uddin
The migration of business and scientific operations to the cloud and the surge in data from IoT devices have intensified the complexity of cloud resource scheduling. Ensuring efficient resource distribution in line with user-specified SLA and QoS demands novel scheduling solutions. This study scrutinizes contemporary Virtual Machine (VM) scheduling strategies, shedding light on the complexities and future prospects of VM design and aims to propel further research by highlighting existing obstacles and untapped potential in the ever-evolving realm of cloud and multi-access edge computing (MEC).Implementing a Systematic Literature Review (SLR), this research dissects VM scheduling techniques. A meticulous selection process distilled 67 seminal studies from an initial corpus of 722, spanning from 2008 to 2022. This critical filtration has been pivotal for grasping the developmental trajectory and current tendencies in VM scheduling practices.The in-depth examination of 67 studies on VM scheduling has produced a taxonomic breakdown into three principal methodologies: traditional, heuristic, and meta-heuristic. The review underscores a marked shift toward heuristic and meta-heuristic methods, reflecting their growing significance in the advancement of VM scheduling.Although VM scheduling has progressed markedly, the focus remains predominantly on metaheuristic and heuristic approaches. The analysis enlightens ongoing challenges and the direction of future developments, highlighting the necessity for persistent research and innovation in this sector.
业务和科学运营向云计算的迁移以及物联网设备数据的激增,加剧了云计算资源调度的复杂性。要确保高效的资源分配符合用户指定的 SLA 和 QoS,就需要新颖的调度解决方案。本研究仔细研究了当代虚拟机(VM)调度策略,揭示了虚拟机设计的复杂性和未来前景,旨在通过强调云计算和多访问边缘计算(MEC)领域不断发展的现有障碍和未开发潜力,推动进一步的研究。通过缜密的筛选过程,从最初的 722 篇文献中提炼出 67 篇开创性研究,时间跨度从 2008 年到 2022 年。通过对 67 篇有关虚拟机调度的研究进行深入研究,将其分类为三种主要方法:传统方法、启发式方法和元启发式方法。虽然虚拟机调度取得了显著进展,但重点仍主要集中在元启发式和启发式方法上。分析揭示了当前的挑战和未来的发展方向,强调了在这一领域进行持续研究和创新的必要性。
{"title":"A systematic literature review on contemporary and future trends in virtual machine scheduling techniques in cloud and multi-access computing","authors":"Nadim Rana, Fathe Jeribi, Zeba Khan, Wagdi Alrawagfeh, Imed Ben Dhaou, Mohammad Haseebuddin, Mueen Uddin","doi":"10.3389/fcomp.2024.1288552","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1288552","url":null,"abstract":"The migration of business and scientific operations to the cloud and the surge in data from IoT devices have intensified the complexity of cloud resource scheduling. Ensuring efficient resource distribution in line with user-specified SLA and QoS demands novel scheduling solutions. This study scrutinizes contemporary Virtual Machine (VM) scheduling strategies, shedding light on the complexities and future prospects of VM design and aims to propel further research by highlighting existing obstacles and untapped potential in the ever-evolving realm of cloud and multi-access edge computing (MEC).Implementing a Systematic Literature Review (SLR), this research dissects VM scheduling techniques. A meticulous selection process distilled 67 seminal studies from an initial corpus of 722, spanning from 2008 to 2022. This critical filtration has been pivotal for grasping the developmental trajectory and current tendencies in VM scheduling practices.The in-depth examination of 67 studies on VM scheduling has produced a taxonomic breakdown into three principal methodologies: traditional, heuristic, and meta-heuristic. The review underscores a marked shift toward heuristic and meta-heuristic methods, reflecting their growing significance in the advancement of VM scheduling.Although VM scheduling has progressed markedly, the focus remains predominantly on metaheuristic and heuristic approaches. The analysis enlightens ongoing challenges and the direction of future developments, highlighting the necessity for persistent research and innovation in this sector.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"119 34","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141666763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mayfly optimistic hyperelliptic curve cryptosystem 蜉蝣乐观超椭圆曲线密码系统
Pub Date : 2024-07-04 DOI: 10.3389/fcomp.2024.1381850
Ramireddy Nava Teja Reddy, M. Kavitha, G. S. Reddy, Amr H. Yousef, K. Aboras, Ahmed Emara, Ch. Rami Reddy
Various applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage. Thus, elliptic curve cryptography (ECC) is a methodology that emerged to overcome this issue using its low computation and generation of small keys with its strong encryption strategy. ECC is becoming mandatory and used mostly for public key encryption protocols. ECC has expanded cumulative acceptance in practice due to the reduced bit magnitude of operands compared to RSA for safety level. Previously, protocols designed for ECC suggested calculation of scalar development and it was accomplished in finite fields as projective, affine, and Jacobian simulations of coordinates. Arithmetic operations in a limited area establish the core benefits of the ECC algorithm. Even though ECC generated an issue of complex key generation using its curve formation, to overcome this issue a hyperelliptic curve cryptosystems (HECC) is proposed in this study. HECC perform ECC in the Public Key Cryptography (PKC) domain. This study presented an optimization-based key generation and made a random selection of integers for encrypting the message. Selecting a prime number as the private key and multiplying it to the encrypted message to generate a public key is done. This encrypted message is mapped to the curve to check whether it satisfies the curve equation or not. Once an encrypted message is obtained, it is then sent to a second party for pursuing the message. On the side of the second party, a reverse process called decryption takes place. Thus, a secured transmission of data communication takes place. Implementing this algorithm in MATLAB resulted in 94% accuracy and an error of 6%, which was a higher performance ratio than previous methods.
各种应用都使用非对称加密技术来确保双方通信的安全,但这也带来了一个主要问题,即需要产生大量的计算和存储。因此,椭圆曲线加密法(ECC)以其低计算量和生成小密钥的强大加密策略克服了这一问题。椭圆曲线加密算法已成为一种强制性加密算法,主要用于公钥加密协议。与 RSA 相比,ECC 减少了操作数的比特量,从而提高了安全等级,因此在实践中被越来越多的人接受。以前,为 ECC 设计的协议建议计算标量发展,它是在有限域中完成的,如坐标的投影、仿射和雅各模拟。有限区域内的算术运算确立了 ECC 算法的核心优势。尽管 ECC 利用其曲线形成产生了复杂的密钥生成问题,但为了克服这一问题,本研究提出了超椭圆曲线密码系统(HECC)。HECC 在公钥密码学(PKC)领域执行 ECC。这项研究提出了一种基于优化的密钥生成方法,并随机选择整数对信息进行加密。选择一个质数作为私钥,然后将其与加密信息相乘,生成一个公钥。将加密信息映射到曲线上,检查它是否满足曲线方程。一旦获得加密信息,就会将其发送给第二方,以便对信息进行追踪。在第二方那边,会进行一个称为解密的反向过程。这样,就实现了数据通信的安全传输。在 MATLAB 中实施该算法后,准确率达到 94%,误差为 6%,比以前的方法具有更高的性能比。
{"title":"Mayfly optimistic hyperelliptic curve cryptosystem","authors":"Ramireddy Nava Teja Reddy, M. Kavitha, G. S. Reddy, Amr H. Yousef, K. Aboras, Ahmed Emara, Ch. Rami Reddy","doi":"10.3389/fcomp.2024.1381850","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1381850","url":null,"abstract":"Various applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage. Thus, elliptic curve cryptography (ECC) is a methodology that emerged to overcome this issue using its low computation and generation of small keys with its strong encryption strategy. ECC is becoming mandatory and used mostly for public key encryption protocols. ECC has expanded cumulative acceptance in practice due to the reduced bit magnitude of operands compared to RSA for safety level. Previously, protocols designed for ECC suggested calculation of scalar development and it was accomplished in finite fields as projective, affine, and Jacobian simulations of coordinates. Arithmetic operations in a limited area establish the core benefits of the ECC algorithm. Even though ECC generated an issue of complex key generation using its curve formation, to overcome this issue a hyperelliptic curve cryptosystems (HECC) is proposed in this study. HECC perform ECC in the Public Key Cryptography (PKC) domain. This study presented an optimization-based key generation and made a random selection of integers for encrypting the message. Selecting a prime number as the private key and multiplying it to the encrypted message to generate a public key is done. This encrypted message is mapped to the curve to check whether it satisfies the curve equation or not. Once an encrypted message is obtained, it is then sent to a second party for pursuing the message. On the side of the second party, a reverse process called decryption takes place. Thus, a secured transmission of data communication takes place. Implementing this algorithm in MATLAB resulted in 94% accuracy and an error of 6%, which was a higher performance ratio than previous methods.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":" 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141678865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Spontaneous recognition of impactful video games: a user-centric classification framework 自发识别有影响力的视频游戏:以用户为中心的分类框架
Pub Date : 2024-07-03 DOI: 10.3389/fcomp.2024.1378796
Pilar Terron-Lopez, M. Terrón-López, Guillermo Castilla-Cebrian
The potential impact of a video game is directly conditioned by its recognizability in the public conscience. But classifying video games in this manner can be a challenging endeavor. This paper emphasizes inconsistencies in recognition metrics and the absence of a unified system of classification. It approaches the problem through a twofold methodology involving a systematic literature review exploring existing classifications and genres, and an exploratory survey gathering data on spontaneously recognized video games in Spain. The study utilizes quantitative data to create three lists of video games—most played globally, most representative internationally, and most significant in the Spanish market. The findings reveal complexities in comparing video game data and underscore the importance of comprehensive research frameworks. The study contributes valuable insights into video game recognition dynamics among users, addresses the scarcity of comparative research in the gaming field, revealing the subjective impact of globally recognized video games and highlighting the possible relations between industry trends, spontaneous recognition, and consumer preferences.
电子游戏的潜在影响直接取决于其在公众意识中的可识别性。但是,以这种方式对电子游戏进行分类是一项极具挑战性的工作。本文强调了识别度量标准的不一致以及缺乏统一分类系统的问题。本文从两方面着手解决问题,一是对现有分类和流派进行系统的文献综述,二是进行探索性调查,收集西班牙自发识别的视频游戏数据。研究利用定量数据创建了三个视频游戏列表--全球最受欢迎游戏、国际最具代表性游戏和西班牙市场最重要游戏。研究结果揭示了比较视频游戏数据的复杂性,并强调了综合研究框架的重要性。这项研究有助于深入了解用户对视频游戏的认知动态,解决游戏领域缺乏比较研究的问题,揭示全球知名视频游戏的主观影响,并强调行业趋势、自发认知和消费者偏好之间可能存在的关系。
{"title":"Spontaneous recognition of impactful video games: a user-centric classification framework","authors":"Pilar Terron-Lopez, M. Terrón-López, Guillermo Castilla-Cebrian","doi":"10.3389/fcomp.2024.1378796","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1378796","url":null,"abstract":"The potential impact of a video game is directly conditioned by its recognizability in the public conscience. But classifying video games in this manner can be a challenging endeavor. This paper emphasizes inconsistencies in recognition metrics and the absence of a unified system of classification. It approaches the problem through a twofold methodology involving a systematic literature review exploring existing classifications and genres, and an exploratory survey gathering data on spontaneously recognized video games in Spain. The study utilizes quantitative data to create three lists of video games—most played globally, most representative internationally, and most significant in the Spanish market. The findings reveal complexities in comparing video game data and underscore the importance of comprehensive research frameworks. The study contributes valuable insights into video game recognition dynamics among users, addresses the scarcity of comparative research in the gaming field, revealing the subjective impact of globally recognized video games and highlighting the possible relations between industry trends, spontaneous recognition, and consumer preferences.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":" 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141680378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unveiling suspicious phishing attacks: enhancing detection with an optimal feature vectorization algorithm and supervised machine learning 揭露可疑的网络钓鱼攻击:利用最佳特征向量算法和监督机器学习提高检测能力
Pub Date : 2024-07-02 DOI: 10.3389/fcomp.2024.1428013
M. A. Tamal, Md K. Islam, Touhid Bhuiyan, Abdus Sattar, Nayem Uddin Prince
The dynamic and sophisticated nature of phishing attacks, coupled with the relatively weak anti-phishing tools, has made phishing detection a pressing challenge. In light of this, new gaps have emerged in phishing detection, including the challenges and pitfalls of existing phishing detection techniques. To bridge these gaps, this study aims to develop a more robust, effective, sophisticated, and reliable solution for phishing detection through the optimal feature vectorization algorithm (OFVA) and supervised machine learning (SML) classifiers.Initially, the OFVA was utilized to extract the 41 optimal intra-URL features from a novel large dataset comprising 2,74,446 raw URLs (134,500 phishing and 139,946 legitimate URLs). Subsequently, data cleansing, curation, and dimensionality reduction were performed to remove outliers, handle missing values, and exclude less predictive features. To identify the optimal model, the study evaluated and compared 15 SML algorithms arising from different machine learning (ML) families, including Bayesian, nearest-neighbors, decision trees, neural networks, quadratic discriminant analysis, logistic regression, bagging, boosting, random forests, and ensembles. The evaluation was performed based on various metrics such as confusion matrix, accuracy, precision, recall, F-1 score, ROC curve, and precision-recall curve analysis. Furthermore, hyperparameter tuning (using Grid-search) and k-fold cross-validation were performed to optimize the detection accuracy.The findings indicate that random forests (RF) outperformed the other classifiers, achieving a greater accuracy rate of 97.52%, followed by 97.50% precision, and an AUC value of 97%. Finally, a more robust and lightweight anti-phishing model was introduced, which can serve as an effective tool for security experts, practitioners, and policymakers to combat phishing attacks.
网络钓鱼攻击的动态性和复杂性,加上反网络钓鱼工具的相对薄弱,使得网络钓鱼检测成为一项紧迫的挑战。有鉴于此,网络钓鱼检测领域出现了新的空白,包括现有网络钓鱼检测技术面临的挑战和隐患。为了弥补这些差距,本研究旨在通过最佳特征向量算法(OFVA)和有监督机器学习(SML)分类器,为网络钓鱼检测开发一种更稳健、更有效、更复杂、更可靠的解决方案。最初,OFVA 被用来从一个由 2,74,446 个原始 URL(134,500 个网络钓鱼 URL 和 139,946 个合法 URL)组成的新型大型数据集中提取 41 个最佳 URL 内特征。随后,对数据进行了清理、整理和降维处理,以去除异常值、处理缺失值并排除预测性较低的特征。为了确定最佳模型,该研究评估并比较了来自不同机器学习(ML)系列的 15 种 SML 算法,包括贝叶斯算法、近邻算法、决策树算法、神经网络算法、二次判别分析算法、逻辑回归算法、套袋算法、提升算法、随机森林算法和集合算法。评估基于各种指标,如混淆矩阵、准确率、精确率、召回率、F-1 分数、ROC 曲线和精确率-召回率曲线分析。研究结果表明,随机森林(RF)的表现优于其他分类器,准确率高达 97.52%,精确率为 97.50%,AUC 值为 97%。最后,介绍了一种更稳健、更轻量级的反钓鱼模型,它可以作为安全专家、从业人员和政策制定者打击网络钓鱼攻击的有效工具。
{"title":"Unveiling suspicious phishing attacks: enhancing detection with an optimal feature vectorization algorithm and supervised machine learning","authors":"M. A. Tamal, Md K. Islam, Touhid Bhuiyan, Abdus Sattar, Nayem Uddin Prince","doi":"10.3389/fcomp.2024.1428013","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1428013","url":null,"abstract":"The dynamic and sophisticated nature of phishing attacks, coupled with the relatively weak anti-phishing tools, has made phishing detection a pressing challenge. In light of this, new gaps have emerged in phishing detection, including the challenges and pitfalls of existing phishing detection techniques. To bridge these gaps, this study aims to develop a more robust, effective, sophisticated, and reliable solution for phishing detection through the optimal feature vectorization algorithm (OFVA) and supervised machine learning (SML) classifiers.Initially, the OFVA was utilized to extract the 41 optimal intra-URL features from a novel large dataset comprising 2,74,446 raw URLs (134,500 phishing and 139,946 legitimate URLs). Subsequently, data cleansing, curation, and dimensionality reduction were performed to remove outliers, handle missing values, and exclude less predictive features. To identify the optimal model, the study evaluated and compared 15 SML algorithms arising from different machine learning (ML) families, including Bayesian, nearest-neighbors, decision trees, neural networks, quadratic discriminant analysis, logistic regression, bagging, boosting, random forests, and ensembles. The evaluation was performed based on various metrics such as confusion matrix, accuracy, precision, recall, F-1 score, ROC curve, and precision-recall curve analysis. Furthermore, hyperparameter tuning (using Grid-search) and k-fold cross-validation were performed to optimize the detection accuracy.The findings indicate that random forests (RF) outperformed the other classifiers, achieving a greater accuracy rate of 97.52%, followed by 97.50% precision, and an AUC value of 97%. Finally, a more robust and lightweight anti-phishing model was introduced, which can serve as an effective tool for security experts, practitioners, and policymakers to combat phishing attacks.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141686994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability on the Internet of Things with designing approach for exploratory analysis 物联网可靠性设计探索性分析方法
Pub Date : 2024-06-04 DOI: 10.3389/fcomp.2024.1382347
Khushwant Singh, Mohit Yadav, Yudhvir Singh, Dheer Dhwaz Barak, Ashish Saini, Fernando Moreira
The Internet of Things (IoT) proposes to transform human civilization so that it is smart, practical, and highly efficient, with enormous potential for commercial as well as social and environmental advantages. Reliability is one of the major problems that must be resolved to enable this revolutionary change. The reliability issues raised with specific supporting technologies for each tier according to the layered IoT reliability are initially described in this research. The research then offers a complete review and assessment of IoT reliability. In this paper, various types of reliability on the IoT have been analyzed with each layer of IoT to solve the issues of failure rates, latency, MTTF, and MTBF. Each parameter has a certain classification and perception as well as enhancement in efficiency, accuracy, precision, timeliness, and completeness. Reliability models provide efficient solutions for different IoT problems, which are mirrored in the proposed study and classified with four types of reliabilities. The field of IoT reliability exploration is still in its initial phases, despite a sizable research record. Furthermore, the recent case study of CHISS is elaborated with discovered behaviors including brand-new aspects such as the multifaceted nature of evolving IoT systems, research opportunities, and difficulties.
物联网(IoT)提出要改变人类文明,使其智能、实用、高效,并具有巨大的商业、社会和环境优势潜力。要实现这一革命性变革,可靠性是必须解决的主要问题之一。本研究首先介绍了根据分层物联网可靠性,各层具体支持技术所引发的可靠性问题。随后,研究对物联网可靠性进行了全面回顾和评估。本文分析了物联网各层的各类可靠性,以解决故障率、延迟、MTTF 和 MTBF 等问题。每个参数都有一定的分类和感知,并在效率、准确性、精确性、及时性和完整性方面有所提高。可靠性模型为不同的物联网问题提供了有效的解决方案,这在拟议的研究中得到了体现,并分为四种类型的可靠性。物联网可靠性探索领域尽管已有大量研究记录,但仍处于起步阶段。此外,CHISS 的最新案例研究阐述了发现的行为,包括不断发展的物联网系统的多面性、研究机会和困难等全新方面。
{"title":"Reliability on the Internet of Things with designing approach for exploratory analysis","authors":"Khushwant Singh, Mohit Yadav, Yudhvir Singh, Dheer Dhwaz Barak, Ashish Saini, Fernando Moreira","doi":"10.3389/fcomp.2024.1382347","DOIUrl":"https://doi.org/10.3389/fcomp.2024.1382347","url":null,"abstract":"The Internet of Things (IoT) proposes to transform human civilization so that it is smart, practical, and highly efficient, with enormous potential for commercial as well as social and environmental advantages. Reliability is one of the major problems that must be resolved to enable this revolutionary change. The reliability issues raised with specific supporting technologies for each tier according to the layered IoT reliability are initially described in this research. The research then offers a complete review and assessment of IoT reliability. In this paper, various types of reliability on the IoT have been analyzed with each layer of IoT to solve the issues of failure rates, latency, MTTF, and MTBF. Each parameter has a certain classification and perception as well as enhancement in efficiency, accuracy, precision, timeliness, and completeness. Reliability models provide efficient solutions for different IoT problems, which are mirrored in the proposed study and classified with four types of reliabilities. The field of IoT reliability exploration is still in its initial phases, despite a sizable research record. Furthermore, the recent case study of CHISS is elaborated with discovered behaviors including brand-new aspects such as the multifaceted nature of evolving IoT systems, research opportunities, and difficulties.","PeriodicalId":510141,"journal":{"name":"Frontiers in Computer Science","volume":"7 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141267837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Frontiers in Computer Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1