The Community for Technology Leaders
RSS Icon
Issue No.12 - Dec. (2012 vol.23)
pp: 2231-2244
Yan Zhu , Peking University, Beijing
Hongxin Hu , Arizona State University, Tempe
Gail-Joon Ahn , Arizona State University, Tempe
Mengyang Yu , Peking University, Beijing
Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients' data. We present a cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash index hierarchy. We prove the security of our scheme based on multiprover zero-knowledge proof system, which can satisfy completeness, knowledge soundness, and zero-knowledge properties. In addition, we articulate performance optimization mechanisms for our scheme, and in particular present an efficient method for selecting optimal parameter values to minimize the computation costs of clients and storage service providers. Our experiments show that our solution introduces lower computation and communication overheads in comparison with noncooperative approaches.
Cloud computing, Servers, Distributed databases, Protocols, Indexes, Cryptography, Network security, cooperative, Storage security, provable data possession, interactive protocol, zero-knowledge, multiple cloud
Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Mengyang Yu, "Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 12, pp. 2231-2244, Dec. 2012, doi:10.1109/TPDS.2012.66
[1] B. Sotomayor, R.S. Montero, I.M. Llorente, and I.T. Foster, "Virtual Infrastructure Management in Private and Hybrid Clouds," IEEE Internet Computing, vol. 13, no. 5, pp. 14-22, Sept. 2009.
[2] G. Ateniese, R.C. Burns, R. Curtmola, J. Herring, L. Kissner, Z.N.J. Peterson, and D.X. Song, "Provable Data Possession at Untrusted Stores," Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp. 598-609, 2007.
[3] A. Juels and B.S.K. Jr., "Pors: Proofs of Retrievability for Large Files," Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp. 584-597, 2007.
[4] G. Ateniese, R.D. Pietro, L.V. Mancini, and G. Tsudik, "Scalable and Efficient Provable Data Possession," Proc. Fourth Int'l Conf. Security and Privacy in Comm. Netowrks (SecureComm '08), pp. 1-10, 2008.
[5] C.C. Erway, A. Küpçü, C. Papamanthou, and R. Tamassia, "Dynamic Provable Data Possession," Proc. 16th ACM Conf. Computer and Comm. Security (CCS '09), pp. 213-222, 2009.
[6] H. Shacham and B. Waters, "Compact Proofs of Retrievability," Proc. 14th Int'l Conf. Theory and Application of Cryptology and Information Security: Advances in Cryptology (ASIACRYPT '08), pp. 90-107, 2008.
[7] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, "Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing," Proc. 14th European Conf. Research in Computer Security (ESORICS '09), pp. 355-370, 2009.
[8] Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S.S. Yau, "Dynamic Audit Services for Integrity Verification of Outsourced Storages in Clouds," Proc. ACM Symp. Applied Computing, pp. 1550-1557, 2011.
[9] K.D. Bowers, A. Juels, and A. Oprea, "Hail: A High-Availability and Integrity Layer for Cloud Storage," Proc. 16th ACM Conf. Computer and Comm. Security, pp. 187-198, 2009.
[10] Y. Dodis, S.P. Vadhan, and D. Wichs, "Proofs of Retrievability via Hardness Amplification," Proc. Sixth Theory of Cryptography Conf. Theory of Cryptography (TCC '09), pp. 109-127, 2009.
[11] L. Fortnow, J. Rompel, and M. Sipser, "On the Power of Multi-Prover Interactive Protocols," J. Theoretical Computer Science, vol. 134, pp. 156-161, 1988.
[12] Y. Zhu, H. Hu, G.-J. Ahn, Y. Han, and S. Chen, "Collaborative Integrity Verification in Hybrid Clouds," Proc. IEEE Conf. Seventh Int'l Conf. Collaborative Computing: Networking, Applications and Worksharing, pp. 197-206, 2011.
[13] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "Above the Clouds: A Berkeley View of Cloud Computing," technical report, EECS Dept., Univ. of California, Feb. 2009.
[14] D. Boneh and M. Franklin, "Identity-Based Encryption from the Weil Pairing," Proc. Advances in Cryptology (CRYPTO '01), pp. 213-229, 2001.
[15] O. Goldreich, Foundations of Cryptography: Basic Tools. Cambridge Univ. Press, 2001.
[16] P.S.L.M. Barreto, S.D. Galbraith, C. O'Eigeartaigh, and M. Scott, "Efficient Pairing Computation on Supersingular Abelian Varieties," J. Design, Codes and Cryptography, vol. 42, no. 3, pp. 239-271, 2007.
[17] J.-L. Beuchat, N. Brisebarre, J. Detrey, and E. Okamoto, "Arithmetic Operators for Pairing-Based Cryptography," Proc. Ninth Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES '07), pp. 239-255, 2007.
[18] H. Hu, L. Hu, and D. Feng, "On a Class of Pseudorandom Sequences from Elliptic Curves over Finite Fields," IEEE Trans. Information Theory, vol. 53, no. 7, pp. 2598-2605, July 2007.
[19] A. Bialecki, M. Cafarella, D. Cutting, and O. O'Malley, "Hadoop: A Framework for Running Applications on Large Clusters Built of Commodity Hardware," technical report, 2005, http://lucene. apache.orghadoop/.
[20] E. Al-Shaer, S. Jha, and A.D. Keromytis, Proc. Conf. Computer and Comm. Security (CCS), 2009.
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool