\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Survey on Efficient Audit Service to Ensure Data Integrity in Cloud Environment},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Survey on Efficient Audit Service to Ensure Data Integrity in Cloud Environment}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{k khushi  }

             \author[2]{Jasmeet  Singh}

             \affil[1]{  RIMT-IET, Mandi Gobindgarh/ Punjab Techincal University}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Cloud computing is an internet based computing which provides different users an opportunity to store their data in the cloud. While data outsourcing relieves the owner of the burden of the local data storage and maintenance but as they have no longer physical possession of outsourced data makes data integrity protection a very challenging task. This paper explores the secure cryptographic hash function along with some other techniques that can be used by TPA to ensure the integrity of data stored in the cloud at regular intervals or on user request.

\end{abstract}


\keywords{cloud, data integrity, secure hash algorithm, station-to-station protocol, third party auditor.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
loud computing is a general term for anything that involves delivering hosted services over the internet. These services are broadly divided into three categories: a) SaaS (Software as a Service) SaaS is a model of software deployment where consumer use the provider's application running on a cloud infrastructure through a thin client interface. b) PaaS (Platform as a Service)\par
The platforms used to develop, build and test applications are provided to the consumer by the cloud. c) IaaS (Infrastructure as a Service) This is a model in which service provider owns the equipments used to support operations, including storage, hardware, servers and networking components. The client typically pays on a per-use basis. \hyperref[b2]{[3]} Cloud computing is becoming more and more popular now a days, where data is outsourced into the cloud. Its pros include relief of the burden of the storage management, universal data access with independent geographical locations, and avoidance of capital expenditure on hardware, software and personnel maintenance. However, outsourcing data introduces new security issues. \hyperref[b3]{[4]} The first issue is data integrity. In computer security, data integrity can be defined as "the state that exists when computerized data is the same as that in the source document and has not been exposed to accidental or malicious alterations or destruction".\par
Integrity of data stored at the entrusted cloud server is not guaranteed. \hyperref[b0]{[1,}\hyperref[b3]{4]} The second issue is unfaithful cloud server providers (CSP). There are many reasons why CSPs are not always trustworthy like, for saving money and storage space, CSPs may discard the data that has not been accessed for long time (which belongs to ordinary client) or sometimes even hide data losses or corruptions to maintain a reputation.\par
As data owners outsourced their data to the cloud and do not maintain the local copy, so simple cryptographic measures cannot be used directly to monitor the integrity of data. Also simply downloading the data for monitoring integrity is not a viable solution as it incurs high cost of input/output and transmission across the network.\par
To check the integrity of data only while accessing is not sufficient as the un-accessed data left unchecked from the verification process and it might get too late to recover any loss or damage to the unchecked data.\par
In addition, from the system usability point of view, data owners should be able to just use cloud storage as if it is local, without worrying about the need to verify the correctness of data. Therefore, an external third party auditor (TPA) is required. \hyperref[b3]{[4]} The TPA is an independent authority that has expertise and capabilities to monitor the integrity of cloud data outsourced by the client and informs him about data corruption or loss, if any. \hyperref[b5]{[6]} To securely introduce an effective third party auditor (TPA), the following two fundamental requirements have to be met:  1. TPA should be able to audit the cloud data storage efficiently without asking for the local copy of data thereby reducing the on-line burden of cloud users. 2. The third party auditing process should not affect user data privacy. \hyperref[b6]{[7]} Architecture of cloud data storage service 
\section[{User}]{User}\par
Users are the data owners who have the large amount of data to be stored in the cloud and access them when needed. Users depend on cloud storage server for data computation. 
\section[{Cloud Storage Server}]{Cloud Storage Server}\par
A cloud storage server (CSS) is an entity that is managed by cloud service provider (CSP). It provides space to the user for data storage and computation. 
\section[{Third Party Auditor (TPA)}]{Third Party Auditor (TPA)}\par
An TPA is an entity who has capabilities to verify the integrity of cloud data on behalf of the user's request. \hyperref[b0]{[1]} II. 
\section[{Related Work}]{Related Work}\par
In \hyperref[b8]{[9]} author implemented mechanism in which integrity is checked at 2 sides-by cloud server (for inside attack) and by TPA (for outside attack) using digital signature with MD5.But we analyze that as cloud server is not trustworthy so data should not be exposed to the cloud. Instead user can rely on TPA who has expertise in verification process and moreover user can authenticate TPA to check for its credibility.\par
In \hyperref[b4]{[5]} author proposed auditing scheme in which TPA checks the integrity of data outsourced by user in the cloud. For monitoring integrity auditor takes cipher text from the cloud and generates original data from it using XOR. TPA calculates the hash value using SHA-1 algorithm and compares it with the hash value taken from user. If the value matches it is ensured that data is safe, otherwise tampered.\par
This approach relieves the user from worry of downloading data and verifying its correctness. This also preserves user resources that could be consumed otherwise. But there is lack of entity authentication between user and TPA which is necessary to trust third party. So we analyze that it could be better to use modified version of Diffie-Hellman i.e. STS (Station-To-Station) protocol in place of Diffie-Hellman which provides entity authentication along with key generation. Because of the security flaws (Collision Attacks) found in SHA-1 it is preferable to use SHA-2 which is more secure and strong. In public-key cryptography, the Station-to-Station (STS) protocol is a cryptographic key agreement scheme consists of Diffie-Hellman key establishment followed by an exchange of authentication signatures. In this protocol, we assume that the parameters used for the key establishment are fixed and known to all users. 
\section[{i. STS Setup}]{i. STS Setup}\par
The following data must be generated before initiating the protocol:-? An asymmetric signature key pair for each party-Required for authentication. The public portion of this key pair may be shared prior to session establishment.\par
? Key establishment parameter-The specification of a particular cyclic group and the corresponding primitive element ?. These parameters may be public. Sharing this data prior to the beginning of the session lessens the complexity of the protocol.\par
ii. Basic STS Supposing all setup data has been shared, the STS protocol proceeds as follows: (All exponentials are   ? Bob concatenates the exponentials (? y , ? x ) (order is important), signs them using his asymmetric key B, and then encrypts them with K. He sends the cipher text along with his own exponential ? y to Alice.\par
? Alice computes the shared secret key K = (? y ) x .\par
? Alice decrypts and verifies Bob's signature. ? Alice concatenates the exponentials (? x , ? y ) (order is important), signs them using her asymmetric key A, and then encrypts them with K. She sends the cipher text to Bob. ? Bob decrypts and verifies Alice's signature. 
\section[{b) Exclusive or Operation}]{b) Exclusive or Operation}\par
XOR is an operation in which same bits produce a resultant bit as 0 whereas different bits produce a resultant 1. In this, a XOR operation is done at original text along with secret value which gives cipher text. The original text can be obtained by performing an XOR operation between the secret key and resultant cipher text. c) SHA-2 SHA stands for Secure Hash Algorithm. SHA-2 is the collective name of one-way hash functions developed by the NIST. SHA-256, SHA-384, and SHA-512 pertain to hashes whose outputs are 256 bits, 384 bits and 512 bits, respectively.\par
A hash function is an algorithm that transforms (hashes) an arbitrary set of data elements into a single fixed length value (the hash). The computed hash value may then be used to check the integrity of copies of the original data without providing any means to derive the source (irreversibly). A hash value therefore may be freely distributed or stored as it is only used for comparative purposes. SHA-2 features a higher level of security than its predecessor, SHA-1.\par
The comparisons between the SHA parameters are shown in table  {\ref 1}. 
\section[{Table 1 : Comparison of SHA Parameters}]{Table 1 : Comparison of SHA Parameters}\par
The security provided by a hashing algorithm is entirely dependent upon its ability to produce a unique value for any specific set of data. When a hash function produces the same hash value for two different sets of data then a collision is said to occur. Collision raises the possibility that an attacker may be able to computationally craft sets of data which provide access to information secured by the hashed values of pass codes or to alter computer data files in a fashion that would not change the resulting hash value and would thereby escape detection. A strong hash function (e.g. SHA-2) is one that is resistant to such computational attacks.  {\ref [10]} An overview of SHA-256 is given here, and then the differences between SHA-256 and the other members of the SHA-2 family are outlined. The SHA-256 algorithm essentially consists of 3 stages: (1) message i. Message Padding and Parsing\par
The binary message to be processed is appended with a '1' and padded with zeros until its length 448 mod 512. The original message length is then appended as a 64-bit binary number. The resultant padded message is parsed into N 512-bit blocks, denoted M (1) , M (2) , ??. M (N )  . These M (i ) message blocks are passed individually to the message expander. 
\section[{ii. Message Expansion}]{ii. Message Expansion}\par
The functions in the SHA-256 algorithm operate on 32-bit words, so each 512-bit M (i ) block from the padding stage is viewed as 16 32-bit blocks denoted M t (i )\par
, 0 ? t ? 15.The message expander (also called the message scheduler) takes each M (i ) and expands it into 64 32-bit W t blocks.\par
iii. Message Compression The W t words from the message expansion stage are then passed to the SHA compression function, or the 'SHA core'. The core utilizes 8 32-bit working variables labeled A, B, . . . , H, which are initialized to predefined values H 0 (0) -H 7 (0) at the start of each call to the hash function. Sixty-four iterations of the compression function are then performed and intermediate hash value H (i ) is calculated:H 0 (i ) = A + H 0 (i?1) , H 1 (i ) = B + H 1 (i?1) , . . . , H 7 (i )\par
The SHA-256 compression algorithm then repeats and begins processing another 512-bit block from the message padder. After all N data blocks have been processed, the final 256-bit output, H (N) , is formed by concatenating the final hash values: The SHA-512 algorithm has a similar structure to the SHA-256 algorithm, where: (i) it processes messages in blocks of 1024 bits rather than 512 bits; (ii) it uses 64-bit operations instead of 32-bit operations; (iii) it iterates its compression function 80 times rather than 64 times, but are otherwise similar in structure. \hyperref[b7]{[8]} IV.H (N ) = H 0 (N ) \& H 1 (N ) \& H 2\textbf{(}\par
Cloud Computing today is the beginning of network based computing over internet in force. So monitoring integrity of cloud data storage is of critical importance. For this, third party auditor who has expertise in verification process can monitor integrity on behalf of user. The techniques mentioned above can be used to achieve the auditing task efficiently. We believe that monitoring integrity of cloud storage data is very much needed as data in cloud is not secure. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_3}C}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 2 :}\end{figure}
  			\footnote{© 2013 Global Journals Inc. (US) Year} 			\footnote{© 2013 Global Journals Inc. (US)} 			\footnote{© 2013 Global Journals Inc. (US) Year} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Ramane and Elangovan (2012)]{b5}\label{b5} 	 		‘A MetaData Verification Scheme for Data Auditing in Cloud Environment’.  		 			Muralikrishnan Ramane 		,  		 			Bharath Elangovan 		.  	 	 		\textit{International Journal on Cloud Computing: Services and Architecture (IJCCSA)}  		August 2012. 2  (4) .  	 
\bibitem[Wan et al.]{b3}\label{b3} 	 		\textit{A XOR based Public Auditing Scheme for Proof-of-Storage},  		 			Changsheng Wan 		,  		 			Juan Zhang 		,  		 			Zhongyuan Qin 		.  		 	 
\bibitem[Govinda and Sathiyamoorthy ()]{b4}\label{b4} 	 		‘Data Auditing in Cloud Environment using Message Authentication Code’.  		 			K Govinda 		,  		 			E Sathiyamoorthy 		.  	 	 		\textit{International Conference on Emerging Trends on Advanced Engineering Research (ICETT)},  				2012.  	 
\bibitem[Attas and Batrafi]{b8}\label{b8} 	 		‘Efficient integrity checking technique for securing client data in cloud computing’.  		 			Dalia Attas 		,  		 			Omar Batrafi 		.  	 	 		\textit{International Journal of Electrical \& Computer Sciences (IJECS-IJENS)}  		11 p. 5.  	 
\bibitem[Mcevoy et al.]{b7}\label{b7} 	 		\textit{Optimisation of the SHA-2 Family of Hash Functions on FPGAs},  		 			Robert P Mcevoy 		,  		 			Francis M Crowe 		,  		 			Colin C Murphy 		,  		 			William P Marnane 		.  		 	 
\bibitem[Dhabale and Pavale]{b6}\label{b6} 	 		‘Providing Secured Data Storage by Privacy and Third Party Auditing in Cloud’.  		 			Lingaraj Dhabale 		,  		 			Priti Pavale 		.  	 	 		\textit{International Conference on Computing and Control Engineering},  				p. .  	 	 (ICCCE 2012) 
\bibitem[Saibabu et al. ()]{b2}\label{b2} 	 		‘Security Provision in Publicly Auditable Secure Cloud Data Storage Services using SHA-1 Algorithm’.  		 			Akkala Saibabu 		,  		 			T Satyanarayana 		,  		 			Murthy 		.  	 	 		\textit{International Journal of Computer Science and Information Technologies (IJCSIT)}  		2012. 3  (3) .  	 
\bibitem[Reenu Sara Georeg and Sabitha (2013)]{b0}\label{b0} 	 		‘Survey on Data Integrity in Cloud Computing’.  		 			Reenu Sara Georeg 		,  		 			S Sabitha 		.  	 	 		\textit{International Journal of Advanced Research in Computer Engineering \& Technology (IJARCET)}  		January 2013. 2  (1) .  	 
\bibitem[Govinda et al. (2012)]{b1}\label{b1} 	 		‘Third Party Auditing for Secure Data Storage in Cloud through Digital Signature using RSA’.  		 			K Govinda 		,  		 			V Gurunathprasad 		,  		 			H Sathishkumar 		.  	 	 		\textit{International Journal of Advanced Scientific and Technical Research}  		August 2012. 4  (2) .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
