\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={Cloud Data Storage Services Considering Public Audit for Security},
 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-05-15 (revised: 15 May 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-05-15}
\title{Cloud Data Storage Services Considering Public Audit for Security}
\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]{Swathi  Sambangi}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 April 2013 Accepted: 4 May 2013 Published: 15 May 2013}

\maketitle


\begin{abstract}
        


The cloud computing is a computing technology that allows us to share the pool of configurable sources where the data of individuals or the organisations can be stored remotely those can be accessible on-demand high quality applications. Even though there are many advantages associated with cloud computing still it brings new challenges in terms of security provided for the data storage providers as sensitive information of individuals is stored in these cloud storage providers. The owners of data expect a cloud data storage provider to be ensured with high servicelevel requirements. To ensure the deployment of cloud data storage service with security levels, some efficient methods has to be designed for the verification of the correctness of data. This paper proposes architecture for cloud computing that has a trusted entity with expertise and capability to assess cloud storage security in assistance of data owner request. The main aim of this paper is to enable public risk auditing protocols with which data owners can gain trust in cloud.

\end{abstract}


\keywords{}

\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
he cloud computing provides many of the services for IT enterprise like on demand self service, location independent resource pooling, ubiquitous network access, usage-based pricing, rapid resource elasticity and transference of risk. The primary concept of cloud computing is to provide a centralised data base or an outsourcing data from different individuals by using a cloud storage device.\par
As cloud computing allows individuals to store the data remotely, it has capability of enabling end users to use the resources provided in a rigid way. The advantage of cloud computing is it provides on demand self service methodology that authorizes users to request resources dynamically. Data owners store data on a cloud computing storage provider remotely and they can not directly use traditional cryptographic algorithm to ensure security for data. And downloading data for integrity verification costs high and even large data transmission through network frequently may support customers economically. Once if the data has been stored on cloud computing data storage provider data owner should not worry about security of data. In order to assure security for data and to enable data owner to use data without any worry about security for data, in this paper we propose publicly auditable cloud storage providers where data owners can rely on third party auditor to verify the data integrity of out sourced data to ensure security.\par
Representative network architecture for cloud data storage is illustrated in Fig. \hyperref[fig_1]{1}. Three different network entities can be identified as follows:\par
? Client: an entity, which has large data files to be stored in the cloud and relies on the cloud for data maintenance and computation, can be either individual consumers or organizations;\par
? Cloud Storage Server (CSS): an entity, which is managed by Cloud Service Provider (CSP), has significant storage space and computation resource to maintain the clients' data;\par
? Third Party Auditor (TPA): an entity, which has expertise and capabilities that clients do not have, is trusted to assess and expose risk of cloud storage services on behalf of the clients upon request. 
\section[{II.}]{II.} 
\section[{Motivation}]{Motivation}\par
Cloud data storage can be affected by two different sources. The cloud data storage provider itself is untrusted and possibly malicious.\par
There are cases in corrupting the data that is stored by users on individual servers. An adversary can compromise an individual server pollute the original data files by modifying or even by introducing its own fraudulent data to prevent the original data from being retrieved by the user.\par
There is another case where all the servers can be compromised by an attacker so that they can modify the data in files. There are many adversaries to be considered because both malicious outsiders and semitrusted cloud storage service providers can be interrupted as the malicious outsiders can economically motivate by some others for their own benefit. Even  though the cloud service providers can be some times semi trusted and most of the times they does not deviate from the executing a prescribed protocols as far as the security is being concerned, but still they might neglect to keep the files which are accessed frequently, they may cause the data corruption and even they may fail to execute the Byzantine protocols (which are meant to ensure security services.\par
The data owners could no longer physically possess the storage for their data; They cannot directly adopt cryptographic primitives to ensure the data security because downloading data every time for the purpose of integrity verification is not a feasible solution to be followed by the data owners as it is economically cannot be afforded by them. On the other side, detecting data corruption only when accessing data does not give assurance of the correctness of data, if the data size is too large. To overcome all of these challenges there is a need of third party auditing to ensure data security completely and save data of owners. 
\section[{III.}]{III.} 
\section[{Third Party Auditing}]{Third Party Auditing}\par
In Systematic point of view the auditing for cloud data storage should be real and the whole service architecture design should not be not only cryptographically strong. Below are the auditing concepts for Cloud data storage. 
\section[{a) Support Batch Auditing}]{a) Support Batch Auditing}\par
The prevalence of large-scale cloud storage service further demands auditing efficiency. When receiving multiple auditing tasks from different owners' delegations, a TPA should still be able to handle them in a fast yet cost-effective fashion. This property could essentially enable the scalability of a public auditing service even under a storage cloud with a large number of data owners. 
\section[{b) Minimize Auditing Overhead}]{b) Minimize Auditing Overhead}\par
First and foremost, the overhead imposed on the cloud server by the auditing process just not outweigh its benefits. Such overhead may include both the I/O cost for data access and the bandwidth cost for data transfer. Any extra online burden on a data owner should also be as low as possible. Ideally, after auditing delegation, the data owner should just enjoy the cloud storage service while being worry-free about storage auditing correctness. 
\section[{c) Support Data Dynamics}]{c) Support Data Dynamics}\par
As a cloud storage service is not just a data warehouse, owners are subject to dynamically updating their data via various application purposes. The design of auditing protocol should incorporate this important feature of data dynamics in Cloud Computing. 
\section[{d) Protect Data Privacy}]{d) Protect Data Privacy}\par
Data privacy protection has always been an important aspect of a service level agreement for cloud storage services. Thus, the implementation of a public auditing protocol should not violate the owner's data privacy. In other words a TPA should be able to efficiently audit the cloud data storage without demanding a local copy of data or even learning the data content. 
\section[{a) Utilizing Homomorphic Authenticators}]{a) Utilizing Homomorphic Authenticators}\par
To significantly reduce the arbitrarily large communication overhead for public auditability without introducing any online burden on the data owner, we resort to the homomorphic authenticator technique. Homomorphic authenticators are unforgettable metadata generated from individual data blocks, which can be securely aggregated in such a way to assure a verifier that a linear combination of data blocks is correctly computed by verifying only the aggregated authenticator.\par
Using this technique requires additional information encoded along with the data before outsourcing. Specifically, a data file is divided into n blocks mi (i =1, ?, n), and each block mi has a corresponding homomorphic authenticator ?i computed as its metadata to ensure the integrity. Every time it must be verified that the cloud server is honestly storing the data, the data owner or TPA can submit challenges chal = \{(i, ?i)\} for sampling a set of randomly selected blocks, where \{?i\} can be arbitrary weights. Due to the nice property of the homomorphic authenticator, server only needs to response a linear combination of the sampled data blocks ? = ?i?i ? mi, as well as an aggregated authenticator ? = ?i?i ?i, both computed from \{mi, ?i, ?i\}i?chal. Once the response of ? and ? is verified by TPA, then high probabilistic guarantee on large fraction of cloud data correctness can be obtained.1 Because off-the-shelf error-correcting code technique can be adopted before data outsourcing \hyperref[b5]{[6,}\hyperref[b9]{10]}, large fraction of current cloud data would be sufficient to recover the whole data. Note that for typical choices of block size mi and file block number n, where mi >> log(n), the response ? and ? are (essentially) about the same size as individual block mi and ?i. This means almost constant communication overhead, independent of file size, for each auditing can be achieved. Moreover, since the TPA could regenerate the fresh random sampling challenges, unbounded auditing is achieved too, which means no additional online burden would be incurred towards data owner. However, despite the desirable properties, this approach only works well for encrypted data. When directly applied to unencrypted data, it still leaks bits information towards TPA, as discussed next. 
\section[{b) Protecting Data Privacy}]{b) Protecting Data Privacy}\par
The reason that linear combination of sampled blocks may potentially reveal owner data information is due to the following fact about basic linear algebra theory: if enough linear combinations of the same blocks are collected, the TPA can simply derive the sampled data content by solving a system of linear equations.\par
This drawback greatly affects the security of using homomorphic-authenticator-based techniques in a publicly auditable cloud data storage system. From the perspective of protecting data privacy, the owners, who own the data and rely on the TPA just for the storage security of their data, do not want this auditing process introducing new vulnerabilities of unauthorized information leakage into their data security. Moreover, there are legal regulations, such as the U.S. Health Insurance Portability and Accountability Act (HIPAA)  {\ref [17]}, further demand the outsourced data not to be leaked to external parties. Exploiting data encryption before outsourcing is one way to mitigate this privacy concern, but it is only complementary to the privacypreserving public auditing scheme to be deployed in cloud. Without a properly designed auditing protocol, encryption itself cannot prevent data from flowing away toward external parties during the auditing process. Thus, it does not completely solve the problem of protecting data privacy but just reduces it to the one of managing the encryption keys. Unauthorized data leakage still remains a problem due to the potential exposure of encryption keys. To address this concern, a proper approach is to combine the homomorphic authenticator with random masking. This way, the linear combination of sampled blocks in the server's response is masked with randomness generated by the server. With random masking, the TPA no longer has all the necessary information to build up a correct group of linear equations and therefore cannot derive the owner's data content, no matter how many linear combinations of the same set of file blocks can be collected. Meanwhile, due to the algebraic property of the homomorphic authenticator, the correctness validation of the block-authenticator pairs (? and ?) can still be carried out in a new way, even in the presence of randomness.\par
This improved technique ensures the privacy of owner data content during the auditing process, regardless of whether or not the data is encrypted, which definitely provides more flexibility for different application scenarios of cloud data storage. Besides, with the homomorphic authenticator, the desirable property of constant communication overhead for the server's response during the audit is still preserved. 
\section[{c) Handling Multiple Concurrent Tasks}]{c) Handling Multiple Concurrent Tasks}\par
With the establishment of privacy-preserving public auditing in cloud computing, a TPA may concurrently handle auditing delegations on different owners' requests. The individual auditing of these tasks in a sequential way can be tedious and very inefficient for a TPA. Given K auditing delegations on K distinct data files from K different owners, it is more advantageous for a TPA to batch these multiple tasks together and perform the auditing one time, saving computation overhead as well as auditing time cost. Keeping this natural demand in mind, we note that two previous works. Can be directly extended to provide batch auditing functionality by exploring the technique of bilinear aggregate signature. Such a technique supports the aggregation of multiple signatures by distinct signers on distinct messages into a single signature and thus allows efficient verification for the authenticity of all messages. Basically, with batch auditing the K verification equations (for K auditing tasks) corresponding to K responses \{?, ?\} from a cloud server can now be aggregated into a single one such that a considerable amount of auditing time is expected to be saved. A very recent work gives the first study of batch auditing and presents mathematical details as well as security reasoning's.  
\section[{V. results}]{V. results} 
\section[{Global}]{Global}\begin{figure}[htbp]
\noindent\textbf{2013}\includegraphics[]{image-2.png}
\caption{\label{fig_0}T © 2013}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 			\footnote{BCloud Data Storage Services Considering Public Audit for Security} 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Armbrust (2009)]{b7}\label{b7} 	 		\textit{Above the Clouds: A Berkeley View of Cloud Computing},  		 			M Armbrust 		.  		Feb. 2009.  		 			Univ. California, Berkeley 		 	 	 (Tech. Rep. UCBEECS-2009-28) 
\bibitem[Amazon and Com (2008)]{b1}\label{b1} 	 		‘Amazon s3 Availability Event’.  		 			Amazon 		,  		 			Com 		.  		 \url{http://status.aws.amazon.com/s3-20080720.html}  	 	 		\textit{July}  		July 20. 2008. 2008.  	 
\bibitem[Krigsman ()]{b8}\label{b8} 	 		‘Apple's MobileMe Experiences Post-Launch Pain’.  		 			M Krigsman 		.  		 \url{http://blogs.zdnet.com/projectfailures/?p=908}  	 	 		\textit{July}  		2008.  	 
\bibitem[Mell and Grance ()]{b5}\label{b5} 	 		\textit{Draft NIST Working Definition of Cloud Computing},  		 			P Mell 		,  		 			T Grance 		.  		2009.  	 
\bibitem[Erway (2009)]{b2}\label{b2} 	 		‘Dynamic Provable Data Possession’.  		 			C Erway 		.  	 	 		\textit{Proc. ACM CCS '09},  				 (ACM CCS '09)  		Nov. 2009. p. .  	 
\bibitem[Wang (2009)]{b0}\label{b0} 	 		‘Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing’.  		 			Q Wang 		.  	 	 		\textit{Proc. ESORICS '09},  				 (ESORICS '09)  		Sept. 2009. p. .  	 
\bibitem[Arrington (2006)]{b6}\label{b6} 	 		\textit{Gmail Disaster: Reports of Mass Email Deletions},  		 			M Arrington 		.  		Dec. 2006.  	 
\bibitem[Juels et al. (2007)]{b9}\label{b9} 	 		‘PORs: Proofs of Retrievability for Large Files’.  		 			A Juels 		,  		 			J Burton 		,  		 			S Kaliski 		.  	 	 		\textit{Proc. ACM CCS '07},  				 (ACM CCS '07)  		Oct. 2007. p. .  	 
\bibitem[Wang (2010)]{b3}\label{b3} 	 		‘Privacy-Preserving Public Auditing for Storage Security in Cloud Computing’.  		 			C Wang 		.  	 	 		\textit{Proc. IEEE INFOCOM '10},  				 (IEEE INFOCOM '10)  		Mar. 2010.  	 
\bibitem[Merkle ()]{b4}\label{b4} 	 		‘Protocols for Public Key Cryptosystems’.  		 			R C Merkle 		.  	 	 		\textit{Proc. IEEE Symp. Security Privacy},  				 (IEEE Symp. Security Privacy)  		1980.  	 
\bibitem[Ateniese (2008)]{b10}\label{b10} 	 		‘Scalable and Efficient Provable Data Possession’.  		 			G Ateniese 		.  	 	 		\textit{Proc. SecureComm '08},  				 (SecureComm '08)  		Sept. 2008.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
