Development of enhanced Third party Auditing Scheme for Secure Cloud Storage

(1)

IJCSIET-ISSUE4-VOLUME3-SERIES2 Page 1

Development of enhanced Third party Auditing Scheme for

Secure Cloud Storage

Bhanu Prakash Chamakuri*1, D. Srikar*2, Dr. M.Suresh Babu*3

M.Tech Scholar, Dept of CSE, Grandhi Varalakshmi Institute Of Technology, Bhimavaram, Dt: West Godavari, Andhra Pradesh State, India, [email protected].

Associate Processor, Dept of CSE, Grandhi Varalakshmi Institute of Technology, Bhimavaram, Dt: West Godavari, Andhra Pradesh State, India,[email protected].

Research Director & HOD, Dept of CSE, Grandhi Varalakshmi Institute Of Technology, Bhimavaram, Dt: West Godavari, Andhra Pradesh State, India,[email protected]. ABSTRACT

The cloud computing is a latest technology which provides various services over internet environment. Cloud server allows the users to store the data. There are no verification steps in upload the data. After upload the data we are not get the confirmation. Users can access the data from cloud at anytime and anywhere. The major problem of cloud data storage is security. Many number of researchers are propose the different algorithms for resolve the security problems. Previous algorithms are not accurate for provide the efficient security.

In this paper we propose the new innovative idea for enhanced secure cloud data storage. Design the enhanced third party auditing scheme with Diffie Hellman cryptographic technique. It supports data dynamics. User can perform various operations like insert, delete and update. It gives the correctness and integrity results information with reduced communication and computation cost.

Keywords: cloud data storage, cryptographic techniques, Diffie Hellman Cryptographic technique, dynamic operations.

I.INTRODUCTION

Cloud is a large group of inter connected computers. Cloud provides the services like data storage. Cloud computing is the shared pool of configurable computing resources. Cloud provide the different services like on-demand, pay per use manner model, self service environment.

In previous cloud architectures we observe the problems with cryptographic techniques. Many issues are generated like computation cost, scalability and performance. Now in this paper we design the new privacy preserving public auditing scheme with Diffie Hellman Cryptographic. It shows the better performance and scalability.

(2)

II.RELATED WORK:

In this section we first review the related works addressing security in the cloud. Security is the major issue in the cloud. Security issues we handle with many numbers of techniques previously. Data security is the most important challenge in cloud environment. Owners store the data in cloud servers. This data is sensitive or confidential data like financials data and medical records information. Here we consider the security is the major issue.

Previously one of the cloud infrastructures was design with different components. Those components are client or user, cloud storage server, third party auditor. Third party auditor works as a verifier. TPA contains public key. TPA works as a trusted server. User computes the MAC for each and every block of data. Start the sharing of blocks from the cloud server. TPA selects the random blocks and performs the verification operation. TPA has no possibility to view the cloud data. Here no verification of cloud user whether he is authenticate or not.

Another new scheme was used previously user computes the MAC and key for each and every block. User’s share the data with MAC and keys information of blocks. TPA verifies the keys and MAC blocks of information. TPA provides the better verification privacy results. Compare to previous approach we show the improved privacy results in our proposed scheme implementation.

Disadvantages of above two approaches are 1.key was used only once 2. These approaches are useful for static data. In this paper we consider many challenges that we are going to implement with access control policies. These access control policies provide the efficient security cloud services.

III.PROBLEM STATEMENT:

We consider the problem of secure computation of outsourced data. Previous cryptographic techniques provide the chief support for secure communication over the internet. Those cryptographic techniques are RSA, DES, AES or etc. Using these algorithms it’s not possible to provide the efficient security. Now in this paper we propose new cryptographic technique for increase the cloud security data storage services. Here we configure the diffie Hellman cryptographic technique on cloud data storage. This cryptographic technique increases the security levels in cloud data storage environment.

IV.PROPOSED SYSTEM ARCHITECTURE:

The public auditing is the major drawback in cloud computing technology. In this paper we design the secure public auditing scheme for cloud storage. This design provides more security compare to all

(3)

previous technologies. Our main goal is achieve design goals. Finally we show the best results with Diffie Hellman Cryptographic Technique and auditing schemes.

4.1 Diffie Hellman Cryptographic Algorithms:

Diffie and Hellman introduced the concept of public-key cryptography. The mathematical "trick" of Diffie-Hellman key exchange is that it is relatively easy to compute exponents compared to computing discrete logarithms. Diffie-Hellman allows two parties — the ubiquitous Alice and Bob — to generate a secret key; they need to exchange some information over an unsecure communications channel to perform the calculation but an eavesdropper cannot determine the shared secret key based upon this information. Diffie-Hellman works like this. Alice and Bob start by agreeing on a large prime number, N. They also have to choose some number G so that G<N. There is actually another constraint on G, namely that it must be primitive with respect to N. Primitive is a definition that is a little beyond the scope of our discussion but basically G is primitive to N if we can find integers i so that Gi mod N = j for all

values of j from 1 to N-1. As an example, 2 is not primitive to 7 because the set of powers of 2 from 1 to 6, mod 7 (i.e., 21 mod 7, 22 mod 7 ... 26 mod 7) = {2,4,1,2,4,1}. On the other hand, 3 is primitive to 7 because the set of powers of 3 from 1 to 6, mod 7 = {3,2,6,4,5,1}.

(The definition of primitive introduced a new term to some readers, namely mod. The phrase x mod y (and read as written!) means "take the remainder after dividing x by y." Thus, 1 mod 7 = 1, 9 mod 6 = 3, and 8 mod 8 = 0. Read more about the modulo function in the appendix.) Anyway, either Alice or Bob selects N and G; they then tell the other party what the values are. Alice and Bob then work independently:

Alice...

Choose a large random number, XA < N. This is Alice's private key.

Bob...

Choose a large random number, XB < N. This is Bob's private key.

(4)

Compute YA = GXA mod N. This is Alice's public key. Exchange public key's with Bob. Compute KA = YBXA mod N Compute YB = GXB mod N. This is Bob's public key. Exchange public key's with Alice. Compute KB = YAXB mod N

Note that XA and XB are kept secret while YA and YB are openly shared; these are the private and public keys, respectively. Based on their own private key and the public key learned from the other party, Alice and Bob have computed their secret keys, KA and KB, respectively, which are equal to GXAXB mod N. Perhaps a small example will help here. Although Alice and Bob will really choose large values for N and G, I will use small values for example only; let's use N=7 and G=3. Alice... Choose XA = 2Calculate YA = 32 mod 7 = 2 Bob... Choose XB = 3 Calculate YB = 33 mod 7 = 6 Exchange public keys with Bob KA = 62 mod 7 =

Exchange public keys with Alice KB = 23 mod 7 = 1

In this example, then, Alice and Bob will both find the secret key 1 which is, indeed, 36 mod 7 (i.e., GXAXB = 32˙3). If an eavesdropper (Mallory) was listening in on the information exchange between Alice and Bob, he would learn G, N, YA, and YB which is a lot of information but insufficient to compromise the key; as long as XA and XB remain unknown, K is safe. As said above, calculating Y = GX is a lot easier than finding X = logG Y.

Ashort digression on modulo arithmetic. In the paragraph above, we noted that 36 mod 7 = 1. This can be confirmed, of course, by noting that:

36 = 729 = 104*7 + 1

There is a nice property of modulo arithmetic, however, that makes this determination a little easier, namely: (a mod x)(b mod x) = (ab mod x). Therefore, one possible shortcut is to note that 36 = (33)(33). Therefore, 36 mod 7 = (33 mod 7)(33 mod 7)

(5)

= (27 mod 7)(27 mod 7) = 6*6 mod 7 = 36 mod 7 = 1.

Diffie-Hellman can also be used to allow key sharing amongst multiple users. Note again that the Diffie-Hellman algorithm is used to generate secret keys, not to encrypt and decrypt messages.

V.CONCLUSION AND FUTURE WORK

In this paper, we proposed Diffie Hellman Cryptographic technique for privacy preserving public auditing for cloud data storage security. Here we consider the cloud computing security. Using TPA verifies the integrity and correctness data information. It uses the key exchanges process cryptographic technique that is called Diffie Hellman technique. Through this technique achieves the better security in cloud data storage. TPA handles multiple user’s requests auditing also at a time. This same approach it is useful for data dynamics. In future we design the some more new cryptographic technique like merkle hash tree and watermarking techniques enhance the privacy in cloud data storages.

VI.REFERENCES

[1] C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Storage Security in Cloud Computing,” Proc.

IEEE INFOCOM ’10, Mar. 2010.

[2] P. Mell and T. Grance, “Draft NIST Working Definition of Cloud Computing,” http://csrc.nist.gov/groups/SNS/cloudcompu ting/

index.html, June 2009.

[3] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the Clouds: A Berkeley View of Cloud Computing,” Technical Report UCB-EECS-2009-28, Univ. of California, Berkeley, Feb. 2009.

[4] Cloud Security Alliance, “Top Threats to Cloud

Computing,”http://www.cloudsecurityallian ce.org, 2010.

[5] M. Arrington, “Gmail Disaster: Reports of Mass Email Deletions,” http://www.techcrunch.com/2006/12/28/gma il-disasterreportsof-

mass-email-deletions/, 2006.

[6] J. Kincaid, “MediaMax/TheLinkup Closes Its Doors,” http://

(6)

www.techcrunch.com/2008/07/10/mediama xthelinkup-closesits-

doors/, July 2008.

[7] Amazon.com, “Amazon s3 Availability

Event: July 20, 2008,”

http://status.aws.amazon.com/s3-20080720.html, July 2008.

[8] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, “Enabling Public Auditability and Data Dynamics for Storage Security in Cloud

Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 5, pp. 847-859, May 2011.

[9] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable Data Possession at Untrusted

Stores,” Proc. 14th ACM Conf. Computer and Comm. Security (CCS ’07), pp. 598-609, 2007.

[10] M.A. Shah, R. Swaminathan, and M. Baker, “Privacy-Preserving Audit and Extraction of Digital Contents,” Cryptology ePrint

Archive, Report 2008/186, 2008.

[11] A. Juels and J. Burton, S. Kaliski, “PORs: Proofs of Retrievability for Large Files,” Proc. ACM Conf. Computer and Comm. Security

(CCS ’07), pp. 584-597, Oct. 2007.

[12] Cloud Security Alliance, “Security Guidance for Critical Areas of Focus in

Cloud Computing,”

http://www.cloudsecurityalliance. org, 2009.

[13] H. Shacham and B. Waters, “Compact Proofs of Retrievability,” Proc. Int’l Conf. Theory and Application of Cryptology and Information Security: Advances in Cryptology (Asiacrypt), vol. 5350, pp. 90-107, Dec. 2008.

[14] C. Wang, K. Ren, W. Lou, and J. Li, “Towards Publicly Auditable Secure Cloud Data Storage Services,” IEEE Network Magazine,

vol. 24, no. 4, pp. 19-24, July/Aug. 2010. [15] M.A. Shah, M. Baker, J.C. Mogul, and R. Swaminathan, “Auditing to Keep Online Storage Services Honest,” Proc. 11th USENIX Workshop Hot Topics in Operating Systems (HotOS ’07), pp. 1-6, 2007.