Novel Framework for Public Auditing with Privacy Preserving in Cloud
|International Journal of Computer Science and Engineering|
|© 2015 by SSRG - IJCSE Journal|
|Volume 2 Issue 7|
|Year of Publication : 2015|
|Authors : Laxman Dande, Soppari Kavitha|
How to Cite?
Laxman Dande, Soppari Kavitha, "Novel Framework for Public Auditing with Privacy Preserving in Cloud," SSRG International Journal of Computer Science and Engineering , vol. 2, no. 7, pp. 31-34, 2015. Crossref, https://doi.org/10.14445/23488387/IJCSE-V2I7P110
Cloud Computing is emerging more into the market as the demand for cloud architecture is increasing day by day. Most of the companies are opting for the cloud architecture and as the cloud being a common resource sharing platform the data should be guarded and must be monitored at regular time intervals. Coming with this paper, it is giving an opportunity for the user to maintain data with more secured manner and also audit functionality is provided to monitor the data present in cloud at any given point of time. Coming with the process of auditing earlier it was like the data from cloud was downloaded and then the auditing was done which is time consuming process and moreover the data might be hacked during this long process. In proposed paper, we have designed a system using which the auditing will be done at the cloud server and not after downloading the data from the cloud.
Guarded, Auditing, hacked, Cloud Computing.
1."Byzantine disk paxos: optimal resilience with Byzantine shared memory", Distributed Computing, 2006, pp. 387-408.
2. C. N. Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognit. Lett., vol. 25, pp. 481–494, Mar. 2004.
3.S. J. Lin, S. K. Chen, and J. C. Lin, “Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expansion,”J. Vis. Commun. Image Represent., vol. 21, pp. 900–916, Nov.2010.
4.G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Cryptography for general access structures,” Inf. Computat., vol. 129, no. 2,pp. 86–106, Sep. 1996.
5.Reader in Computer Science, Royal Holloway, University of LondonDistributed Systems, Cloud Computing, Fault-Tolerance - I. Abraham, G. Chockler, I. Keidar and D. Malkhi.
6.G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalableand Efficient Provable Data Possession,” in Proc. InternationalConference on Security and Privacy in Communication Networks(SecureComm), 2008.
7.C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia, “DynamicProvable Data Possession,” in Proc. ACM Conference on Computerand Communications Security (CCS), 2009, pp. 213–222.