Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Security Enhancement for Enabling Dynamic Data and Mutual Trust in Public Cloud

M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Professor, 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 :,

Keywords : Mutual trust, access control, dynamic environment, outsourcing data storage

[1] 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.
[2] 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.
[3] 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.
[4] 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,
pp. 213–222.
[5] 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.
[6] 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,
[7] R. Curtmola, O. Khan, R. Burns, and G. Ateniese,
‚MR-PDP: multiple-replica provable data
possession,‛ in 28th IEEE ICDCS, 2008, pp. 411–
[8] 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,
[9] 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.
[10] 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.
[11] 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.
[12] H. Shacham and B. Waters, ‚Compact proofs of
retrievability,‛ in ASIACRYPT ’08, 2008, pp. 90–
[13] 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.
[14] 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,
[15] G. Ateniese, K. Fu, M. Green, and S. Hohenberger,
‚Improved proxy re-encryption schemes with
applications to secure distributed storage,‛ in
NDSS, 2005.
[16] 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.
[17] 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.
[18] 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.
[19] 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.
[20] K. E. Fu, ‚Group sharing and random access in
cryptographic storage file systems,‛ Master’s
thesis, MIT, Tech. Rep., 1999.
[21] 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.
[22] 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.
[23] 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.
[24] 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.
[25] 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.
[26] Amazon Web Service,
[27] 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.
[28] D. L. G. Filho and P. S. L. M. Barreto,
‚Demonstrating data possession and uncheatable data transfer,‛ Cryptology ePrint Archive, Report
2006/150, 2006.
[29] 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.
[30] M. Blaze, G. Bleumer, and M. Strauss, ‚Divertible
protocols and atomic proxy cryptography,‛ in
EUROCRYPT, 1998, pp. 127–144.
[31] 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.
[32] 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–
[33] 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.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal