The Community for Technology Leaders
RSS Icon
Issue No.04 - Oct.-Dec. (2013 vol.6)
pp: 551-559
Huaqun Wang , Dalian Ocean University, Dalian and Xidian University Xi'an
Recently, cloud computing rapidly expands as an alternative to conventional computing due to it can provide a flexible, dynamic and resilient infrastructure for both academic and business environments. In public cloud environment, the client moves its data to public cloud server (PCS) and cannot control its remote data. Thus, information security is an important problem in public cloud storage, such as data confidentiality, integrity, and availability. In some cases, the client has no ability to check its remote data possession, such as the client is in prison because of committing crime, on the ocean-going vessel, in the battlefield because of the war, and so on. It has to delegate the remote data possession checking task to some proxy. In this paper, we study proxy provable data possession (PPDP). In public clouds, PPDP is a matter of crucial importance when the client cannot perform the remote data possession checking. We study the PPDP system model, the security model, and the design method. Based on the bilinear pairing technique, we design an efficient PPDP protocol. Through security analysis and performance analysis, our protocol is provable secure and efficient.
Cloud computing, Protocols, Public key, Computational modeling, Indexes,bilinear pairings, Cloud computing, PPDP, integrity checking, provable security
Huaqun Wang, "Proxy Provable Data Possession in Public Clouds", IEEE Transactions on Services Computing, vol.6, no. 4, pp. 551-559, Oct.-Dec. 2013, doi:10.1109/TSC.2012.35
[1] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, "Provable Data Possession at Untrusted Stores," Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp. 598-609, 2007.
[2] G. Ateniese, R. Dipietro, L.V. Mancini, and G. Tsudik, "Scalable and Efficient Provable Data Possession," Proc. Fourth Int'l Conf. Security and Privacy in Comm. Networks (SecureComm '08), 2008.
[3] C.C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia, "Dynamic Provable Data Possession," Proc. 16th ACM Conf. Computer and Comm. Security (CCS '09), pp. 213-222, 2009.
[4] F. Sebe, J. Domingo-Ferrer, A. Martinez-balleste, Y. Deswarte, and J. Quisquater, "Efficient Remote Data Integrity Checking in Critical Information Infrastructures," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 8, pp. 1034-1038, Aug. 2008.
[5] Y. Zhu, H. Wang, Z. Hu, G.J. Ahn, H. Hu, and S.S. Yau, "Efficient Provable Data Possession for Hybrid Clouds," Proc. 17th ACM Conf. Computer and Comm. Security (CCS '10), pp. 756-758, 2010.
[6] Y. Zhu, H. Hu, G.J. Ahn, and M. Yu, "Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage," IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 12, pp. 2231-2244, Dec. 2012.
[7] R. Curtmola, O. Khan, R. Burns, and G. Ateniese, "MR-PPDP: Multiple-Replica Provable Data Possession," Proc. IEEE 28th Int'l Conf. Distributed Computing Systems (ICDCS '08), pp. 411-420, 2008.
[8] A.F. Barsoum and M.A. Hasan, "Provable Possession and Replication of Data over Cloud Servers," Technical Report 2010/32,2010, CACR, Univ. of Waterloo, http://www.cacr.math. 2010cacr2010-32.pdf, 2013.
[9] Z. Hao and N. Yu, "A Multiple-Replica Remote Data Possession Checking Protocol with Public Verifiability," Proc. Second Int'l Symp. Data, Privacy, and E-Commerce (ISDPE '10), pp. 84-89, 2010.
[10] A.F. Barsoum and M.A. Hasan, "On Verifying Dynamic Multiple Data Copies over Cloud Servers,", 2013.
[11] C. Wang, Q. Wang, K. Ren, and W. Lou, "Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing," Proc. IEEE INFOCOM, pp. 525-533, 2010.
[12] C. Xu, X. He, and A. Daniel, "Cryptanalysis of Auditing Protocol Proposed by Wang et al., for Data Storage Security in Cloud Computing,", 2013.
[13] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, "Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 5, pp. 847-859, May 2011.
[14] A. Juels and B.S. KaliskiJr., "PORs: Proofs of Retrievability for Large Files," Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp. 584-597, 2007.
[15] H. Shacham and B. Waters, "Compact Proofs of Retrievability," Proc. 14th Int'l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT '08), pp. 90-107, 2008.
[16] K.D. Bowers, A. Juels, and A. Oprea, "Proofs of Retrievability: Theory and Implementation," Proc. ACM Cloud Computing Security Workshop (CCSW '09), pp. 43-54, 2009.
[17] Q. Zheng and S. Xu, "Fair and Dynamic Proofs of Retrievability," Proc. First ACM Conf. Data and Application Security and Privacy (CODASPY '11), pp. 237-248, 2011.
[18] Y. Dodis, S. Vadhan, and D. Wichs1, "Proofs of Retrievability via Hardness Amplification," Proc. Sixth Theory of Cryptography Conf. (TCC '09), pp. 109-127, 2009.
[19] Y. Zhu, H. Wang, Z. Hu, G.J. Ahn, and H. Hu, "Zero-Knowledge Proofs of Retrievability," Science China Information Science, vol. 54, no. 8, pp. 1608-1617, 2011.
[20] M. Mambo, K. Usuda, and E. Okamoto, "Proxy Signatures for Delegating Signing Operation," Proc. Third ACM Conf. Computer and Comm. Security (CCS '96), pp. 48-57, 1996.
[21] M. Hwang, J. Lu, and E. Lin, "A Practical (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem," IEEE Trans. Knowledge and Data Eng., vol. 15, no. 6, pp. 1552-1560, Nov./Dec. 2003.
[22] B. Libert and D. Vergnaud, "Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption," IEEE Trans. Information Theory, vol. 57, no. 3, pp. 1786-1802, Mar. 2011.
[23] S. Pack, H. Rutagemwa, X. Shen, J. Mark, and K. Park, "Proxy-Based Wireless Data Access Algorithms in Mobile Hotspots," IEEE Trans. Vehicular Technology, vol. 57, no. 5, pp. 3165-3177, Sept. 2008.
[24] D. Boneh and M. Franklin, "Identity-Based Encryption from the Weil Pairing," Proc. 21st Ann. Int'l Cryptology Conf. (CRYPTO '01), pp. 213-229, 2001.
[25] A. Miyaji, M. Nakabayashi, and S. Takano, "New Explicit Conditions of Elliptic Curve Traces for FR-Reduction," IEICE Trans. Fundamentals, vol. 5, pp. 1234-1243, 2001.
[26] D. Boneh, B. Lynn, and H. Shacham, "Short Signatures from the Weil Pairing," Proc. Seventh Int'l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT '01), pp. 514-532, 2001.
[27] R. Kumanduri, Number Theory with Computer Applications. Prentice Hall, 1998.
[28] V. Miller, "Uses of Elliptic Curves in Cryptography," Proc. Fifth Ann. Int'l Cryptology Conf. (CRYPTO '85), pp. 417-426, 1985.
[29] S. Vanstone, "Responses to NISTs Proposal," Comm. ACM, vol. 35, pp. 50-52, 1992.
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool