\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={A Survey on Secure Storage Services in Cloud Computing},
 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{2012-05-15 (revised: 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-05-15}
\title{A Survey on Secure Storage Services in Cloud Computing}
\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]{Ms.  B.Tejaswi}

             \author[2]{  Dr.L.V.Reddy}

             \author[3]{Ms.  M.Leelavathi}

             \affil[1]{  Sree Vidyanikethan Engg College}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 April 2012 Accepted: 2 May 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


Cloud computing is an emerging technology and it is purely based on internet and its environment. It provides different services to users such as Software-as-a-Service (SaaS), PaaS, IaaS, Storage-as-a-service (SaaS). Using Storage-as-a-Service, users and organizations can store their data remotely which poses new security risks towards the correctness of data in cloud. In order to achieve secure cloud storage, there exists different techniques such as flexible distributed storage integrity auditing mechanism, distributed erasure-coded data, Merkle Hash Tree(MHT) construction etc. These techniques support secure and efficient dynamic data storage in the cloud. This paper also deals with architectures for security and privacy management in the cloud storage environment.

\end{abstract}


\keywords{cloud computing, data correctness, distributed data integrity, auditing, security.}

\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
rom the perspective of data security in cloud, this has always been an important aspect of quality of service. The data stored in the cloud may be frequently updated by the users, including insertion, deletion, modification, appending, reordering, etc. To ensure storage correctness under dynamic data update is hence of paramount importance. In \hyperref[b0]{[1]}, as cloudbased services continues to grow, it has become clear that one of the key barriers to rapid adoption of enterprise cloud services is customer concern over data security (confidentiality, integrity, and availability). According to sun micro systems, the concept of transparent security makes the case that the intelligent disclosure of security design, practices, and procedures can help to improve customer confidence. According to K Ren, C.Wang and Q.Wang (Ref \hyperref[b1]{[2]}), cloud storage allows data owners to outsource their data to cloud. However owners no longer have physical possession of the outsourced data raises big security concerns on the storage correctness. Hence, enabling secure storage auditing in the cloud environment with new approaches becomes imperative and challenging. In \hyperref[b2]{[3]}, the authors specified a new scheme called Proof of Retrievability (POR), is a kind of cryptographic proof and is designed to handle large file. In \hyperref[b3]{[4]}, the authors introduced a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The PDP model for remote data checking supports large data sets in widely-distributed storage systems.In \hyperref[b4]{[5]}, the authors specified third party auditing which is important in creating online service-orientedstorage economy. It allows customers to evaluate risks. Also the authors introduced two types of auditing mechanisms; those are internal auditing and external auditing. In \hyperref[b5]{[6]}, the authors introduced privacypreserving protocols. To make storage services accountable for data loss, authors presented protocols that allow a third-party auditor to periodically verify the data stored by a service and assist in returning the data intact to the customer. Most importantly, protocols for privacy-preserving never reveal the data contents to the auditor. In \hyperref[b6]{[7]}, the authors dealt with data dynamics. In order to achieve efficient data dynamics authors improved the Proof of Retrievability model by manipulating the classic Merkle Hash Tree (MHT) construction for block tag authentication. In \hyperref[b7]{[8]}, the authors (Q. Wang, K. Ren, W. Lou, and Y. Zhang) proposed a novel dependable and secure data storage scheme with dynamic integrity assurance. Based on the principle of secret sharing and erasure coding, they first proposed a hybrid share generation and distribution scheme to achieve reliable and fault-tolerant initial data storage by providing redundancy for original data components. In \hyperref[b9]{[10]}, the authors introduced the concept of an aggregate signature, and presented security models for such digital signatures, and given several applications for aggregate signatures. They have constructed an e-client aggregate signature from a recent short signature scheme based on bilinear maps. In \hyperref[b9]{[10]}, the authors described a privacy manager for cloud computing, which reduces the risk to the cloud computing user of their private data being stolen or misused, and also assists the cloud computing provider to conform to privacy law. They described different possible architectures for privacy management in cloud computing; given an algebraic description of obfuscation, one of the features of the privacy manager; and described how the privacy manager might be used to protect private metadata of online photos. In \hyperref[b10]{[11]}, the authors explored a newly emerging problem of information leakage caused by indexing in the cloud. They designed a three-tier data protection architecture to accommodate various levels of privacy concerns by users. According to the architecture, they developed a novel portable data binding technique to ensure strong enforcement of users' privacy requirements at server side. 
\section[{II.}]{II.} 
\section[{Methods}]{Methods} 
\section[{a) Concept of Transparent security}]{a) Concept of Transparent security}\par
According to NIST (National Institute of Standards and Technology)Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. 
\section[{i. Definition of Transparent security}]{i. Definition of Transparent security}\par
Transparent security can be defined as appropriate disclosure of the governance aspects of security design, policies, and practices. A security policy explains the high level approach to security and typically represents an organization's executive management position on security and risk. The policy might state that user data will be protected from unauthorized access both while being stored in the cloud and while in transit. The security design might then go into more detail by specifying that file-level encryption will be used along with an identity management implementation that restricts access to stored data. Security practices might also drill down further, describing the processes for proper management of encryption keys. The actual implementation would then choose a specific encryption algorithm such as Advanced Encryption Standard (AES). 
\section[{ii. Transparent Security Principles}]{ii. Transparent Security Principles}\par
The following transparent security principles help to identify the types of information that should and/or should not be disclosed. The following conditions are examples of when disclosure is recommended:\par
? Principle-1-Disclosure of common security policies and practices. Common security features such as the use of firewalls and encryption of data in transmission or at rest should be disclosed because they are considered basic security features that most security people would expect to be in place anyway. ? Principle-2-Disclosure when mandated. When disclosure is imperative due to a legal or regulatory requirement, then this disclosure must be performed. ? Principle-3-Security architecture. Security architectural details that may either help or hinder security management should be disclosed. For example, the implementation of secure by default configuration should be disclosed. However, if these types of details also create a security risk as described in other items below, disclosure would not be appropriate. high probability, it will also have suppressed a number of sentinels. It is therefore, unlikely to respond correctly to the verifier. To protect against corruption by the prover of a small portion of F error correcting codes are there. Let F' refer to the full, encoded file stored with the prover. 
\section[{c) Provable Data Possession (PDP) Model}]{c) Provable Data Possession (PDP) Model}\par
Provable data possession (PDP) model provides probabilistic proof that a third party stores a file. The model is unique in that it allows the server to access small portions of the file in generating the proof; the above technique is used to access the entire file. Within this model, the authors (Ref \hyperref[b3]{[4]}) give the first provably-secure scheme for remote data checking. The client stores a small O (1) amount of metadata to verify the server's proof. This model uses homomorphic verifiable tags. Because of the homomorphic property, tags computed for multiple file blocks can be combined into a single value. The client pre-computes tags for each block of a file and then stores the file and its tags with a server. At a later time, the client can verify that the server possesses the file by generating a random challenge against a randomly selected set of file blocks. Using the queried blocks and their corresponding tags, the server generates a proof of possession. The client is thus convinced of data possession, without actually having to retrieve file blocks. A PDP protocol checks that an outsourced storage site retains a file, which consists of a collection of n blocks. The client C (data owner) preprocesses the file, generating a piece of metadata that is stored locally, transmits the file to the server S, and may delete its local copy. The server stores the file and responds to challenges issued by the client. d) Third Party Auditing (TPA) Third Party Auditor: 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. The task of TPA is to verify integrity of the dynamic data stored in the cloud. Users rely on the CS for cloud data storage and maintenance. They may also dynamically interact with the CS to access and update their stored data for various application purposes. The users may resort to TPA for ensuring the storage security of their outsourced data, while hoping to keep their data private from TPA. We consider the existence of a semi-trusted CS as does. Namely, in most of time it behaves properly and does not deviate from the prescribed protocol execution. However, during providing the cloud data storage based services, for their own benefits the CS might neglect to keep or deliberately delete rarely accessed data files which belong to ordinary cloud users. Moreover, the CS may decide to hide the data corruptions caused by server hacks or Byzantine failures to maintain reputation. We assume the TPA, who is in the business of auditing, is reliable and independent, and thus has no incentive to collude with either the CS or the users during the auditing process. Erasure Code -An (k, n) erasure code encodes a block of data into n fragments, each has 1/k the size of the original block and any k fragments can be used to reconstruct the original data block. Examples are Reed Solomon (RS) codes and Rabin's Information Dispersal Algorithm.\par
In the basic scheme, suppose a sensor node v has data to be stored locally. To protect data, it can perform the following operations to ensure the data integrity and confidentiality:\par
? Step 1: Generate a random session key kr and compute the keyed hash value h(data, kr) of data. ? Step 2: Encrypt data, h (data, kr) with kr and obtain \{data, h (data, kr)\}kr . ? Step 3: Encrypt kr using the key KUV shared between the authorized users and itself. This key can be either symmetric or asymmetric depending on the chosen user access control mechanism, which is independent to our design here and will not be discussed in this paper.\par
? Step 4: Store DATA =< \{data, h(data, kr)\}kr , \{kr\}KUV > and destroy kr.\par
III. 
\section[{Architectures a) Privacy Manager in the Client}]{Architectures a) Privacy Manager in the Client}\par
Privacy Manager Software on the client helps users to protect their privacy when accessing cloud services. A central feature of the Privacy Manager is that it can provide obfuscation and de-obfuscation service, to reduce the amount of sensitive information held within the cloud. Privacy Manager allows the user to express privacy preferences about the treatment of their personal information, including the degree and type of obfuscation used. Personae -in the form of icons that correspond to sets of privacy preferences -can be used to simplify this process and make it more intuitive to the user.\par
Volume XII Issue XII Version I Privacy Manager may be deployed in a local network, or a private cloud, to protect information relating to multiple parties. This would be suitable in environments, such as enterprise environments, where local protection of information is controlled in an adequate manner and its principal use would be to control personal information passing to a public cloud.   
\section[{Conclusion}]{Conclusion}\par
This paper dealt with different security models to protect the data which is stored in the cloud. According to the user requirements, they may choose the most appropriate model. However, in the case of Third Party Auditing (TPA), cloud data storage security is critical because of its poor service quality. This paper also dealt with different architectural representations for privacy management. We provide the extension of the proposed one to support TPA, so that the users can safely delegate the integrity checking tasks.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}FA}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{221}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 2 . 2 . 1 :A}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{241}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Fig. 2 . 4 . 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}A}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{321}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Fig. 3 . 2 . 1 :}\end{figure}
  			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Pearson et al. ()]{b9}\label{b9} 	 		‘A Privacy Manager for Cloud Computing’.  		 			S Pearson 		,  		 			Y Shen 		,  		 			M Mowbray 		.  	 	 		\textit{Proc. Int'l Conf. Cloud Computing (CloudCom)},  				 (Int'l Conf. Cloud Computing (CloudCom))  		2009. p. .  	 
\bibitem[Boneh et al. ()]{b8}\label{b8} 	 		‘Aggregate and Verifiably Encrypted Signatures from Bilinear Maps’.  		 			D Boneh 		,  		 			C Gentry 		,  		 			B Lynn 		,  		 			H Shacham 		.  	 	 		\textit{Proc. 22nd Int'l Conf. Theory and Applications of Cryptographic techniques (Eurocrypt '03)},  				 (22nd Int'l Conf. Theory and Applications of Cryptographic techniques (Eurocrypt '03))  		2003. p. .  	 
\bibitem[Shah et al. ()]{b4}\label{b4} 	 		‘Auditing to Keep Online Storage Services Honest’.  		 			M A Shah 		,  		 			M Baker 		,  		 			J C Mogul 		,  		 			R Swaminathan 		.  	 	 		\textit{Proc. 11th USENIX Workshop Hot Topics in Operating Systems (HotOS '07)},  				 (11th USENIX Workshop Hot Topics in Operating Systems (HotOS '07))  		2007. p. .  	 
\bibitem[Sun Microsystems and Inc (2009)]{b0}\label{b0} 	 		\textit{Building Customer Trust in Cloud Computing with Transparent Security},  		 			Sun Microsystems 		,  		 			Inc 		.  		 \url{https://www.sun.com/offers/details/sun\textunderscore transparency.xml,Whitepaper}  		Nov. 2009.  	 
\bibitem[Wang et al. (2009)]{b7}\label{b7} 	 		‘Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance’.  		 			Q Wang 		,  		 			K Ren 		,  		 			W Lou 		,  		 			Y Zhang 		.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		Apr.2009. p. .  	 
\bibitem[Wang et al. ()]{b6}\label{b6} 	 		‘Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing’.  		 			Q Wang 		,  		 			C Wang 		,  		 			J Li 		,  		 			K Ren 		,  		 			W Lou 		.  	 	 		\textit{Proc. 14 th European Conf. Research in Computer Security (ESORICS'09)},  				 (14 th European Conf. Research in Computer Security (ESORICS'09))  		2009. p. .  	 
\bibitem[Juels and Kaliski (2007)]{b2}\label{b2} 	 		‘PORs: Proofs of Retrievability for Large Files’.  		 			A Juels 		,  		 			B S KaliskiJr 		.  	 	 		\textit{Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07)},  				 (14th ACM Conf. Computer and Comm. Security (CCS '07))  		Oct. 2007. p. .  	 
\bibitem[Squicciarini et al. ()]{b10}\label{b10} 	 		‘Preventing Information Leakage from Indexing in the Cloud’.  		 			A Squicciarini 		,  		 			S Sundareswaran 		,  		 			D Lin 		.  	 	 		\textit{Proc. IEEE Int'l Conf. Cloud Computing},  				 (IEEE Int'l Conf. Cloud Computing)  		2010.  	 
\bibitem[Shah et al. ()]{b5}\label{b5} 	 		‘Privacy-Preserving Audit and Extraction of Digital Contents’.  		 			M A Shah 		,  		 			R Swaminathan 		,  		 			M Baker 		.  		 \url{http://eprint.iacr.org}  	 	 		\textit{Cryptology ePrint Archive}  		2008/186. 2008.  	 	 (Report) 
\bibitem[Ateniese et al. (2007)]{b3}\label{b3} 	 		‘Provable Data Possession at Untrusted Stores’.  		 			G Ateniese 		,  		 			R Burns 		,  		 			R Curtmola 		,  		 			J Herring 		,  		 			L Kissner 		,  		 			Z Peterson 		,  		 			D Song 		.  	 	 		\textit{Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07)},  				 (14th ACM Conf. Computer and Comm. Security (CCS '07))  		Oct. 2007. p. .  	 
\bibitem[Ren et al. ()]{b1}\label{b1} 	 		‘Security Challenges for the Public Cloud’.  		 			K Ren 		,  		 			C Wang 		,  		 			Q Wang 		.  	 	 		\textit{IEEE Internet Computing}  		2012. 16  (1)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
