DEPSKY: Dependable and Secure Storage in a Cloud-of-Clouds

被引:229
作者
Bessani, Alysson [1 ]
Correia, Miguel
Quaresma, Bruno [1 ]
Andre, Fernando [1 ]
Sousa, Paulo
机构
[1] Univ Lisbon, Fac Ciencias, P-1699 Lisbon, Portugal
关键词
Algorithms; Measurement; Performance; Reliability; Security; Cloud computing; cloud storage; Byzantine quorum systems;
D O I
10.1145/2535929
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The increasing popularity of cloud storage services has lead companies that handle critical data to think about using these services for their storage needs. Medical record databases, large biomedical datasets, historical information about power systems and financial data are some examples of critical data that could be moved to the cloud. However, the reliability and security of data stored in the cloud still remain major concerns. In this work we present DepSky, a system that improves the availability, integrity, and confidentiality of information stored in the cloud through the encryption, encoding, and replication of the data on diverse clouds that form a cloud-of-clouds. We deployed our system using four commercial clouds and used PlanetLab to run clients accessing the service from different countries. We observed that our protocols improved the perceived availability, and in most cases, the access latency, when compared with cloud providers individually. Moreover, the monetary costs of using DepSky in this scenario is at most twice the cost of using a single cloud, which is optimal and seems to be a reasonable cost, given the benefits.
引用
收藏
页数:33
相关论文
共 58 条
  • [1] Byzantine disk paxos: optimal resilience with byzantine shared memory
    Abraham, I
    Chockler, G
    Keidar, I
    Malkhi, D
    [J]. DISTRIBUTED COMPUTING, 2006, 18 (05) : 387 - 408
  • [2] Alchieri Eduardo A. P., 2008, 2008 IEEE International Conference on Web Services (ICWS), P21, DOI 10.1109/ICWS.2008.54
  • [3] [Anonymous], 2010, Proceedings of the 1st ACM symposium on Cloud computing
  • [4] [Anonymous], CMUSEI2011TN006
  • [5] [Anonymous], 1992, 1305 RFC
  • [6] [Anonymous], P 26 IEEE INT C DIST
  • [7] [Anonymous], TECHNOLOGY REV
  • [8] [Anonymous], 2012, P USENIX FAST
  • [9] [Anonymous], P USENIX ANN TECHN C
  • [10] [Anonymous], 2003, P 19 ACM S OP SYST P, DOI [10.1145/1165389.945450, DOI 10.1145/1165389.945450]