A Data Hiding Scheme Based on Lagrange Interpolation Algorithm and Multi-clouds
Authors:
- Yu JinYJYu Jin
- Yadan WangYWYadan Wang
- Wei XiaWXWei Xia
- Li DengLDLi Deng
- Heng HeHHHeng He
- 1 December 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21683042,p. 210-216
Abstract
The use of cloud storage services has increased rapidly in many organizations. However, the security of data stored in the cloud still remains major concerns. Due to risks of service availability failure and the possibility of malicious insiders in the single cloud, researches about "multi-clouds" have emerged recently. Recent researches that are related to multi-clouds have some limitations. For instance, Redundant Array of Cloud Storage (RACS) does not ensure data confidentiality. The performance of system is low in DEPSKY and so on. This paper presents a data hiding scheme that is based on Lagrange interpolation algorithm and multi-clouds. This scheme addresses data availability, data confidentiality and vendor lock-in issue in cloud storage services through the erasure codes and Lagrange interpolation algorithm instead of encryption to store data on diverse clouds. The performance analysis was done through experiences. We observed that our scheme improved the performance for the response times of data uploaded and downloaded.Keywords
This publication has 14 references indexed in Scilit:
- Cloud Computing Security: From Single to Multi-clouds2012
- MCDB: Using Multi-clouds to Ensure Security in Cloud Computing2011
- DepSky2011
- The byzantine empire in the intercloudACM SIGACT News, 2010
- HAIL2009
- Optimal Resilience for Erasure-Coded Byzantine Distributed StorageLecture Notes in Computer Science, 2005
- Minimal Byzantine Storage2002
- Survey: interpolation methods in medical image processingIEEE Transactions on Medical Imaging, 1999
- Byzantine quorum systemsDistributed Computing, 1998
- How to share a secretCommunications of the ACM, 1979