M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for WomenProfessor, Priyadarshini Institute of Technology and Science for Women
In Cloud Computing, Storage as a Service is one of the most required services, but the security of the data
stored in the cloud using these services is the key issue. The outsourced data in the cloud has to be guaranteed with
confidentiality, integrity and access control. In this work, we device a mechanism of cloud data storage based on indirect
mutual trust between the Cloud Service Provider (CSP) and the cloud users through Trusted Third Party Auditor (TTPA).
This work facilitates the user to store their data as blocks and enables them to perform dynamic operations on blocks. The
stored data can be accessed by a group of users authorized by the data owner. The owner has the privilege to grant or
revoke access of the stored data in the cloud. The present system is providing a good security mechanism for stored data
and proper sharing of keys among authorized users, and data owner for the cryptographic mechanism.
K.NAGA SANDHYA,D.RAVIKIRAN."Security Enhancement for Enabling Dynamic Data and Mutual Trust in Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.373-378, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I64.pdf,
: Mutual trust, access control, dynamic environment, outsourcing data storage
 G. Ateniese, R. Burns, R. Curtmola, J. Herring, L.
Kissner, Z. Peterson, and D. Song, â€šProvable data
possession at untrusted stores,â€› in Proceedings of
the 14th ACM Conference on Computer and
Communications Security, ser. CCS â€™07, 2007, pp.
 F. Sebe,Â´ J. Domingo-Ferrer, A. Martinez-Balleste,
Y. Deswarte, and J.-J. Quisquater, â€šEfficient
remote data possession checking in critical
information infrastructures,â€› IEEE Trans. on
Knowl. and Data Eng., vol. 20, no. 8, 2008.
 G. Ateniese, R. D. Pietro, L. V. Mancini, and G.
Tsudik, â€šScalable and efficient provable data
possession,â€› in Proceedings of the 4th
International Conference on Security and Privacy
in Communication Netowrks, 2008, pp. 1â€“10.
 C. Erway, A. KupcÂ¸Â¨u,Â¨ C. Papamanthou, and R.
Tamassia, â€šDynamic provable data possession,â€›
in Proceedings of the 16th ACM Confer-ence on
Computer and Communications Security, 2009,
 Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou,
â€šEnabling public verifiability and data dynamics
for storage security in cloud computing,â€› in Proceedings of the 14th European Conference on
Research in Computer Security, 2009, pp. 355â€“370.
 A. F. Barsoum and M. A. Hasan, â€šProvable
possession and replication of data over cloud
servers,â€› Centre For Applied Cryp-tographic
Research, Report 2010/32, 2010,
 R. Curtmola, O. Khan, R. Burns, and G. Ateniese,
â€šMR-PDP: multiple-replica provable data
possession,â€› in 28th IEEE ICDCS, 2008, pp. 411â€“
 A. F. Barsoum and M. A. Hasan, â€šOn verifying
dynamic multi-ple data copies over cloud
servers,â€› Cryptology ePrint Archive, Report
2011/447, 2011, 2011, http://eprint.iacr.org/.
 K. D. Bowers, A. Juels, and A. Oprea, â€šHAIL: a
high-availability and integrity layer for cloud
storage,â€› in CCS â€™09: Proceedings of the 16th
ACM conference on Computer and
communications security. New York, NY, USA:
ACM, 2009, pp. 187â€“198.
 Y. Dodis, S. Vadhan, and D. Wichs, â€šProofs of
retrievability via hardness amplification,â€› in
Proceedings of the 6th Theory of Cryptography
Conference on Theory of Cryptography, 2009.
 A. Juels and B. S. Kaliski, â€šPORs: Proofs of
Retrievability for large files,â€› in CCSâ€™07:
Proceedings of the 14th ACM conference on
Computer and communications security. ACM,
2007, pp. 584â€“597.
 H. Shacham and B. Waters, â€šCompact proofs of
retrievability,â€› in ASIACRYPT â€™08, 2008, pp. 90â€“
 M. Kallahalla, E. Riedel, R. Swaminathan, Q.
Wang, and K. Fu, â€šPlutus: Scalable secure file
sharing on untrusted storage,â€› in Proceedings of
the FAST 03: File and Storage Technologies, 2003.
 E.-J. Goh, H. Shacham, N. Modadugu, and D.
Boneh, â€šSirius: Securing remote untrusted
storage,â€› in Proceedings of the Network and
Distributed System Security Symposium, NDSS,
 G. Ateniese, K. Fu, M. Green, and S. Hohenberger,
â€šImproved proxy re-encryption schemes with
applications to secure distributed storage,â€› in
 S. D. C. di Vimercati, S. Foresti, S. Jajodia, S.
Paraboschi, and P. Samarati, â€šOver-encryption:
Management of access control evolution on
outsourced data,â€› in Proceedings of the 33rd
International Conference on Very Large Data
Bases. ACM, 2007, pp. 123â€“134.
 V. Goyal, O. Pandey, A. Sahai, and B. Waters,
â€šAttribute-based encryption for fine-grained
access control of encrypted data,â€› in CCS â€™06,
2006, pp. 89â€“98.
 S. Yu, C. Wang, K. Ren, and W. Lou, â€šAchieving
secure, scalable, and fine-grained data access
control in cloud computing,â€› in INFOCOMâ€™10,
2010, pp. 534â€“542.
 R. A. Popa, J. R. Lorch, D. Molnar, H. J. Wang,
and L. Zhuang, â€šEnabling security in cloud
storage SLAs with cloud proof,â€› in Proceedings of
the 2011 USENIX conference, 2011.
 K. E. Fu, â€šGroup sharing and random access in
cryptographic storage file systems,â€› Masterâ€™s
thesis, MIT, Tech. Rep., 1999.
 W. Wang, Z. Li, R. Owens, and B. Bhargava,
â€šSecure and efficient access to outsourced data,â€›
in Proceedings of the 2009 ACM workshop on
Cloud computing security, 2009, pp. 55â€“66.
 M. Backes, C. Cachin, and A. Oprea, â€šSecure keyupdating for lazy revocation,â€› in 11th European
Symposium on Research in Computer Security,
2006, pp. 327â€“346.
 D. Boneh, C. Gentry, and B. Waters, â€šCollusion
resistant broadcast encryption with short
ciphertexts and private keys,â€› in Advances in
Cryptology - CRYPTO, 2005, pp. 258â€“275.
 D. Boneh, B. Lynn, and H. Shacham, â€šShort
signatures from the weil pairing,â€› in ASIACRYPT
â€™01: Proceedings of the 7th International
Conference on the Theory and Application of
Cryptology and Information Security, London,
UK, 2001, pp. 514â€“532.
 P. S. L. M. Barrio and M. Naehrig, â€šIEEE P1363.3
submission: Pairing-friendly elliptic curves of
prime order with embedding degree 12,â€› New
Jersey: IEEE Standards Association, 2006.
 Amazon Web Service, http://aws.amazon.com/.
 P. S. L. M. Barreto and M. Naehrig, â€šPairingfriendly elliptic curves of prime order,â€› in
Proceedings of SAC 2005, volume 3897 of LNCS.
Springer-Verlag, 2005, pp. 319â€“331.
 D. L. G. Filho and P. S. L. M. Barreto,
â€šDemonstrating data possession and uncheatable data transfer,â€› Cryptology ePrint Archive, Report
 D. Naor, M. Naor, and J. B. Lotspiech,
â€šRevocation and tracing schemes for stateless
receivers,â€› in Proceedings of the 21st Annual
International Cryptology Conference on
Advances in Cryptology, ser. CRYPTO â€™01.
Springer-Verlag, 2001, pp. 41â€“62.
 M. Blaze, G. Bleumer, and M. Strauss, â€šDivertible
protocols and atomic proxy cryptography,â€› in
EUROCRYPT, 1998, pp. 127â€“144.
 M. J. Atallah, K. B. Frikken, and M. Blanton,
â€šDynamic and efficient key management for
access hierarchies,â€› in Proceedings of the 12th
ACM Conference on Computer and
Communications Security, ser. CCS â€™05. ACM,
2005, pp. 190â€“202.
 J. Fangs, Y. Chen, W.-S. Ku, and P. Liu, â€šAnalysis
of integrity vulnerabilities and a non-repudiation
protocol for cloud data storage platforms,â€› in
Proceedings of the 2010 39th International
Conference on Parallel Processing, 2010, pp. 251â€“
 J. Fangs, Y. Chen, and D. H. Summerville, â€šA fair
multi-party non-repudiation scheme for storage
clouds,â€› in 2011 International Conference on
Collaboration Technologies and Systems, 2011,
pp. 457â€“ 465.