Enabled security based on elliptic curve cryptography with optimal resource allocation schema in cloud computing environment

N. Nagalakshmi, S. Rajalakshmi
{"title":"Enabled security based on elliptic curve cryptography with optimal resource allocation schema in cloud computing environment","authors":"N. Nagalakshmi, S. Rajalakshmi","doi":"10.1109/NCCCIS.2015.7295903","DOIUrl":null,"url":null,"abstract":"Cloud computing is a new style of computing in which dynamically scalable and often virtualized resources are provided as service over internet. Resource procurement of cloud resources is an interesting and yet unexplored area in cloud computing, to automates the selection of resources for cloud vendor becomes a challenging issue in recent years. This problem is solve by using three novel mechanism for cloud vendor with resource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible (C-BIC), and cloud optimal (C-OPT). In C-OPT modules, where the resource allocation is performed based host winner value, the major issue of the work is that authentication is performed for each cloud user. To solve security issue problem in the cloud resource procurement approach, in this work introduce a novel expectation maximization (EM) algorithm for cloud optimal modules resources. The proposed EM methods are used for finding maximum likelihood depends on unobserved latent cloud resource variables for virtual cost and quality of service constraints. To authenticate the cloud user data, cryptography method is introduced in this proposed work. The proposed cryptographic method follows the procedure of Elliptic curve cryptography for authenticating users and cloud vendors. Key values between the cloud user and cloud vendors are exchanged. Each and every key is verified by both cloud user and cloud vendor. If the key value anyone becomes wrong the resource Procurement is not allocated to cloud user, since these users becomes unauthenticated user, there are not allowed to performed resource Procurement process. A cloud broker with such a procurement module enables users to automate the choice of a cloud vendor. Our experiments indicate that the resource procurement cost decrease by calculation of the expectation maximization algorithm and more security than the existing COPT methods by using the elliptic curve cryptography with increase in number of cloud vendors irrespective of the mechanisms.","PeriodicalId":201980,"journal":{"name":"2015 IEEE Seventh National Conference on Computing, Communication and Information Systems (NCCCIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Seventh National Conference on Computing, Communication and Information Systems (NCCCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCCCIS.2015.7295903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Cloud computing is a new style of computing in which dynamically scalable and often virtualized resources are provided as service over internet. Resource procurement of cloud resources is an interesting and yet unexplored area in cloud computing, to automates the selection of resources for cloud vendor becomes a challenging issue in recent years. This problem is solve by using three novel mechanism for cloud vendor with resource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible (C-BIC), and cloud optimal (C-OPT). In C-OPT modules, where the resource allocation is performed based host winner value, the major issue of the work is that authentication is performed for each cloud user. To solve security issue problem in the cloud resource procurement approach, in this work introduce a novel expectation maximization (EM) algorithm for cloud optimal modules resources. The proposed EM methods are used for finding maximum likelihood depends on unobserved latent cloud resource variables for virtual cost and quality of service constraints. To authenticate the cloud user data, cryptography method is introduced in this proposed work. The proposed cryptographic method follows the procedure of Elliptic curve cryptography for authenticating users and cloud vendors. Key values between the cloud user and cloud vendors are exchanged. Each and every key is verified by both cloud user and cloud vendor. If the key value anyone becomes wrong the resource Procurement is not allocated to cloud user, since these users becomes unauthenticated user, there are not allowed to performed resource Procurement process. A cloud broker with such a procurement module enables users to automate the choice of a cloud vendor. Our experiments indicate that the resource procurement cost decrease by calculation of the expectation maximization algorithm and more security than the existing COPT methods by using the elliptic curve cryptography with increase in number of cloud vendors irrespective of the mechanisms.
基于椭圆曲线加密的云计算环境下最优资源分配模式的安全性实现
云计算是一种新的计算方式,它将动态可扩展的、通常是虚拟化的资源作为服务在互联网上提供。云资源的资源采购是云计算中一个有趣但尚未开发的领域,为云供应商自动选择资源成为近年来一个具有挑战性的问题。采用三种新的云供应商资源采购机制:云主导策略激励兼容(C-DSIC)、云-贝叶斯激励兼容(C-BIC)和云最优(C-OPT)来解决这一问题。在C-OPT模块中,资源分配是基于主机赢家值执行的,工作的主要问题是对每个云用户执行身份验证。为了解决云资源采购方法中的安全问题,本文提出了一种新的云最优模块资源期望最大化算法。提出的EM方法用于寻找虚拟成本和服务质量约束的最大似然依赖于未观察到的潜在云资源变量。为了对云用户数据进行认证,本文引入了加密方法。提出的加密方法遵循椭圆曲线加密的过程,用于用户和云供应商的认证。在云用户和云供应商之间交换关键值。每个密钥都由云用户和云供应商进行验证。如果关键值任何人出错,则资源采购不会分配给云用户,因为这些用户成为未经身份验证的用户,因此不允许执行资源采购流程。具有这种采购模块的云代理使用户能够自动选择云供应商。我们的实验表明,随着云供应商数量的增加,无论机制如何,使用期望最大化算法计算资源采购成本降低,并且使用椭圆曲线加密比现有的COPT方法更具安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信