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

Proxy Cryptography Based on Data Uploading and Data Integrity in Cloud

Hafsa Fatima Amreen, Ms. FirdousRehana, Dr. G.S.S Rao, ,
Nawab ShahAlam khan College of Engineering and Technology, Hyd
:10.22362/ijcert/2017/v4/i10/xxxx [UNDER PROCESS]

Many consumers wish to reserved their knowledge publicly cloud server (pcs). Along with the immersive evolution of cloud computing. There is a drawback within the security thus this security problem needs to be resolved to help purchasers to endeavor their knowledge in pcs. When pcs approach is incommodious for the consumer to the method the info the consumer can become envoy its proxy and so transfer them. There’s Associate in nursing another responsibility drawback referred to as remote knowledge integrity checking cloud storage publicly. It permits the consumer to examine whether or not their outsourced knowledge is unbroken flawless while not downloading the fundamental experience. From this security drawback, we tend to propose unique remote knowledge integrity. Checking and proxy originated knowledge uploading on identity-based publicly cloud employing a linear pairingripu-IDC protocol is represented. Supported the hardness of Diffie dramatist drawback the ripper-IDC protocol is assured. The particular ripe-IDC protocol is additionally coherent and pliant. Depends on the initial consumer authorization. The planned ripu-IDC will notice confidential remote knowledge integrity checking, emisory remote knowledge integrity checking and public remote knowledge integrity checking.

Hafsa Fatima Amreen and Dr. G.S.S Rao (2017). Proxy Cryptography Based on Data Uploading and Data Integrity in Cloud . International Journal of Computer Engineering In Research Trends, 4(10), 392-399. Retrieved from

Keywords : Public Cloud Server, Integrity Checking, BilinearPairing, Coherent, And Pliant.

[1] V. Saiharitha, S. J. Saritha, “A privacy and dynamic multi-keyword ranked search scheme over cloud data encrypted” ,” IEICE Trans. Commun.,  pp. 190–200, 2016. 
[2] Y. Ren, J. Shen, J. Wang, J. Han, and S. Lee, “Mutual verifiable provable data auditing in public cloud storage,” J. Internet Technol., vol. 16, no. 2, pp. 317–323, 2015. 
[3] M. Mambo, K. Usuda, and E. Okamoto, “Proxy signatures for delegating signing operation,” in Proc. CCS, 1996, pp. 48– 57.
[4] E.-J. Yoon, Y. Choi, and C. Kim, “New ID-based proxy signature scheme with message recovery,” in Grid and Pervasive Computing (Lecture Notes in Computer Science), vol. 7861. Berlin, Germany: SpringerVerlag, 2013, pp. 945– 951. 
[5] B.-C. Chen and H.-T.Yeh, “Secure proxy signature schemes from the weil pairing,” J. Supercomput., vol. 65, no. 2, pp. 496–506, 2013.
[6] X. Liu, J. Ma, J. Xiong, T. Zhang, and Q. Li, “Personal health records integrity verification using attribute based proxy signature in cloud computing,” in Internet and Distributed Computing Systems (Lecture Notes in Computer Science), vol. 8223. Berlin, Germany: SpringerVerlag, 2013, pp. 238– 251. 
[7] H. Guo, Z. Zhang, and J. Zhang, “Proxy re-encryption with unforgeable re-encryption keys,” in Cryptology and Network Security (Lecture Notes in Computer Science), vol. 8813. Berlin, Germany: Springer-Verlag, 2014, pp. 20–33. 
[8] E. Kirshanova, “Proxy re-encryption from lattices,” in Public-Key Cryptography (Lecture Notes in Computer Science), vol. 8383. Berlin, Germany: Springer-Verlag, 2014, pp. 77–94. 
[9] P. Xu, H. Chen, D. Zou, and H. Jin, “Fine-grained and heterogeneous proxy re-encryption for secure cloud storage,” Chin. Sci. Bull., vol. 59, no. 32, pp. 4201–4209, 2014.
[10] S. Ohata, Y. Kawai, T. Matsuda, G. Hanaoka, and K. Matsuura, “Re-encryption verifiability: How to detect malicious activities of a proxy in proxy re-encryption,” in Proc. CT-RSA Conf., vol. 9048. 2015, pp. 410–428. 
[11] G. Ateniese et al., “Provable data possession at untrusted stores,” in Proc. CCS, 2007, pp. 598–609. 
[12] G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proc. SecureComm, 2008, Art. ID 9. 
[13] C. C. Erway, A. Küpçü, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in Proc. CCS, 2009, pp. 213–222. 
[14] E. Esiner, A. Küpçü, and Ö. Özkasap, “Analysis and optimization on FlexDPDP: A practical solution for dynamic provable data possession,” Intelligent Cloud Computing (Lecture Notes in Computer Science), vol. 8993. Berlin, Germany: Springer-Verlag, 2014, pp. 65–83. 
[15] E. Zhou and Z. Li, “An improved remote data possession checking protocol in cloud storage,” in Algorithms and Architectures for Parallel Processing (Lecture Notes in Computer Science), vol. 8631. Berlin, Germany: SpringerVerlag, 2014, pp. 611–617. 
[16] H. Wang, “Proxy provable data possession in public clouds,” IEEE Trans. Services Comput., vol. 6, no. 4, pp. 551– 559, Oct./Dec. 2013. 
[17] H. Wang, “Identity-based distributed provable data possession in multicloud storage,” IEEE Trans. Services Comput., vol. 8, no. 2, pp. 328–340, Mar./Apr. 2015. 
[18] H. Wang, Q. Wu, B. Qin, and J. Domingo-Ferrer, “FRR: Fair remote retrieval of outsourced private medical records in electronic health networks,” J. Biomed. Inform., vol. 50, pp. 226–233, Aug. 2014. 
[19] H. Wang, “Anonymous multi-receiver remote data retrieval for pay-TV in public clouds,” IET Inf. Secur., vol. 9, no. 2, pp. 108–118, Mar. 2015.
[20] H. Shacham and B. Waters, “Compact proofs of retrievability,” in Proc. ASIACRYPT, vol. 5350.2008, pp. 90– 107.
[21] Q. Zheng and S. Xu, “Fair and dynamic proofs of retrievability,” in Proc. CODASPY, 2011, pp. 237–248.
[22] D. Cash, A. Küpçü, and D. Wichs, “Dynamic proofs of retrievability via oblivious RAM,” in Proc. EUROCRYPT, vol. 7881. 2013, pp. 279–295. 
[23] J. Zhang, W. Tang, and J. Mao, “Efficient public verification proof of retrievability scheme in cloud,” Cluster Comput., vol. 17, no. 4, pp. 1401–1411, 2014.
[24] J. Shen, H. Tan, J. Wang, J. Wang, and S. Lee, “A novel routing protocol providing good transmission reliability in underwater sensor networks,” J. Internet Technol., vol. 16, no. 1, pp. 171–178, 2015. 
[25] T. Ma et al., “Social network and tag sources based augmenting collaborative recommender system,” IEICE Trans. Inf. Syst., vol. E98-D, no. 4, pp. 902–910, 2015. //
[26] P.FARZANA, A.HARSHAVARDHAN,”Integrity Auditing for Outsourced DynamicCloud Data with Group User Revocation.”International Journal of Computer Engineering in Research Trends., vol.2, no.11, pp. 877-881, 2015.
[27] N. Meghasree,U.Veeresh and Dr.S.Prem Kumar,”Multi Cloud Architecture to Provide DataPrivacy and Integrity.”International Journal of Computer Engineering in Research Trends., vol.2, no.9, pp. 558-564, 2015.
[28] A.Shekinahpremasunaina,”Decentralized Fine-grained Access Controlscheme for Secure Cloud Storage data.”International Journal of Computer Engineering in Research Trends., vol.2, no.7, pp. 421-424, 2015.
[29] P. Rizwanakhatoon andDr.C.MohammedGulzar ,”SecCloudPro:A Novel Secure CloudStorage System for Auditing andDeduplication.”International Journal of Computer Engineering in Research Trends., vol.3, no.5, pp. 210-215, 2016.
[30] B.Sameena Begum, P.RaghaVardhini,”Augmented Privacy-Preserving AuthenticationProtocol by Trusted Third Party in Cloud.”International Journal of Computer Engineering in Research Trends., vol.2, no.5, pp. 378-382, 2015.

DOI Link : Not yet assigned

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