Providing Privacy and Data Integrity in Dynamic Group Using TPA Over Cloud Computing

Main Article Content

Gaddale Jaya Bharathi
Mohammed Gulzar

Abstract

We propose Panda, a novel public auditing mechanism for the integrity of shared data with efficient user revocation in the cloud. In our mechanism, by utilizing the idea of proxy resignatures, once a user in the group is revoked, the cloud is able to resign the blocks, which were signed by the revoked user, with a re-signing key. As a result, the efficiency of user revocation can be significantly improved, and computation and communication resources of existing users can be easily saved. Meanwhile, the cloud, which is not in the same trusted domain with each user, is only able to convert a signature of the revoked user into a signature of an existing user on the same block, but it cannot sign arbitrary blocks on behalf of either the revoked user or an existing user. By designing a new proxy re-signature scheme with nice properties, which traditional proxy re signatures do not have, our mechanism is always able to check the integrity of shared data without retrieving the entire data from the cloud. Here we have to focus on data transmitted with secure manner and revocation in cloud in open stack architecture with different techniques.

Article Details

How to Cite
[1]
Gaddale Jaya Bharathi and Mohammed Gulzar, “Providing Privacy and Data Integrity in Dynamic Group Using TPA Over Cloud Computing”, Int. J. Comput. Eng. Res. Trends, vol. 2, no. 9, pp. 651–654, Sep. 2015.
Section
Research Articles

References

John W. Rittinghouse James F. Ransome, “Cloud Computing Implementation, Management, and Security”, CRC Press Taylor & Francis Group 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487- 2742 © 2010 by Taylor and Francis Group, LLC CRC Press is an imprint of Taylor & Francis Group, an Informa business.

G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable Data Possession at Untrusted Stores,” in Proc. ACM Conference on Computer and Communications Security (CCS), 2007, pp. 598–610.

B. Wang, B. Li and H. Li, “Knox: Privacy-Preserving Auditing for Shared Data with Large Groups in the Cloud”, ACNS2012

C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy Preserving Public Auditing for Data Storage Security in Cloud Computing,” in the Proceedings of IEEE INFOCOM 2010, 2010, pp. 525–533.

P. Maheswari, B. Sindhumathi “AFS: Privacy Preserving Public Auditing With Data Freshness in the Cloud” IOSR Journal of Computer Engineering (IOSRJCE) PP 56-63

B. Wang, B. Li, and H. Li, “Panda: Public Auditing For Shared Data with Efficient User Revocation in The Cloud” IEEE Trans. Services Computing, Dec.2013

R. L. Rivest, A. Shamir, and Y. Tauman, “How to Leak a Secret,” in Proc. International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer-Verlag, 2001, pp. 552– 565

R. L. Rivest, A. Shamir, and Y. Tauman, “How to Leak a Secret,” in Proc. International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer-Verlag, 2001, pp. 552– 565.

Lakshmi et al., International Journal of Advanced Research in Computer Science and Software Engineering 4(8), August - 2014, pp. 54-62

M. Blaze, G. Bleumer, and M. Strauss, “Divertible Protocols and Atomic Proxy Cryptography,” in the Proceedings of EUROCRYPT 98. Springer Verlag, 1998, pp.127–144

Zahir Tari, RMIT University, “Security and Privacy In Cloud Computing”, IEEE Cloud Computing Published by the IEEE Computer Society 2014

B. Wang, B. Li, and H. Li, “Oruta: Privacy- Preserving Public Auditing for Shared Data in the Cloud,” in the Proceedings of IEEE Cloud 2012, 2012, pp. 295–302

Zhifeng Xiao and Yang Xiao, Senior Member, IEEE, “Security and Privacy in Cloud Computing”, IEEE Communications Surveys & Tutorials, vol. 15, no. 2,Second quarter 2013.

C. Wang, Q. Wang, K. Ren, and W. Lou, “PrivacyPreserving Public Auditing for Data Storage Security in Cloud Computing,” in Proc. IEEE International Conference on Computer Communications (INFOCOM), 2010, pp. 525–533