GROUP USER REVOCATION AND INTEGRITY AUDITING OF SHARED DATA IN CLOUD ENVIRONMENT
Abstract
The advent of the cloud computing makes storage outsourcing becomes a rising trend, which promotes the secure remote data auditing a hot topic that appeared in the research literature. Recently some researches consider the problem of secure and efficient public data integrity auditing for shared dynamic data. In this paper, signifies that the collusion attack in the exiting scheme and provide an efficient public integrity auditing scheme with secure group user revocation based on vector commitment and verifier-local revocation group signature. Analysis shows a concrete scheme based on the scheme definition. The scheme supports the public checking and efficient user revocation and also some nice properties, such as confidently, efficiency, count ability and traceability of secure group user revocation.
Keywords
References
Amazon. (2007) Amazon simple storage service (amazon s3). Amazon. [Online]. Available: http://aws.amazon.com/s3/
Google. (2005) Google drive. Google. [Online]. Available:http://drive.google.com/
Dropbox. (2007) A file-storage and sharing service. Dropbox.[Online]. Available: http://www.dropbox.com/
Mozy. (2007) An online, data, and computer backup software.EMC. [Online]. Available: http://www.dropbox.com/
Bitcasa. (2011) Inifinite storage. Bitcasa. [Online]. Available:http://www.bitcasa.com/
Memopal. (2007) Online backup. Memopal. [Online].Available: http://www.memopal.com/
M. A. et al., “Above the clouds: A berkeley view of cloud computing,” Tech. Rep. UCBEECS, vol. 28, pp. 1–23, Feb. 2009.
M. Rabin, “Efficient dispersal of information for security,” Journal of the ACM (JACM), vol. 36(2), pp. 335–348, Apr. 1989.
J. G. et al. (2006) The expanding digital universe: A forecast of worldwide information growth through 2010. IDC. [Online]. Available: Whitepaper
G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in Proc. of ACM CCS, Virginia, USA, Oct. 2007, pp. 598–609.
A. Juels and B. S. Kaliski, “Pors: Proofs of retrievability for large files,” in Proc. of ACM CCS, Virginia, USA, Oct. 2007, pp. 584–597.
K. D. Bowers, A. Juels, and A. Oprea, “Proofs of retrievability: theory and implementation,” in Proc. of CCSW 2009, llinois, USA, Nov. 2009, pp. 43–54.
Y. Dodis, S. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in Proc. of TCC 2009, CA, USA, Mar. 2009, pp. 109–127.
Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Proofs of retrievability via hardness amplification,” in Proc. of ESORICS 2009, Saint-Malo, France, Sep. 2009, pp. 355–370.
C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in Proc. of ACM CCS, Illinois, USA, Nov. 2009, pp. 213–222.
C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-preserving public auditing for data storage security in cloud computing,” in Proc. of IEEE INFOCOM 2010, CA, USA, Mar. 2010, pp. 525–533.
J. Yuan and S. Yu, “Proofs of retrievability with public verifiability and constant communication cost in cloud,” in Proc. of International Workshop on Security in Cloud Computing, Hangzhou, China, May 2013, pp.
Refbacks
- There are currently no refbacks.
Copyright © 2012 - 2023, All rights reserved.| ijitr.com
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.