An Approach Secret Sharing Algorithm in Cloud Computing Security over Single to Multi Clouds
An Approach Secret Sharing Algorithm in Cloud Computing Security over Single to Multi Clouds
复制标题
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
K. Alam;Sharmila Banu
中科院分区：
文献类型：
--
作者：
K. Alam;Sharmila Banu
如今，云计算在许多组织和 IT 行业中的使用迅速增加，并以低成本提供新软件 (1)。因此，云计算以低成本和通过互联网访问数据的方式给我们带来了很多好处。确保云计算的安全风险是云计算环境中的主要因素，例如敏感信息可能被委托给云存储提供商。但“单一云”提供商不太受客户欢迎，因为存在服务可用性故障以及“单一云”中可能存在恶意内部人员的风险。目前，使用 Shamir 的秘密共享算法已经出现了“多云”或“多云”或“云的云”的运动。本文调查了许多正在运行的与使用 Shamir 的秘密共享算法的单云和多云安全相关的研究论文，并提出了可能的解决方案和方法。本文主要关注多云的使用和数据安全以及使用Shamir's Secret共享算法降低云计算用户的安全风险和影响。它是秘密共享的一种形式，其中秘密被分为多个部分，这为每个参与者提供了自己独特的部分，其中需要部分或全部部分才能重建秘密。如果我们要对所有参与者进行计数以将秘密组合在一起可能是不切实际的，因此有时会使用阈值方案，其中任何“k”部分都足以重建原始秘密（7）。
Now a day's rapidly increased use of cloud computing in the many organization and IT industries and provides new software with low cost (1). So the cloud computing give us lot of benefits with low cost and of data accessibility through Internet. The ensuring security risks of the cloud computing is the main factor in the cloud computing environment, for example sensitive information with cloud storage providers may be entrusted. But 'single cloud' providers is a less popular with customers due to risks service availability failure and possibly of malicious insiders in the 'single cloud'. A towards movement of 'multi clouds' or 'multiple clouds' or 'cloud-of-clouds' has emerged currently using Shamir's Secret Sharing Algorithm. This paper surveys to many running research related paper to single cloud and multi clouds security using Shamir's Secret Sharing algorithm and addresses possible solutions and methodology. Main focus of this paper use of multi clouds and data security and reduce security risks and affect the cloud computing user using Shamir's Secret sharing algorithm. It is a form of secret sharing, where a secret is divided into parts, which is giving each participant its own unique part, where some of the parts or all of them are required in order to reconstruct the secret. If we're going to Count all participants to combine together the secret might be impractical, and therefore sometimes the threshold scheme is used where any 'k' of the parts are sufficient to reconstruct the original secret (7).