Simple and Efficient Secret Sharing Schemes for Sharing Data and Image
Simple and Efficient Secret Sharing Schemes for Sharing Data and Image
复制标题
简单高效的数据和图像共享秘密共享方案
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
A. Sreekumar
中科院分区：
文献类型：
--
作者：
V. Binu;A. Sreekumar
秘密共享是以安全的方式外包数据的一种新的替代方案。它避免了耗时的加密解密过程的需要，也避免了密钥管理中涉及的复杂性。数据还必须受到不受信任的云服务提供商的保护。基于秘密共享的解决方案通过将原始数据共享并将其分发到不同的服务器之间来提供安全的信息分散。来自阈值数量的服务器的数据可以被用于重建原始数据。在大量服务器之间分发数据通常是不切实际的。我们必须在安全性和效率之间取得平衡。最佳选择是使用$（2，3）$或$（2，4）$阈值秘密共享方案，其中数据作为共享分布在三个或四个服务器之间，并且来自任何两个服务器的共享可用于构造原始数据。同时兼顾安全性、可靠性和效率.基于数论和位异或运算，提出了几种高效且易于实现的秘密共享方案.这些方案同样适用于图像的安全共享.基于Shamir方案的秘密图像共享是有损的，且涉及复杂的拉格朗日插值.因此，本文提出的方案同样适用于秘密图像的无损共享.
Secret sharing is a new alternative for outsourcing data in a secure way.It avoids the need for time consuming encryption decryption process and also the complexity involved in key management.The data must also be protected from untrusted cloud service providers.Secret sharing based solution provides secure information dispersal by making shares of the original data and distribute them among different servers.Data from the threshold number of servers can be used to reconstruct the original data.It is often impractical to distribute data among large number of servers.We have to achieve a trade off between security and efficiency.An optimal choice is to use a $(2,3)$ or $(2,4)$ threshold secret sharing scheme, where the data are distributed as shares among three or four servers and shares from any two can be used to construct the original data.This provides both security,reliability and efficiency.We propose some efficient and easy to implement secret sharing schemes in this regard based on number theory and bitwise XOR.These schemes are also suitable for secure sharing of images.Secret image sharing based on Shamir's schemes are lossy and involves complicated Lagrange interpolation.So the proposed scheme can also be effectively utilized for lossless sharing of secret images.
影响因子：
22.7
作者：
SHAMIR, A
通讯作者：
SHAMIR, A