Rakesh Kumar, S. K. Singh, D. K. Lobiyal, Kwok Tai Chui, D. Santaniello, M. Rafsanjani
The vehicular internet of things (VIoT) network is connecting smart commuters to elevate traffic problems and effectiveness that help to improve driving conditions for vehicles. Every ITS-based vehicle OBU and commuter might be interchangeable and used to give access permission for the various services during transportation such as infotainment, emergency service, environment service, road condition, etc. These services are suffering from the 1-affect-n problem, scalability, memory resources, computation, and communication overhead. In this paper, the authors proposed a novel decentralized group key management protocol for cloud-based vehicular IoT networks (GVIoTNet) to solve the problem of 1-affect-n and scalability by using the decentralized approach of group key access, key generation, key distribution, key update among vehicles and commuters. Further, by using the master key encryption approach, the average rekeying minimization is 84.84% with the GroupIT scheme. The minimization of rekeying reduces storage overhead and improves computation as well as communication overhead.
{"title":"A Novel Decentralized Group Key Management Scheme for Cloud-Based Vehicular IoT Networks","authors":"Rakesh Kumar, S. K. Singh, D. K. Lobiyal, Kwok Tai Chui, D. Santaniello, M. Rafsanjani","doi":"10.4018/ijcac.311037","DOIUrl":"https://doi.org/10.4018/ijcac.311037","url":null,"abstract":"The vehicular internet of things (VIoT) network is connecting smart commuters to elevate traffic problems and effectiveness that help to improve driving conditions for vehicles. Every ITS-based vehicle OBU and commuter might be interchangeable and used to give access permission for the various services during transportation such as infotainment, emergency service, environment service, road condition, etc. These services are suffering from the 1-affect-n problem, scalability, memory resources, computation, and communication overhead. In this paper, the authors proposed a novel decentralized group key management protocol for cloud-based vehicular IoT networks (GVIoTNet) to solve the problem of 1-affect-n and scalability by using the decentralized approach of group key access, key generation, key distribution, key update among vehicles and commuters. Further, by using the master key encryption approach, the average rekeying minimization is 84.84% with the GroupIT scheme. The minimization of rekeying reduces storage overhead and improves computation as well as communication overhead.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125147082","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}
Amaonwu Onyebuchi, U. O. Matthew, J. S. Kazaure, Nwamaka U. Okafor, O. Okey, Prisca I. Okochi, Janet Folasade Taiwo, Ani Okechukwu Matthew
Cloud enterprise data warehousing is a top level strategic business and information technology (IT) investment initiative in any organization that is technologically inclined, profit driven and customer oriented. To build the data warehouse, data are obtained from numerous heterogenous data sources, transformed, cleansed and processed into an applicable data repositories for implementation across the healthcare organizational settings. The current paper constructed an enterprise cloud data warehouse for e-healthcare organization and connected the medical/clinical workforces through the enterprise e-healthcare data warehouse and allowed the medical solutions and clinical information of all the patient to be stored. The proposed system is expected to improved the e-Healthcare information management by providing a model to support medical software automation, hardware system integration and enhances the control and management of the patients records.
{"title":"Business Demand for a Cloud Enterprise Data Warehouse in Electronic Healthcare Computing: Issues and Developments in E-Healthcare Cloud Computing","authors":"Amaonwu Onyebuchi, U. O. Matthew, J. S. Kazaure, Nwamaka U. Okafor, O. Okey, Prisca I. Okochi, Janet Folasade Taiwo, Ani Okechukwu Matthew","doi":"10.4018/ijcac.297098","DOIUrl":"https://doi.org/10.4018/ijcac.297098","url":null,"abstract":"Cloud enterprise data warehousing is a top level strategic business and information technology (IT) investment initiative in any organization that is technologically inclined, profit driven and customer oriented. To build the data warehouse, data are obtained from numerous heterogenous data sources, transformed, cleansed and processed into an applicable data repositories for implementation across the healthcare organizational settings. The current paper constructed an enterprise cloud data warehouse for e-healthcare organization and connected the medical/clinical workforces through the enterprise e-healthcare data warehouse and allowed the medical solutions and clinical information of all the patient to be stored. The proposed system is expected to improved the e-Healthcare information management by providing a model to support medical software automation, hardware system integration and enhances the control and management of the patients records.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132982838","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}
Cloud computing provides different services through data centers that are often located in different geographical locations. The users are faced with a wide variety of services to choose from. Also, with the increasing number of serviced applications, overloading might occur on service brokers for balancing and serving the requests. Consequently, maximizing the number of entry points and considering the maximum number of factors that affect the performance for balancing the workload is very important for the quality of service. This paper proposes a model named multi-cloud service brokers (MCSB) for selecting the optimal DC using multiple entry points. The developed service broker policy shares information about the requests considering some new performance factors. This extension is added to the CloudAnalyst simulator tool which is used in this work, and the results are evaluated and compared to other existing policies from the literature.
{"title":"Multi-Cloud Service Brokers for Selecting the Optimal Data Center in Cloud Environment","authors":"Mousa Elrotub, Abdelouahed Gherbi","doi":"10.4018/ijcac.309935","DOIUrl":"https://doi.org/10.4018/ijcac.309935","url":null,"abstract":"Cloud computing provides different services through data centers that are often located in different geographical locations. The users are faced with a wide variety of services to choose from. Also, with the increasing number of serviced applications, overloading might occur on service brokers for balancing and serving the requests. Consequently, maximizing the number of entry points and considering the maximum number of factors that affect the performance for balancing the workload is very important for the quality of service. This paper proposes a model named multi-cloud service brokers (MCSB) for selecting the optimal DC using multiple entry points. The developed service broker policy shares information about the requests considering some new performance factors. This extension is added to the CloudAnalyst simulator tool which is used in this work, and the results are evaluated and compared to other existing policies from the literature.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117050461","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}
In cloud environment, enhancing QoS is a challenging task to solve the multi objective problems. Effective load balancing and scheduling is a solution to enhance QoS. Job scheduling is a NP complete problem and is difficult to get the best scheduling especially for large number of jobs to enhance QoS. Multiple activities may need to be scheduled efficiently on various resources (CPU, virtual machines) by reducing completion time and maximizing resource utilization. A meta-heuristic method has been proposed for optimizing multi-objective scheduling problems in cloud systems using harmony search algorithm. According to cloud user's expectations, throughput should be high such that most of the user tasks are completed before the deadline expires thereby resulting in a low task rejection rate. Major purpose of the HS-based, NEW HS scheduling algorithm is to arrange upcoming cloud applications at virtual machines in such a way that tasks are completed in least amount of time (execution and makespan time) with low execution cost and take deadline of cloud application as a QoS constraint.
{"title":"Enhancing QoS with Resource Optimization Technique Based on Harmony Search in Cloud Environment","authors":"Geeta Singh, Santosh Kumar, S. Prakash","doi":"10.4018/ijcac.311504","DOIUrl":"https://doi.org/10.4018/ijcac.311504","url":null,"abstract":"In cloud environment, enhancing QoS is a challenging task to solve the multi objective problems. Effective load balancing and scheduling is a solution to enhance QoS. Job scheduling is a NP complete problem and is difficult to get the best scheduling especially for large number of jobs to enhance QoS. Multiple activities may need to be scheduled efficiently on various resources (CPU, virtual machines) by reducing completion time and maximizing resource utilization. A meta-heuristic method has been proposed for optimizing multi-objective scheduling problems in cloud systems using harmony search algorithm. According to cloud user's expectations, throughput should be high such that most of the user tasks are completed before the deadline expires thereby resulting in a low task rejection rate. Major purpose of the HS-based, NEW HS scheduling algorithm is to arrange upcoming cloud applications at virtual machines in such a way that tasks are completed in least amount of time (execution and makespan time) with low execution cost and take deadline of cloud application as a QoS constraint.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129822057","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}
In today’s world, Cloud Computing has been considered as the best concept for the virtualization of various resources. There are various approaches that have been available for improvising the load balancing and also to improvise the job scheduling in the concept of cloud. Cloud Computing has offers the on-demand allocation of resources to users and this feature of cloud makes it a best among various technologies. Cloud computing provides great performance in less maintenance cost. So, Task scheduling has become a very important factor in enhancing the performance of resources dynamically and at low cost, which is the most crucial part of cloud computing. In other words, we can say that allocation of resources and task scheduling are the two major factors that are considered for the better performance and they must be organized precisely. The author has focused on enhancing the task scheduling process by creating a hybrid optimization algorithm and named as Cuckoo Harmony Search Algorithm (CHSA) to remove the task scheduling problem.
{"title":"A Hybrid Approach for Task Scheduling in the Cloud Environment","authors":"Krishan Tuli, M. Malhotra","doi":"10.4018/ijcac.305215","DOIUrl":"https://doi.org/10.4018/ijcac.305215","url":null,"abstract":"In today’s world, Cloud Computing has been considered as the best concept for the virtualization of various resources. There are various approaches that have been available for improvising the load balancing and also to improvise the job scheduling in the concept of cloud. Cloud Computing has offers the on-demand allocation of resources to users and this feature of cloud makes it a best among various technologies. Cloud computing provides great performance in less maintenance cost. So, Task scheduling has become a very important factor in enhancing the performance of resources dynamically and at low cost, which is the most crucial part of cloud computing. In other words, we can say that allocation of resources and task scheduling are the two major factors that are considered for the better performance and they must be organized precisely. The author has focused on enhancing the task scheduling process by creating a hybrid optimization algorithm and named as Cuckoo Harmony Search Algorithm (CHSA) to remove the task scheduling problem.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130913735","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}
The Fourth Industrial Revolution is driven by cloud computing for increased productivity and efficiency. Despite the influence of cost-effectiveness, on-demand service and scalability, cloud computing is faced with many challenges such as security, performance, and fault tolerance. This research proposes a reactive mitigation model using checkpointing and replication techniques to overcome the challenges. The developed model has four layers: client/user, controller, fault tolerance (hybrid) and virtual machines layers. The functionalities of the developed model were compared to existing system using the same simulation conditions. The results showed a relative improvement over the existing system in terms of response time and computational cost and the developed system is able to react to faults by transferring requests to stable VMs and resume task execution at the last checkpoint. The developed model proved to work efficiently under various simulation conditions.
{"title":"Reactive Hybrid Model for Fault Mitigation in Real-Time Cloud Computing","authors":"F. A. Osuolale","doi":"10.4018/ijcac.295240","DOIUrl":"https://doi.org/10.4018/ijcac.295240","url":null,"abstract":"The Fourth Industrial Revolution is driven by cloud computing for increased productivity and efficiency. Despite the influence of cost-effectiveness, on-demand service and scalability, cloud computing is faced with many challenges such as security, performance, and fault tolerance. This research proposes a reactive mitigation model using checkpointing and replication techniques to overcome the challenges. The developed model has four layers: client/user, controller, fault tolerance (hybrid) and virtual machines layers. The functionalities of the developed model were compared to existing system using the same simulation conditions. The results showed a relative improvement over the existing system in terms of response time and computational cost and the developed system is able to react to faults by transferring requests to stable VMs and resume task execution at the last checkpoint. The developed model proved to work efficiently under various simulation conditions.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124120561","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}
The paradigms of Cloud Computing have risen at a very rapid rate. The Cloud Computing demands that a trustworthy or reliable service should be availed by its potential user. However, it is always a challenge for any cloud user to look for service that is suitable as well as reliable in every aspect. For a trustworthy discovery and delivery of cloud services, a multi-layered model i.e., Multi Agent based Trust Evaluation Model (MATEM) has been proposed. It is a multi-agent trust model that will make use of multiple agents to perform and evaluate the credibility of trust through trust evaluation system. Also, the performance validation has proven that the final calculated values of trust will be helpful in providing reliable cloud services to its users.
{"title":"MATEM: A Multi-Agent-Based Trust Evaluation Model for Discovery and Delivery of Reliable Cloud Services","authors":"S. Jaswal, M. Malhotra","doi":"10.4018/ijcac.305213","DOIUrl":"https://doi.org/10.4018/ijcac.305213","url":null,"abstract":"The paradigms of Cloud Computing have risen at a very rapid rate. The Cloud Computing demands that a trustworthy or reliable service should be availed by its potential user. However, it is always a challenge for any cloud user to look for service that is suitable as well as reliable in every aspect. For a trustworthy discovery and delivery of cloud services, a multi-layered model i.e., Multi Agent based Trust Evaluation Model (MATEM) has been proposed. It is a multi-agent trust model that will make use of multiple agents to perform and evaluate the credibility of trust through trust evaluation system. Also, the performance validation has proven that the final calculated values of trust will be helpful in providing reliable cloud services to its users.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131227943","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}
With the increasing market for cloud computing and the variety of Cloud Service Providers (CSPs) becoming available, making an appropriate choice of a CSP turns out to be challenging for the consumer. In order to cater to the user’s specific needs of quality, the services provided need to be user-centric. Trust plays an important role in the selection of cloud providers by users. This paper proposes CSP Trust evaluation, Prioritization and Recommendation System (CTPRS) for evaluating the trust of CSPs based on Quality of Service (QoS) parameters, and accordingly ranking and recommending them. MADM methods, namely ARAS, DEA, and GRA are used to evaluate trust by considering the user's preferences across multiple QoS parameters of CSPs. Comparative analysis of all three MADM methods is done using rank conformance, rank correlation, sensitivity, and computational complexity analysis. Experimental results demonstrate that GRA is superior to the other two methods. Thus, GRA is found to be the most suitable method and is therefore used for evaluating trust in CTPRS.
{"title":"Trust Evaluation and Prioritization of Cloud Service Providers Using MADM Methods","authors":"Suruchi M Pawar, Eunice Grace Paulson, Prajakta Sunil Badgujar, Shilpa Deshpande","doi":"10.4018/ijcac.305219","DOIUrl":"https://doi.org/10.4018/ijcac.305219","url":null,"abstract":"With the increasing market for cloud computing and the variety of Cloud Service Providers (CSPs) becoming available, making an appropriate choice of a CSP turns out to be challenging for the consumer. In order to cater to the user’s specific needs of quality, the services provided need to be user-centric. Trust plays an important role in the selection of cloud providers by users. This paper proposes CSP Trust evaluation, Prioritization and Recommendation System (CTPRS) for evaluating the trust of CSPs based on Quality of Service (QoS) parameters, and accordingly ranking and recommending them. MADM methods, namely ARAS, DEA, and GRA are used to evaluate trust by considering the user's preferences across multiple QoS parameters of CSPs. Comparative analysis of all three MADM methods is done using rank conformance, rank correlation, sensitivity, and computational complexity analysis. Experimental results demonstrate that GRA is superior to the other two methods. Thus, GRA is found to be the most suitable method and is therefore used for evaluating trust in CTPRS.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132856280","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}
Several processor allocation studies show that the performance of noncontiguous allocation is dramatically better than that of contiguous allocation, but this is not always true. The communication pattern may have a great effect on the performance of processor allocation algorithms. In this paper, the performance of well-known allocation algorithms is re-considered based on several communication patterns, including Near Neighbor, Ring, All-to-All, Divide and Conquer Binomial Tree (DQBT), Fast Fourier Transform (FFT), One-to-All, All-to-One, and Random. The allocation algorithms investigated include the contiguous First Fit (FF) and Best Fit (BF) and the noncontiguous Paging(0), Greedy Available Busy List (GABL) and Multiple Buddy Strategy (MBS). In near neighbor, FFT and DQBT, the simulation results show that the performance of contiguous allocation is dramatically better than that of the noncontiguous allocation in terms of response time; except for MBS in DQBT. In All-to-All, the results show that the performance of contiguous FF and BF is better than that of the noncontiguous MBS.
{"title":"Performance Evaluation of Contiguous and Noncontiguous Processor Allocation Based on Common Communication Patterns for 2D Mesh Interconnection Network","authors":"Areen Al Abass, S. Bani-Mohammad, I. Ababneh","doi":"10.4018/ijcac.295239","DOIUrl":"https://doi.org/10.4018/ijcac.295239","url":null,"abstract":"Several processor allocation studies show that the performance of noncontiguous allocation is dramatically better than that of contiguous allocation, but this is not always true. The communication pattern may have a great effect on the performance of processor allocation algorithms. In this paper, the performance of well-known allocation algorithms is re-considered based on several communication patterns, including Near Neighbor, Ring, All-to-All, Divide and Conquer Binomial Tree (DQBT), Fast Fourier Transform (FFT), One-to-All, All-to-One, and Random. The allocation algorithms investigated include the contiguous First Fit (FF) and Best Fit (BF) and the noncontiguous Paging(0), Greedy Available Busy List (GABL) and Multiple Buddy Strategy (MBS). In near neighbor, FFT and DQBT, the simulation results show that the performance of contiguous allocation is dramatically better than that of the noncontiguous allocation in terms of response time; except for MBS in DQBT. In All-to-All, the results show that the performance of contiguous FF and BF is better than that of the noncontiguous MBS.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117023148","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}
Md. Alimul Haque, Nourah Almrezeq, Shameemul Haque, A. El-Aziz
Internet of Things is a promising technology but it also increases numerous security threats in data transmission. To secure neighboring sensing devices' communication in an IoT environment, a key agreement protocol is primordial. Various IoT data transmission mechanisms have been proposed in the literature to attain security. However, these propositions are not completely secure against all types of attacks. In this paper, a new certificate-based was proposed lightweight authentication and key agreement protocol for the IoT environment. The proposed protocol uses Elliptic Curves Cryptography and minimizes the number of operations needed to generate secret keys. Moreover, performed a detailed informal security analysis, and formal security verification using Automated Validation of Internet Security Protocols and Applications (AVISPA) tool, through which demonstrated that the proposed protocol is resilient against numerous known attacks. The implementation of the proposed protocol using the simulator to evaluate the impact of the proposed protocol on several network parameters.
{"title":"Device Access Control and Key Exchange (DACK) Protocol for Internet of Things","authors":"Md. Alimul Haque, Nourah Almrezeq, Shameemul Haque, A. El-Aziz","doi":"10.4018/ijcac.297103","DOIUrl":"https://doi.org/10.4018/ijcac.297103","url":null,"abstract":"Internet of Things is a promising technology but it also increases numerous security threats in data transmission. To secure neighboring sensing devices' communication in an IoT environment, a key agreement protocol is primordial. Various IoT data transmission mechanisms have been proposed in the literature to attain security. However, these propositions are not completely secure against all types of attacks. In this paper, a new certificate-based was proposed lightweight authentication and key agreement protocol for the IoT environment. The proposed protocol uses Elliptic Curves Cryptography and minimizes the number of operations needed to generate secret keys. Moreover, performed a detailed informal security analysis, and formal security verification using Automated Validation of Internet Security Protocols and Applications (AVISPA) tool, through which demonstrated that the proposed protocol is resilient against numerous known attacks. The implementation of the proposed protocol using the simulator to evaluate the impact of the proposed protocol on several network parameters.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115772700","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：