7th International Conference on Collaborative Computing: Networking, Applications and Worksharing

Research Article

Collaborative Integrity Verification in Hybrid Clouds

Download296 downloads
  • @INPROCEEDINGS{10.4108/icst.collaboratecom.2011.247089,
        author={Yan Zhu and Hongxin Hu and Gail-Joon Ahn and Yujing Han and Shimin Chen},
        title={Collaborative Integrity Verification in Hybrid Clouds},
        proceedings={7th International Conference on Collaborative Computing: Networking, Applications and Worksharing},
        publisher={IEEE},
        proceedings_a={COLLABORATECOM},
        year={2012},
        month={4},
        keywords={integrity verification multi-prover collaborative hybrid clouds},
        doi={10.4108/icst.collaboratecom.2011.247089}
    }
    
  • Yan Zhu
    Hongxin Hu
    Gail-Joon Ahn
    Yujing Han
    Shimin Chen
    Year: 2012
    Collaborative Integrity Verification in Hybrid Clouds
    COLLABORATECOM
    ICST
    DOI: 10.4108/icst.collaboratecom.2011.247089
Yan Zhu1,*, Hongxin Hu2, Gail-Joon Ahn2, Yujing Han1, Shimin Chen1
  • 1: Peking University
  • 2: Arizona State University
*Contact email: yan.zhu@pku.edu.cn

Abstract

A hybrid cloud is a cloud computing environment in which an organization provides and manages some internal resources and the others provided externally. However, this new environment could bring irretrievable losses to the clients due to a lack of integrity verification mechanism for distributed data outsourcing. In this paper, we address the construction of a collaborative integrity verification mechanism in hybrid clouds to support the scalable service and data migration, in which we consider the existence of multiple cloud service providers to collaboratively store and maintain the clients’ data. We propose a collaborative provable data possession scheme adopting the techniques of homomorphic verifiable responses and hash index hierarchy. In addition, we articulate the performance optimization mechanisms for our scheme and prove the security of our scheme based on multi-prover zero-knowledge proof system, which can satisfy the properties of completeness, knowledge soundness, and zero-knowledge. Our experiments also show that our proposed solution only incurs a small constant amount of communications overhead.