DATA INTEGRITY PROOFS IN CLOUD STORAGE

By

A PROJECT REPORT
Submitted to the Department of Computer Science & Engineering in the FACULTY OF ENG NEE! NG & TEC"NOLOGY In partial fulfillment of the requirements for the award of the degree Of

MASTER OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING APRIL 2012

BONAFIDE CERTIFICATE
Certified that thi# pro$ect report tit%ed &DATA INTEGRITY PROOFS IN CLOUD STORAGE i# the bonafide 'or( of )r* +++++++++++++,ho carried out the re#earch under m- #uper.i#ion Certified further/ that to the be#t of m- (no'%edge the 'or( reported herein doe# not form part of an- other pro$ect report or di##ertation on the ba#i# of 'hich a degree or a'ard 'a# conferred on an ear%ier occa#ion on thi# or an- other candidate*

Signa !"# $% &# G!i'# H(O(D Na)#

Signa !"# $% &# Na)#

CHAPTER 01

ABSTRACT *
C%oud computing ha# been en.i#ioned a# the de0facto #o%ution to the ri#ing #torage co#t# of T Enterpri#e#* ,ith the high co#t# of data #torage [Link]# a# 'e%% a# the rapid rate at 'hich data i# being generated it pro.e# co#t%- for enterpri#e# or [Link]% u#er# to fre1uent%- update their hard'are* Apart from reduction in #torage co#t# data out#ourcing to the c%oud a%#o he%p# in reducing the maintenance* C%oud #torage mo.e# the u#er2# data to %arge data center#/ 'hich are remote%- %ocated/ on 'hich u#er doe# not ha.e ancontro%* "o'[Link]/ thi# uni1ue feature of the c%oud po#e# man- ne' #ecurit- cha%%enge# 'hich need to be c%ear%- under#tood and re#o%.ed* ,e [Link] a #cheme 'hich gi.e# a proof of data integrit- in the c%oud 'hich the cu#tomer can emp%o- to chec( the correctne## of hi# data in the c%oud* Thi# proof can be agreed upon b- both the c%oud and the cu#tomer and can be incorporated in the [Link] %e.e% agreement 3SLA4*

PROJECT PURPOSE*
5urpo#e of de.e%oping proof# for data po##e##ion at untru#ted c%oud #torage #[Link]# 'e are often %imited b- the re#ource# at the c%oud #[Link] a# 'e%% a# at the c%ient* [Link] that the data #i6e# are %arge and are #tored at remote #[Link]#/ acce##ing the entire fi%e can be e7pen#i.e in 8O co#t# to the #torage #[Link]* A%#o tran#mitting the fi%e acro## the net'or( to the c%ient can con#ume hea.- band'idth#* Since gro'th in #torage capacit- ha# far outpaced the gro'th in data acce## a# 'e%% a# net'or( band'idth/ acce##ing and tran#mitting the entire archi.e [Link] occa#iona%%- great%- %imit# the #ca%abi%it- of the net'or( re#ource#* Furthermore/ the 8O to e#tab%i#h the data proof interfere# 'ith the on0 demand band'idth of the #[Link] u#ed for norma% #torage and [Link] purpo#e*

PROJECT SCOPE*
C%oud #toring it# data fi%e F at the c%ient #hou%d proce## it and create #uitab%e meta data 'hich i# u#ed in the %ater #tage of .erification the data integrit- at the c%oud #torage* ,hen chec(ing for data integrit- the c%ient 1uerie# the c%oud #torage for #uitab%e rep%ie# ba#ed on 'hich it conc%ude# the integrit- of it# data #tored in the c%ient* our data integritprotoco% the .erifier need# to #tore on%- a #ing%e cr-ptographic (e- 0 irre#pecti.e of the #i6e of the data fi%e F0 and t'o function# 'hich generate a random #e1uence* The .erifier doe# not #tore an- data 'ith it* The .erifier before #toring the fi%e at the archi.e/ preproce##e# the fi%e and append# #ome meta data to the fi%e and #tore# at the archi.e*

PRODUCT FEATURES*
Our #cheme 'a# de.e%oped to reduce the computationa% and #torage [Link] of the c%ient a# 'e%% a#to minimi6e the computationa% [Link] of the c%oud #torage #[Link]* ,e a%#o minimi6ed the #i6e of the proof of data integrit- #o a# to reduce the net'or( band'idth con#umption* "ence the #torage at the c%ient i# .er- much minima% compared to a%% other #cheme# that 'ere de.e%oped* "ence thi# #cheme pro.e# [Link]# to thin c%ient# %i(e 5DA# and mobi%e phone#* The operation of encr-ption of data genera%%- con#ume# a %arge computationa% po'er* n our #cheme the encr-pting proce## i# .er- much %imited to on%- a fraction of the 'ho%e data thereb- #[Link] on the computationa% time of the c%ient* )an- of the #cheme# propo#ed ear%ier re1uire the archi.e to perform ta#(# that need a %ot of computationa% po'er to generate the proof of data integrit-* 9ut in our #cheme the archi.e $u#t need to fetch and #end fe' bit# of data to the c%ient*

INTRODUCTION*
Data out#ourcing to c%oud #torage #[Link]# i# rai#ing trend among man- firm# and u#er# o'ing to it# economic [Link]#* Thi# e##entia%%- mean# that the o'ner 3c%ient4 of the data mo.e# it# data to a third part- c%oud #torage #[Link] 'hich i# #uppo#ed to 0 pre#umab%- for a fee 0 faithfu%%- #tore the data 'ith it and [Link] it bac( to the o'ner '[Link] re1uired* A# data generation i# far outpacing data #torage it pro.e# co#t%- for #ma%% firm# to fre1uent%- update their hard'are '[Link] additiona% data i# created* A%#o maintaining the #torage# can be a difficu%t ta#(* Storage out#ourcing of data to c%oud #torage he%p# #uch firm# b- reducing the co#t# of #torage/ maintenance and per#onne%* t can a%#o a##ure a re%iab%e #torage of important data b- (eeping mu%tip%e copie# of the data therebreducing the chance of %o#ing data b- hard'are fai%ure#* Storing of u#er data in the c%oud de#pite it# [Link]# ha# man- intere#ting #ecuritconcern# 'hich need to be e7ten#i.e%- in.e#tigated for ma(ing it a re%iab%e #o%ution to the prob%em of [Link] %oca% #torage of data* n thi# paper 'e dea% 'ith the prob%em of imp%ementing a protoco% for obtaining a proof of data po##e##ion in the c%oud #ometime# referred to a# 5roof of [Link]%it- 35O!4*Thi# prob%em trie# to obtain and .erif- a proof that the data that i# #tored b- a u#er at a remote data #torage in the c%oud 3ca%%ed c%oud #torage archi.e# or #imp%- archi.e#4 i# Not modified b- the archi.e and thereb- the integrit- of the data i# a##ured* Such .erification #-#tem# [Link] the c%oud #torage archi.e# from mi#repre#enting or modif-ing the data #tored at it 'ithout the con#ent of the data o'ner b- u#ing fre1uent chec(# on the #torage archi.e#* Such chec(# mu#t a%%o' the data o'ner to efficient%-/ fre1uent%-/ 1uic(%- and #ecure%- .erif- that the c%oud archi.e i# not cheating the o'ner* Cheating/ in thi# conte7t/ mean# that the #torage archi.e might de%ete #ome of the data or ma- modif- #ome of the data*

CHAPTER 02 SYSTEM ANALYSIS * PROBLEM DEFINITION*

Storing of u#er data in the c%oud de#pite it# [Link]# ha# man- intere#ting #ecuritconcern# 'hich need to be e7ten#i.e%- in.e#tigated for ma(ing it a re%iab%e #o%ution to the prob%em of [Link] %oca% #torage of data* )an- prob%em# %i(e data authentication and integrit- 3i*e*/ ho' to efficient%- and #ecure%- en#ure that the c%oud #torage #[Link] return# correct and comp%ete re#u%t# in re#pon#e to it# c%ient#2 1uerie#/ out#ourcing encr-pted data and a##ociated difficu%t prob%em# dea%ing 'ith 1uer-ing [Link] encr-pted domain 'ere di#cu##ed in re#earch %iterature*

E+ISTING SYSTEM*
A# data generation i# far outpacing data #torage it pro.e# co#t%- for #ma%% firm# to fre1uent%- update their hard'are '[Link] additiona% data i# created* A%#o maintaining the #torage# can be a difficu%t ta#(* t tran#mitting the fi%e acro## the net'or( to the c%ient can con#ume hea.- band'idth#* The prob%em i# further comp%icated b- the fact that the o'ner of the data ma- be a #ma%% [Link]/ %i(e a 5DA 3per#ona% digita% a##i#t4 or a mobi%e phone/ 'hich ha.e %imited C5U po'er/ batter- po'er and communication band'idth*

LIMITATIONS OF E+ISTING SYSTEM*

The main dra'bac( of thi# #cheme i# the high re#ource co#t# it re1uire# for A%#o computing ha#h .a%ue for [Link] a moderate%- %arge data fi%e# can be Data encr-ption i# %arge #o the di#[Link] i# #ma%% u#er# 'ith %imited

the imp%ementation* computationa%%- burden#ome for #ome c%ient# 35DA#/ mobi%e phone#/ etc4* computationa% po'er 35DA#/ mobi%e phone# etc*4*

PROPOSED SYSTEM*
One of the important concern# that need to be addre##ed i# to a##ure the cu#tomer of the integrit- i*e* correctne## of hi# data in the c%oud* A# the data i# ph-#ica%%- not acce##ib%e to the u#er the c%oud #hou%d [Link] a 'a- for the u#er to chec( if the integrit- of hi# data i# maintained or i# compromi#ed* n thi# paper 'e [Link] a #cheme 'hich gi.e# a proof of data integrit- in the c%oud 'hich the cu#tomer can emp%o- to chec( the correctne## of hi# data in the c%oud* Thi# proof can be agreed upon b- both the c%oud and the cu#tomer and can be incorporated in the [Link] %e.e% agreement 3SLA4* t i# important to note that our proof of data integrit- protoco% $u#t chec(# the integrit- of data i*e* if the data ha# been i%%ega%%- modified or de%eted*

AD,ANTAGES OF PROPOSED SYSTEM*

Apart from reduction in #torage co#t# data out#ourcing to the c%oud a%#o

he%p# in reducing the maintenance* [Link] %oca% #torage of data* 9- reducing the co#t# of #torage/ maintenance and per#onne%* t reduce# the chance of %o#ing data b- hard'are fai%ure#* Not cheating the o'ner*

PROCESS FLO- DIAGRAMS FOR E+ISTING AND PROPOSED SYSTEM* FEASIBILITY STUDY*

The fea#ibi%it- of the pro$ect i# ana%-6ed in thi# pha#e and bu#ine## propo#a% i# put forth 'ith a .er- genera% p%an for the pro$ect and #ome co#t e#timate#* During #-#tem ana%-#i# the fea#ibi%it- #tud- of the propo#ed #-#tem i# to be carried out* Thi# i# to en#ure that the propo#ed #-#tem i# not a burden to the compan-* For fea#ibi%it- ana%-#i#/ #ome under#tanding of the ma$or re1uirement# for the #-#tem i# e##entia%*

Three (e- con#ideration# in.o%.ed in the fea#ibi%it- ana%-#i# are ECONO) CAL FEAS 9 L TY TEC"N CAL FEAS 9 L TY SOC AL FEAS 9 L TY

ECONOMICAL FEASIBILITY Thi# #tud- i# carried out to chec( the economic impact that the #-#tem 'i%% ha.e on the organi6ation* The amount of fund that the compan- can pour into the re#earch and de.e%opment of the #-#tem i# %imited* The e7penditure# mu#t be $u#tified* Thu# the de.e%oped #-#tem a# 'e%% 'ithin the budget and thi# 'a# [Link] becau#e mo#t of the techno%ogie# u#ed are free%- [Link]%ab%e* On%- the cu#tomi6ed product# had to be purcha#ed* TECHNICAL FEASIBILITY

Thi# #tud- i# carried out to chec( the technica% fea#ibi%it-/ that i#/ the technica% re1uirement# of the #-#tem* An- #-#tem de.e%oped mu#t not ha.e a high demand on the [Link]%ab%e technica% re#ource#* Thi# 'i%% %ead to high demand# on the [Link]%ab%e technica% re#ource#* Thi# 'i%% %ead to high demand# being p%aced on the c%ient* The de.e%oped #-#tem mu#t ha.e a mode#t re1uirement/ a# on%- minima% or nu%% change# are re1uired for imp%ementing thi# #-#tem* SOCIAL FEASIBILITY The a#pect of #tud- i# to chec( the %e.e% of acceptance of the #-#tem b- the u#er* Thi# inc%ude# the proce## of training the u#er to u#e the #-#tem efficient%-* The u#er mu#t not fee% threatened b- the #-#tem/ in#tead mu#t accept it a# a nece##it-* The %e.e% of acceptance b- the u#er# #o%e%- depend# on the method# that are emp%o-ed to educate the u#er about the #-#tem and to ma(e him fami%iar 'ith it* "i# %e.e% of confidence mu#t be rai#ed #o that he i# a%#o ab%e to ma(e #ome con#tructi.e critici#m/ 'hich i# 'e%comed/ a# he i# the fina% u#er of the #-#tem*

HARD-ARE AND SOFT-ARE [Link]*

HARD-ARE [Link]*

: : : : : :

S-#tem "ard Di#( )onitor )ou#e !am

; ; ; ; ;

5entium < =*> G"6* >? G9* @*>> )b* @A <GA Co%our* Logitech* A@= )b*

F%opp- Dri.e ;

SOFT-ARE [Link]*

: : :

Operating #-#tem Coding Language Data 9a#e

; ,indo'# B5* ; AS5*Net 'ith CC ; SDL [Link] =?0/

FUNCTIONAL [Link]*
Functiona% re1uirement# #pecif- 'hich output fi%e #hou%d be produced from the [Link] fi%e the- de#cribe the re%ation#hip bet'een the input and output of the #-#tem/ for each functiona% re1uirement a detai%ed de#cription of a%% data input# and their #ource and the range of .a%id input# mu#t be #pecified*

NON FUNCTIONAL [Link]*

De#cribe u#er0.i#ib%e a#pect# of the #-#tem that are not direct%- re%ated 'ith the functiona% [Link] of the #-#tem* Non0Functiona% re1uirement# inc%ude 1uantitati.e con#traint#/ #uch a# re#pon#e time 3i*e* ho' fa#t the #-#tem react# to u#er command#*4 or accurac- 33*e* ho' preci#e are the #-#tem# numerica% an#'er#*4

PSEUDO [Link]*
The c%ient that re#trict# the imp%ementation of the #-#tem impo#e# the#e re1uirement#* T-pica% p#eudo re1uirement# are the imp%ementation %anguage and the p%atform on 'hich the #-#tem i# to be imp%emented* The#e ha.e u#ua%%- no direct effect on the u#er# .ie' of the #-#tem(

LITERATURE SUR,EY*

Literature #ur.e- i# the mo#t important #tep in #oft'are de.e%opment proce##* 9efore de.e%oping the too% it i# nece##ar- to determine the time factor/ econom- n compan#trength* Once the#e thing# r #ati#fied/ ten ne7t #tep# i# to determine 'hich operating #-#tem and %anguage can be u#ed for de.e%oping the too%* Once the programmer# #tart bui%ding the too% the programmer# need %ot of e7terna% #upport* Thi# #upport can be obtained from #enior programmer#/ from boo( or from 'eb#ite#* 9efore bui%ding the #-#tem the abo.e con#ideration r ta(en into account for de.e%oping the propo#ed #-#tem* ,e ha.e to ana%-#i# the C0$!' C$)1! ing O! 0in# S!"2#y;

C0$!' C$)1! ing C%oud computing [Link] un%imited infra#tructure to #tore and e7ecute cu#tomer

data and program* A# cu#tomer# -ou do not need to o'n the infra#tructure/ the- are mere%- acce##ing or rentingE the- can forego capita% e7penditure and con#ume re#ource# a# a #[Link]/ pa-ing in#tead for 'hat the- u#e*

B#n#%i 3 $% C0$!' C$)1! ing* )inimi6ed Capita% e7penditure Location and [Link] independence Uti%i6ation and efficienc- [Link] <er- high Sca%abi%it"igh Computing po'er

S#4!"i y a )a5$" C$n4#"n* Securit- concern# ari#ing becau#e both cu#tomer data and program are re#iding in Securit- i# a%'a-# a ma$or concern in Open S-#tem Architecture#

[Link] 5remi#e#*

Da a 4#n "# S#4!"i y6 5rofe##iona% Securit- #taff uti%i6ing .ideo #[Link]%%ance/ #tate of the art intru#ion ,hen an emp%o-ee no %onger ha# a bu#ine## need to acce## datacenter hi# A%% ph-#ica% and e%ectronic acce## to data center# b- emp%o-ee# #hou%d be %ogged Audit too%# #o that u#er# can ea#i%- determine ho' their data i# #tored/ protected/

detection #-#tem#/ and other e%ectronic mean#* pri.i%ege# to acce## datacenter #hou%d be immediate%- re.o(ed* and audited routine%-* u#ed/ and .erif- po%ic- enforcement*

Da a L$4a i$n* ,hen u#er u#e# the c%oud/ u#er probab%- 'onFt (no' e7act%- 'here -our data i# Data #hou%d be #tored and proce##ed on%- in #pecific $uri#diction# a# define [Link] #hou%d a%#o ma(e a contractua% commitment to obe- %oca% pri.acData0centered po%icie# that are generated 'hen a u#er [Link]# per#ona% or ho#ted/ 'hat countr- it 'i%% be #tored inG u#er* re1uirement# on beha%f of their cu#tomer#/ #en#iti.e information/ that tra.e%# 'ith that information throughout it# %ifetime to en#ure that the information i# u#ed on%- in accordance 'ith the po%ic-

Ba47!13 $% Da a *

Data #tore in databa#e of [Link] #hou%d be redundant%- #tore in mu%tip%e Data that i# generated during running of program on in#tance# i# a%% cu#tomer Contro% of Admini#trator on Databa#e#*

ph-#ica% %ocation* data and therefore [Link] #hou%d not perform bac(up#*

Da a Sani i8a i$n* Saniti6ation i# the proce## of [Link] #en#iti.e information from a #torage ,hat happen# to data #tored in a c%oud computing [Link] once it ha# pa##ed ,hat data #aniti6ation practice# doe# the c%oud computing #[Link] [Link]

[Link]*

it# u#er2# &u#e b- dateH propo#e to imp%ement for redundant and retiring data #torage [Link]# a# and 'hen the#e [Link]# are retired or ta(en out of #[Link]* N# 9$"7 S#4!"i y* D#nia0 $% S#"2i4#; 'here #[Link]# and net'or(# are brought do'n b- a huge

amount of net'or( traffic and u#er# are denied the acce## to a certain nternet ba#ed #[Link]* Li7# DNS Ha47ing/ !outing Tab%e &5oi#oningH/ BDoS attac(# .$S ,i$0a i$n ; through conge#tion/ de%a-ing or dropping pac(et#/ or through Man in &# Mi''0# A a47; To [Link] it a%'a-# u#e SSL IP S1$$%ing; Spoofing i# the creation of TC58 5 pac(et# u#ing #omebod- e%#eF# 5 S$0! i$n; nfra#tructure 'i%% not permit an in#tance to #end traffic 'ith a #ource 5

re#ource hac(ing*

addre##* or )AC addre## other than it# o'n*

H$9 3#4!"# i3 #n4"y1 i$n S4&#)#* # it po##ib%e for a%% of m- data to be fu%%- encr-ptedG ,hat a%gorithm# are u#edG ,ho ho%d#/ maintain# and i##ue# the (e-#G 5rob%em; Encr-ption accident# can ma(e data tota%%- unu#ab%e* Encr-ption can comp%icate [Link]%abi%it- So%ution The c%oud [Link] #hou%d [Link] [Link] that encr-ption #cheme# 'ere

de#igned and te#ted b- e7perienced #pecia%i#t#* In%$")a i$n S#4!"i y* Securit- re%ated to the information e7changed bet'een different ho#t# or bet'een Thi# i##ue# pertaining to secure communication, authentication, and issues Secure communication i##ue# inc%ude tho#e #ecurit- concern# that ari#e during the The#e inc%ude confidentia%it- and integrit- i##ue#* Confidentia%it- indicate# that a%%

ho#t# and u#er#* concerning single sign on and delegation. communication bet'een t'o entitie#* data #ent b- u#er# #hou%d be acce##ib%e to on%- &%egitimateH [Link]#/ and integritindicate# that a%% data [Link] #hou%d on%- be #ent8modified b- &%egitimateH #ender#* S$0! i$n* pub%ic (e- encr-ption/ B*A?I certificate#/ and the Secure Soc(et# La-er 3SSL4 enab%e# #ecure authentication and communication [Link] computer net'or(#*

MODULES DESCRIPTION*
CLOUD STORAGE* Data out#ourcing to c%oud #torage #[Link]# i# rai#ing trend among man- firm# and u#er# o'ing to it# economic [Link]#* Thi# e##entia%%- mean# that the o'ner 3c%ient4 of the data mo.e# it# data to a third part- c%oud #torage #[Link] 'hich i# #uppo#ed to 0 pre#umab%- for a fee 0 faithfu%%- #tore the data 'ith it and [Link] it bac( to the o'ner '[Link] re1uired*

SIMPLY ARCHI,ES* Thi# prob%em trie# to obtain and .erif- a proof that the data that i# #tored b- a u#er at remote data #torage in the c%oud 3ca%%ed c%oud #torage archi.e# or #imp%- archi.e#4 i# not modified b- the archi.e and thereb- the integrit- of the data i# a##ured* C%oud archi.e i# not cheating the o'ner/ if cheating/ in thi# conte7t/ mean# that the #torage archi.e might de%ete #ome of the data or ma- modif- #ome of the data* ,hi%e de.e%oping proof# for data po##e##ion at untru#ted c%oud #torage #[Link]# 'e are often %imited b- the re#ource# at the c%oud #[Link] a# 'e%% a# at the c%ient* SENTINELS* n thi# #cheme/ un%i(e in the (e-0ha#h approach #cheme/ on%- a #ing%e (e- can be u#ed irre#pecti.e of the #i6e of the fi%e or the number of fi%e# 'ho#e [Link]%it- it 'ant# to .erif-* A%#o the archi.e need# to acce## on%- a #ma%% portion of the fi%e F un%i(e in the (e-0ha# #cheme 'hich re1uired the archi.e to proce## the entire fi%e F for each protoco% .erification* f the [Link] ha# modified or de%eted a #ub#tantia% portion of F/ then 'ith high probabi%it- it 'i%% a%#o ha.e #uppre##ed a number of #entine%#*

,ERIFICATION PHASE* The .erifier before #toring the fi%e at the archi.e/ preproce##e# the fi%e and append# #ome )eta data to the fi%e and #tore# at the archi.e* At the time of .erification the .erifier u#e# thi# )eta data to .erif- the integrit- of the data* t i# important to note that our proof of data integrit- protoco% $u#t chec(# the integrit- of data i*e* if the data ha# been i%%ega%%modified or de%eted* t doe# not [Link] the archi.e from modif-ing the data*

CHAPTER 0: SYSTEM DESIGN* Da a F0$9 Diag"a) ; U3# Ca3# Diag"a) ; F0$9 Diag"a)*
The DFD i# a%#o ca%%ed a# bubb%e chart* t i# a #imp%e graphica% forma%i#m

that can be u#ed to repre#ent a #-#tem in term# of the input data to the #-#tem/ .ariou# proce##ing carried out on the#e data/ and the output data i# generated b- the #-#tem The data f%o' diagram 3DFD4 i# one of the mo#t important mode%ing too%#* t i#

u#ed to mode% the #-#tem component#* The#e component# are the #-#tem proce##/ the data u#ed b- the proce##/ an e7terna% entit- that interact# 'ith the #-#tem and the information f%o'# in the #-#tem* DFD #ho'# ho' the information mo.e# through the #-#tem and ho' it i#

modified b- a #erie# of tran#formation#* t i# a graphica% techni1ue that depict# information f%o' and the tran#formation# that are app%ied a# data mo.e# from input to output* DFD i# a%#o (no'n a# bubb%e chart* A DFD ma- be u#ed to repre#ent a #-#tem at

an- %e.e% of ab#traction* DFD ma- be partitioned into %e.e%# that repre#ent increa#ing information f%o' and functiona% detai%*

NOTATION* SOURCE OR DESTINATION OF DATA* E7terna% #ource# or de#tination#/ 'hich ma- be peop%e or organi6ation# or other entitie#*

DATA SOURCE* "ere the data referenced b- a proce## i# #tored and [Link]*

PROCESS* 5eop%e/ procedure# or [Link]# that produce data* The ph-#ica% component i# not identified* DATA FLO-* Data mo.e# in a #pecific direction from an origin to a de#tination* The data f%o' i# a &pac(etH of data*

MODELING RULES: There are #[Link]% common mode%ing ru%e# 'hen creating DFD#; @* =* data* J* >* A* Each data #tore mu#t be in.o%.ed 'ith at %ea#t one data f%o'* Each e7terna% entit- mu#t be in.o%.ed 'ith at %ea#t one data f%o'* A data f%o' mu#t be attached to at %ea#t one proce##* A%% proce##e# mu#t ha.e at %ea#t one data f%o' in and one data f%o' out* A%% proce##e# #hou%d modif- the incoming data/ producing ne' form# of outgoing

SDLC* SPIRAL MODEL* PROJECT ARCHITECTURE*

UML DIAGRAMS* USE CASE*

Create Account

Login

File Upload

TPA

File !eri"y Owner Cryptography key Request

Admin

File

ownload

File etails

Owner

etails

CLASS*

Registration # Owner# Password )ender 'o*ile +'ail ate

File Archive File# File$ame File%i&e FilePath FileOwner 'eta ata (eyRequest ownload%tatus 'odi"y%tatus !eri"y%tatus metadatagenration() fileupload()

Loginidgenration() CreateAccount()

File Archive Modify File# File$ame File%i&e FilePath FileOwner 'eta ata (eyRequest !eri"y%tatus

comparemetadata() fileupload()

[Link]*

!ata"ase Admin TPA O ner Create Account 'pload Files Cryptography (ncryption %ey

$erify O ner Files !iect $erify Files

!o nload $erification %ey re&uest !o nload %ey Re&uest Allo )*loc%

!o nload $erification)+ey Processing 'pload $rification File File Modify ,tatus !o nload File $ie O ner !etalils - O ner Files .arning To O ner .aring from Admin

!irect verification

!o nload verification

#ot Modify File

Modify File

ACTI,ITY*

Login

Admin

O ner

TPA

Admin

(/ists Create Account

File $erification

$ie

- !o nload o ner files File 'pload !irect $erification Cryptogrphic %ey ,ent to Mail %ey re&uest to o ner !o nload $erification

$ie O ner !etails

.arning Mail To O ner

ownload !eri"ication

$erifiction ,tatus

irect !eri"ication !o nload Re&uest ,tatus

Chec%

File #ot Modify File Modify

Process Pending

File #ot Modify

File !o nload ith %ey

File !o nload

File !o nload ith crypto %ey

do nload modify File ith %ey

$erify - 'pload !o nlod File

.arning from Admin

A

DATA DICTIONARY*

ER DIAGRAM*

DFD DIAGRAMS*

Login

TPA

Admin

O ner

File $erification

$ie - !o nload O ner Files

(/ists Create Account

$ie O ner !etails !irect $erification !o nload $erification

File 'pload

.arning Mail To O ner

Cryptogrphic %ey ,ent to Mail

%ey re&uest to o ner

ownload !eri"ication

$erifiction ,tatus

irect !eri"ication

,lock
Process Pending

!o nload Re&uest ,tatus

Chec% File #ot Modify

File #ot Modify File Modify File !o nload ith %ey

Allow
File !o nload

$erify - 'pload !o nlod File

File !o nload ith crypto %ey

do nload modify File ith %ey

.arning from Admin

(nd

CHAPTER 0< PROCESS SPECIFICATION=T#4&ni>!#3 An' A0g$"i &) U3#'?*

ALGORITHM* META@DATA GENERATION* Let the .erifier < 'i#he# to the #tore the fi%e F 'ith the archi.e* Let thi# fi%e F con#i#t of n fi%e b%oc(#* ,e initia%%- preproce## the fi%e and create metadata to be appended to the fi%e* Let each of the n data b%oc(# ha.e m bit# in them* A t-pica% data fi%e F 'hich the c%ient 'i#he# to #tore in the c%oud* Each of the )eta data from the data b%oc(# mi i# encr-pted b- u#ing a #uitab%e a%gorithm to gi.e a ne' modified )eta data )i* ,ithout %o## of genera%it- 'e #ho' thi# proce## bu#ing a #imp%e BO! operation* The encr-ption method can be impro.i#ed to [Link] #ti%% #tronger protection for .erifier2# data* A%% the )eta data bit b%oc(# that are generated u#ing the abo.e procedure are to be concatenated together* Thi# concatenated )eta data #hou%d be appended to the fi%e F before #toring it at the c%oud #[Link]* The fi%e F a%ong 'ith the appended )eta data e F i# [Link] 'ith the c%oud*

SCREEN SHOTS*

O-NER

T5A

AD) N

CHAPTER 0/ TECHNOLOGY DESCRIPTION*

S$% 9a"# En2i"$n)#n FEATURES OF( NET )icro#oft *NET i# a #et of )icro#oft #oft'are techno%ogie# for rapid%- bui%ding and integrating B)L ,eb #[Link]#/ )icro#oft ,indo'#0ba#ed app%ication#/ and ,eb #o%ution#* The *NET Frame'or( i# a %anguage0neutra% p%atform for 'riting program# that can ea#i%- and #ecure%- interoperate* There2# no %anguage barrier 'ith *NET; there are numerou# %anguage# [Link]%ab%e to the de.e%oper inc%uding )anaged CKK/ CC/ <i#ua% 9a#ic and La.a Script* The *NET frame'or( [Link]# the foundation for component# to interact #eam%e##%-/ 'hether %oca%%- or remote%- on different p%atform#* t #tandardi6e# common data t-pe# and communication# protoco%# #o that component# created in different %anguage# can ea#i%- interoperate* &*NETH i# a%#o the co%%ecti.e name [Link] to .ariou# #oft'are component# bui%t upon the *NET p%atform* The#e 'i%% be both product# 3<i#ua% Studio*NET and ,indo'#*NET [Link]/ for in#tance4 and #[Link]# 3%i(e 5a##port/ *NET )- [Link]#/ and #o on4* THE (NET FRAME-ORA The *NET Frame'or( ha# t'o main part#; @* The Common Language !untime 3CL!4* =* A hierarchica% #et of c%a## %ibrarie#* The CL! i# de#cribed a# the &e7ecution engineH of *NET* t [Link]# the [Link] 'ithin 'hich program# run* The mo#t important feature# are

 feature#*

[Link]#ion

from

%o'0%e.e%

a##emb%er0#t-%e

%anguage/

ca%%ed

ntermediate Language 3 L4/ into code nati.e to the p%atform being e7ecuted on* )emor- management/ notab%- inc%uding garbage co%%ection* Chec(ing and enforcing #ecurit- re#triction# on the running code* Loading and e7ecuting program#/ 'ith .er#ion contro% and other #uch

The fo%%o'ing feature# of the *NET frame'or( are a%#o 'orth de#cription;

Manag#' C$'# The code that target# *NET/ and 'hich contain# certain e7tra nformation 0 &metadataH 0 to de#cribe it#e%f* ,hi%#t both managed and unmanaged code can run in the runtime/ on%- managed code contain# the information that a%%o'# the CL! to guarantee/ for in#tance/ #afe e7ecution and interoperabi%it-* Manag#' Da a ,ith )anaged Code come# )anaged Data* CL! [Link]# memor- a%%ocation and Dea% %ocation faci%itie#/ and garbage co%%ection* Some *NET %anguage# u#e )anaged Data bdefau%t/ #uch a# CC/ <i#ua% 9a#ic*NET and LScript*NET/ 'herea# other#/ name%- CKK/ do not* Targeting CL! can/ depending on the %anguage -ou2re u#ing/ impo#e certain con#traint# on the feature# [Link]%ab%e* A# 'ith managed and unmanaged code/ one can ha.e both managed and unmanaged data in *NET app%ication# 0 data that doe#n2t get garbage co%%ected but in#tead i# %oo(ed after b- unmanaged code* C$))$n Ty1# Sy3 #) The CL! u#e# #omething ca%%ed the Common T-pe S-#tem 3CTS4 to #trict%- enforce t-pe0#afet-* Thi# en#ure# that a%% c%a##e# are compatib%e 'ith each other/ b- de#cribing t-pe# in a common 'a-* CTS define ho' t-pe# 'or( 'ithin the runtime/ 'hich enab%e# t-pe# in one %anguage to interoperate 'ith t-pe# in another %anguage/ inc%uding cro##0 %anguage e7ception hand%ing* A# 'e%% a# en#uring that t-pe# are on%- u#ed in appropriate 'a-#/ the runtime a%#o en#ure# that code doe#n2t attempt to acce## memor- that ha#n2t been a%%ocated to it*

C$))$n Lang!ag# S1#4i%i4a i$n The CL! [Link]# bui%t0in #upport for %anguage interoperabi%it-* To en#ure that -ou can de.e%op managed code that can be fu%%- u#ed b- de.e%oper# u#ing an- programming %anguage/ a #et of %anguage feature# and ru%e# for u#ing them ca%%ed the Common Language Specification 3CLS4 ha# been defined* Component# that fo%%o' the#e ru%e# and e7po#e on%- CLS feature# are con#idered CLS0comp%iant* THE CLASS LIBRARY* *NET [Link]# a #ing%e0rooted hierarch- of c%a##e#/ containing [Link] M??? t-pe#* The root of the name#pace i# ca%%ed S-#temE thi# contain# ba#ic t-pe# %i(e 9-te/ Doub%e/ 9oo%ean/ and String/ a# 'e%% a# Ob$ect* A%% ob$ect# deri.e from S-#tem* Ob$ect* A# 'e%% a# ob$ect#/ there are .a%ue t-pe#* <a%ue t-pe# can be a%%ocated on the #tac(/ 'hich can [Link] u#efu% f%e7ibi%it-* There are a%#o efficient mean# of [Link] .a%ue t-pe# to ob$ect t-pe# if and 'hen nece##ar-* The #et of c%a##e# i# prett- comprehen#i.e/ [Link] co%%ection#/ fi%e/ #creen/ and net'or( 8O/ threading/ and #o on/ a# 'e%% a# B)L and databa#e [Link]-* The c%a## %ibrar- i# #[Link] into a number of #et# 3or name#pace#4/ each [Link] di#tinct area# of functiona%it-/ 'ith dependencie# bet'een the name#pace# (ept to a minimum* LANGUAGES SUPPORTED BY (NET The mu%ti0%anguage capabi%it- of the *NET Frame'or( and <i#ua% Studio *NET enab%e# de.e%oper# to u#e their e7i#ting programming #(i%%# to bui%d a%% t-pe# of app%ication# and B)L ,eb #[Link]#* The *NET frame'or( #upport# ne' .er#ion# of )icro#oft2# o%d [Link]# <i#ua% 9a#ic and CKK 3a# <9*NET and )anaged CKK4/ but there are a%#o a number of ne' addition# to the fami%-*

<i#ua% 9a#ic *NET ha# been updated to inc%ude man- ne' and [Link] %anguage feature# that ma(e it a po'erfu% ob$ect0oriented programming %anguage* The#e feature# inc%ude inheritance/ interface#/ and [Link]%oading/ among other#* <i#ua% 9a#ic a%#o no' #upport# #tructured e7ception hand%ing/ cu#tom attribute# and a%#o #upport# mu%ti0 threading* <i#ua% 9a#ic *NET i# a%#o CLS comp%iant/ 'hich mean# that an- CLS0comp%iant %anguage can u#e the c%a##e#/ ob$ect#/ and component# -ou create in <i#ua% 9a#ic *NET* )anaged E7ten#ion# for CKK and attributed programming are $u#t #ome of the enhancement# made to the CKK %anguage* )anaged E7ten#ion# #imp%if- the ta#( of migrating e7i#ting CKK app%ication# to the ne' *NET Frame'or(* CC i# )icro#oft2# ne' %anguage* t2# a C0#t-%e %anguage that i# e##entia%%- &CKK for !apid App%ication De.e%opmentH* Un%i(e other %anguage#/ it# #pecification i# $u#t the grammar of the %anguage* t ha# no #tandard %ibrar- of it# o'n/ and in#tead ha# been de#igned 'ith the intention of u#ing the *NET %ibrarie# a# it# o'n*

)icro#oft <i#ua% LC *NET [Link]# the ea#ie#t tran#ition for La.a0%anguage de.e%oper# into the 'or%d of B)L ,eb [Link]# and dramatica%%- impro.e# the interoperabi%it- of La.a0%anguage program# 'ith e7i#ting #oft'are 'ritten in a .ariet- of other programming %anguage#* Acti.e State ha# created <i#ua% 5er% and <i#ua% 5-thon/ 'hich enab%e *NET0a'are app%ication# to be bui%t in either 5er% or 5-thon* 9oth product# can be integrated into the <i#ua% Studio *NET [Link]* <i#ua% 5er% inc%ude# #upport for Acti.e State2# 5er% De. Nit* Other %anguage# for 'hich *NET compi%er# are [Link]%ab%e inc%ude FO!T!AN CO9OL Eiffe%

Fig@ (Net Frame'or( AS5*NET ,indo'# Form#

B)L ,E9 SE!< CES 9a#e C%a## Librarie# Common Language !untime Operating S-#tem

CC*NET i# a%#o comp%iant 'ith CLS 3Common Language Specification4 and #upport# #tructured e7ception hand%ing* CLS i# #et of ru%e# and con#truct# that are #upported b- the CL! 3Common Language !untime4* CL! i# the runtime [Link] [Link] b- the *NET Frame'or(E it manage# the e7ecution of the code and a%#o ma(e# the de.e%opment proce## ea#ier b- [Link] #[Link]#* CC*NET i# a CLS0comp%iant %anguage* An- ob$ect#/ c%a##e#/ or component# that created in CC*NET can be u#ed in an- other CLS0comp%iant %anguage* n addition/ 'e can u#e ob$ect#/ c%a##e#/ and component# created in other CLS0comp%iant %anguage# in CC*NET *The u#e of CLS en#ure# comp%ete interoperabi%it- among app%ication#/ regard%e## of the %anguage# u#ed to create the app%ication*

CONSTRUCTORS AND DESTRUCTORS* Con#tructor# are u#ed to initia%i6e ob$ect#/ 'herea# de#tructor# are u#ed to de#tro- them* n other 'ord#/ de#tructor# are u#ed to re%ea#e the re#ource# a%%ocated to the ob$ect* n CC*NET the #ub fina%i6e procedure i# [Link]%ab%e* The #ub fina%i6e procedure i# u#ed to comp%ete the ta#(# that mu#t be performed 'hen an ob$ect i# de#tro-ed* The #ub fina%i6e procedure i# ca%%ed automatica%%- 'hen an ob$ect i# de#tro-ed* n addition/ the #ub fina%i6e procedure can be ca%%ed on%- from the c%a## it be%ong# to or from [Link] c%a##e#*

GARBAGE COLLECTION Garbage Co%%ection i# another ne' feature in CC*NET* The *NET Frame'or( monitor# a%%ocated re#ource#/ #uch a# ob$ect# and .ariab%e#* n addition/ the *NET Frame'or( automatica%%- re%ea#e# memor- for reu#e b- de#tro-ing ob$ect# that are no %onger in u#e* n CC*NET/ the garbage co%%ector chec(# for the ob$ect# that are not current%- in u#e bapp%ication#* ,hen the garbage co%%ector come# acro## an ob$ect that i# mar(ed for garbage co%%ection/ it re%ea#e# the memor- occupied b- the ob$ect* O,ERLOADING [Link]%oading i# another feature in CC* [Link]%oading enab%e# u# to define mu%tip%e procedure# 'ith the #ame name/ 'here each procedure ha# a different #et of argument#* 9e#ide# u#ing [Link]%oading for procedure#/ 'e can u#e it for con#tructor# and propertie# in a c%a##*

MULTITHREADING* CC*NET a%#o #upport# mu%tithreading* An app%ication that #upport# mu%tithreading can hand%e mu%tip%e ta#(# #imu%taneou#%-/ 'e can u#e mu%tithreading to decrea#e the time ta(en b- an app%ication to re#pond to u#er interaction* STRUCTURED E+CEPTION HANDLING CC*NET #upport# #tructured hand%ing/ 'hich enab%e# u# to detect and remo.e error# at runtime* n CC*NET/ 'e need to u#e Tr-OCatchOFina%%- #tatement# to create e7ception hand%er#* U#ing Tr-OCatchOFina%%- #tatement#/ 'e can create robu#t and effecti.e e7ception hand%er# to impro.e the performance of our app%ication*

THE (NET FRAME-ORA The *NET Frame'or( i# a ne' computing p%atform that #imp%ifie# app%ication de.e%opment in the high%- di#tributed [Link] of the nternet*

OBJECTI,ES OF( NET FRAME-ORA @* To [Link] a con#i#tent ob$ect0oriented programming [Link] 'hether ob$ect code# i# #tored and e7ecuted %oca%%- on nternet0di#tributed/ or e7ecuted remote%-* =* To [Link] a code0e7ecution [Link] to minimi6e# #oft'are dep%o-ment and guarantee# #afe e7ecution of code* J* E%iminate# the performance prob%em#* There are different t-pe# of app%ication/ #uch a# ,indo'#0ba#ed app%ication# and ,eb0 ba#ed app%ication#*

FEATURES OF S.L@SER,ER The OLA5 [Link]# feature [Link]%ab%e in SDL [Link] .er#ion M*? i# no' ca%%ed SDL [Link] =??? Ana%-#i# [Link]#* The term OLA5 [Link]# ha# been rep%aced 'ith the term Ana%-#i# [Link]#* Ana%-#i# [Link]# a%#o inc%ude# a ne' data mining component* The !epo#itor- component [Link]%ab%e in SDL [Link] .er#ion M*? i# no' ca%%ed )icro#oft SDL [Link] =??? )eta Data [Link]#* !eference# to the component no' u#e the term )eta Data [Link]#* The term repo#itor- i# u#ed on%- in reference to the repo#itor- engine 'ithin )eta Data [Link]# SDL0SE!<E! databa#e con#i#t of #i7 t-pe of ob$ect#/ The- are/ @* TA9LE =* DUE!Y J* FO!) >* !E5O!T A* )AC!O

TABLE* A databa#e i# a co%%ection of data about a #pecific topic* ,IE-S OF TABLE* ,e can 'or( 'ith a tab%e in t'o t-pe#/ @* De#ign <ie' =* Data#heet <ie'

D#3ign ,i#9 To bui%d or modif- the #tructure of a tab%e 'e 'or( in the tab%e de#ign .ie'* ,e can #pecif- 'hat (ind of data 'i%% be ho%d* Da a3&## ,i#9 To add/ edit or ana%-#e# the data it#e%f 'e 'or( in tab%e# data#heet .ie' mode* .UERY* A 1uer- i# a 1ue#tion that ha# to be a#(ed the data* Acce## gather# data that an#'er# the 1ue#tion from one or more tab%e* The data that ma(e up the an#'er i# either d-na#et 3if -ou edit it4 or a #nap#hot 3it cannot be edited4*Each time 'e run 1uer-/ 'e get %ate#t information in the d-na#et* Acce## either di#p%a-# the d-na#et or #nap#hot for u# to .ie' or perform an action on it/ #uch a# de%eting or updating*

FULL PROJECT CODINGB DATABASE -ITH ,IDEO TUTORIAL

HO- TO INSTALL DOCUMENT* EC#4! i$n &#01 %i0#

[Link] SOFT-ARES* @* )S .i#ua% #tudio =??P =* SDL #[Link] =??A F$" -AP* J* LDN @*Q >* No(ia A@?? #d( HO- TO ATTACH DATABASE* STEP 1* C$1y &# 'a aDa3# $ %$00$9ing 1a &( Pa &* C*EP"$g"a) Fi0#3EMi4"$3$% S.L S#"2#"EMSS.L([Link] a O" Pa &* C*EP"$g"a) Fi0#3EMi4"$3$% S.L S#"2#"[Link] a STEP 2* T&#n $1#n 3>0 3#"2#"(

STEP :* T$ a a4& &# 'a aDa3#B "ig& 40i47 $n 'a aDa3# an' 40i47 a a4&(

T&#n a a4& 'a aDa3#3 9in'$9 9i00 $1#n(

STEP <* C0i47 a'' D! $n in &a 9in'$9 an' 4&$$3# "#>!i"#' 'a aDa3#( T&#n 40i47 $7(

Da aDa3# 9i00 a''#' in 'a aDa3# '# ai03(

Fina00y 40i47 $7( STEP /* T&#n $1#n MS 2i3!a0 3 !'i$ 200F %$" $!" 1"$5#4 ( In 3#"2#" #C10$"#"B "ig& 40i47 $n 'a aDa3# 4$nn#4 i$n an' 40i47 a'' 4$nn#4 i$n(

A'' 4$nn#4 i$n 9in'$9 9i00 $1#n( In &a B 4&$$3# 'a a 3$!"4# a3 MS 3>0 3#"2#"Bgi2# 3#2#" na)# an' 4&$$3# 'a aDa3# na)# an' &#n 40i47 $7(

T&#n $!" 'a aDa3# 9i00 a a4&#' in 3#"2#" #C10$"#"( STEP G* T&#n 4&ang# &# a113# ing3 in 9#D(4$n%ig %i0#( F$" &a B "ig& 40i47 $n $!" 'a aDa3# in 3#"2#" #C10$"#" an' 40i47 1"$1#" i#3(

P"$1#" i#3 9in'$9 9i00 $1#n(

STEP H* C$1y &a 4$nn#4 i$n 3 "ing $ 2a0!# in a113# ing3 ag in 9#D(4$n%ig %i0#(

<appSettings> <add key="ConnectionString" value="Data

</appSettings>

Source=HOME\SQLEXPRESS;Initial Catalog=opinion;Integrated Security= rue" />

STEP F* -# !3#' a5aC in $!" 1"$5#4 ( S$ a'' a5aC $$03 $ y$!" 3y3 #) !3ing D#0$9 3 #13( 1( C$1y A5aCC$n "$0T$$07i Bina"y %$0'#" $ any 'i"#4 $"y =i(#( any 1a &? in y$!" 3y3 #)( 2( O1#n any '#3ign 1ag# in $!" 1"$5#4 &#n 40i47 $$0D$C(

:( T&#n 7##1 &# )$!3# 1$in #" in g#n#"a0 aD an' "ig& 40i47 $n i ( <( C&$$3# a'' aD(

N#9 aD 9i00 4"#a #' $n $$0D$C(

/( Gi2# na)# $ &a aD 0i7# IA5aC $$07i 3(

G( Rig& 40i47 $n &a n#9 aD an' 40i47 4&$$3# i #)3(

T&#n 4&$$3# $$0D$C i #)3 9in'$9 9i00 $1#n(

H( C0i47 D"$93# D! $n an' 3#0#4 A5aCC$n "$0T$$07i ('00 %i0# %"$) &a A5aCC$n "$0T$$07i Bina"y %$0'#" =%"$) 9&#"# y$! 3a2# &a %$0'#"?(

F( T&#n 40i47 $7(

N$9 a00 a5aC $$03 a"# a''#' in $$0D$C(

S #1 J* Fina00yB y$! 3&$!0' %$00$9 &# gi2#n 2i'#$ %i0#(

CHAPTER 0G
TYPE OF TESTING* BLOCA & -HITE BO+ TESTING* Black Box Testing 9%ac( 9o7 Te#ting i# te#ting the #oft'are 'ithout an- (no'%edge of the inner 'or(ing#/ #tructure or %anguage of the modu%e being te#ted* 9%ac( bo7 te#t#/ a# mo#t other (ind# of te#t#/ mu#t be 'ritten from a definiti.e #ource document/ #uch a# #pecification or re1uirement# document/ #uch a# #pecification or re1uirement# document* t i# a te#ting in 'hich the #oft'are under te#t i# treated/ a# a b%ac( bo7 *-ou cannot &#eeH into it* The te#t [Link]# input# and re#pond# to output# 'ithout con#idering ho' the #oft'are 'or(#* White Box Testing ,hite 9o7 Te#ting i# a te#ting in 'hich in 'hich the #oft'are te#ter ha# (no'%edge of the inner 'or(ing#/ #tructure and %anguage of the #oft'are/ or at %ea#t it# purpo#e* t i# purpo#e* t i# u#ed to te#t area# that cannot be reached from a b%ac( bo7 %e.e%* UNIT TESTING* Unit te#ting i# u#ua%%- conducted a# part of a combined code and unit te#t pha#e of the #oft'are %ifec-c%e/ a%though it i# not uncommon for coding and unit te#ting to be conducted a# t'o di#tinct pha#e#* Test strategy and approach Fie%d te#ting 'i%% be performed manua%%- and functiona% te#t# 'i%% be 'ritten in detai%*

T#3 $D5#4 i2#3 A%% fie%d entrie# mu#t 'or( proper%-*

5age# mu#t be [Link] from the identified %in(* The entr- #creen/ me##age# and re#pon#e# mu#t not be de%a-ed*

F#a !"#3 $ D# #3 #' <erif- that the entrie# are of the correct format No dup%icate entrie# #hou%d be a%%o'ed

A%% %in(# #hou%d ta(e the u#er to the correct page* SYSTEM TESTING* The purpo#e of te#ting i# to di#[Link] error#* Te#ting i# the proce## of tr-ing to di#[Link] [Link]- [Link]%e fau%t or 'ea(ne## in a 'or( product* t [Link]# a 'a- to chec( the functiona%it- of component#/ #ub a##emb%ie#/ a##emb%ie# and8or a fini#hed product t i# the proce## of e7erci#ing #oft'are 'ith the intent of en#uring that the Soft'are #-#tem meet# it# re1uirement# and u#er e7pectation# and doe# not fai% in an unacceptab%e manner* There are .ariou# t-pe# of te#t* Each te#t t-pe addre##e# a #pecific te#ting re1uirement* INTEGRATION TESTING* Soft'are integration te#ting i# the incrementa% integration te#ting of t'o or more integrated #oft'are component# on a #ing%e p%atform to produce fai%ure# cau#ed binterface defect#* The ta#( of the integration te#t i# to chec( that component# or #oft'are app%ication#/ e*g* component# in a #oft'are #-#tem or R one #tep up R #oft'are app%ication# at the compan- %e.e% R interact 'ithout error*

T#3 R#3!0 3* A%% the te#t ca#e# mentioned abo.e pa##ed #ucce##fu%%-* No defect# encountered*

CHAPTER 0H CONCLUSION*
n thi# paper 'e ha.e 'or(ed to faci%itate the c%ient in getting a proof of integrit- of the data 'hich he 'i#he# to #tore in the c%oud #torage #[Link]# 'ith bare minimum co#t# and effort#* Our #cheme 'a# de.e%oped to reduce the computationa% and #torage [Link] of the c%ient a# 'e%% a# to minimi6e the computationa% [Link] of the c%oud #torage #[Link]* ,e a%#o minimi6ed the #i6e of the proof of data integrit- #o a# to reduce the net'or( band'idth con#umption* )an- of the #cheme# propo#ed ear%ier re1uire the archi.e to perform ta#(# that need a %ot of computationa% po'er to generate the proof of data integrit-* 9ut in our #cheme the archi.e $u#t need to fetch and #end fe' bit# of data to the c%ient*

LIMITATIONS & FUTURE ENHANCEMENTS *

Apart from reduction in #torage co#t# data out#ourcing to the c%oud a%#o

he%p# in reducing the maintenance* [Link] %oca% #torage of data* 9- reducing the co#t# of #torage/ maintenance and per#onne%* t reduce# the chance of %o#ing data b- hard'are fai%ure#* Not cheating the o'ner*

REFERENCE & BIBLIOGRAPHY*

Good Teacher# are 'orth more than thou#and boo(#/ 'e ha.e them in Our Department R#%#"#n4#3 Ma'# F"$)* @* 9eginning AS5*NET >; in CC and <9 b- Imar Spaanjaars* =* AS5*NET > Un%ea#hed b- Stephen Walther* J* 5rogramming AS5*NET J*A by Jesse Liberty, Dan Edition bA* Q* M* P* atthew a#Donald. aharry, Dan !urwit".

>* 9eginning AS5*NET J*A in CC =??P; From [Link] to 5rofe##iona%/ Second

Ama6on ,eb [Link]# 3A,S4/ On%ine at http;88a'#* ama6on*com* Goog%e App Engine/ On%ine at http;88code*goog%e*com8appengine8* )icro#oft A6ure/ http;88'''*micro#oft*com8a6ure8* A* Agra'a% et a%* ,#0bpe% e7ten#ion for peop%e 3bpe%>peop%e4/ .er#ion @*?*/ =??M*

I*

)* Amend et a%* ,eb #[Link]# human ta#( 3'#0humanta#(4/ .er#ion @*?*/ =??M*

@?* D* 9rabham* Cro'd#ourcing a# a mode% for prob%em #o%.ing; An introduction and ca#e#* @@* Data Communication# and Net'or(ing/ b- $ehrou" % &orou"an* @=* E* )-(%etun/ )* Nara#imha/ and G* T#udi(/ &Authentication and integrit- in out#ourced databa#e#/H Tran#* Storage/ .o%* =/ no* =/ pp* @?MR@JP/ =??Q*

@J* D* B* Song/ D* ,agner/ and A* 5errig/ &5ractica% techni1ue# for #earche# on encr-pted data/H in S5 2??; 5roceeding# of the =??? EEE S-mpo#ium on Securitand [Link]-* ,a#hington/ DC/ USA; EEE Computer Societ-/ =??? @>* A* Lue%# and 9* S* Na%i#(i/ Lr*/ &5or#; proof# of [Link]%it- for %arge fi%e#/H in CCS 2?M; 5roceeding# of the @>th AC) conference on Computer and communication# #ecurit-* Ne' Yor(/ NY/ USA; AC)/ =??M/ pp* AP>RAIM* @A* G* Atenie#e/ !* 9urn#/ !* Curtmo%a/ L* "erring/ L* Ni##ner/ S* 5eter#on/ and D* Song/ &[Link]%e data po##e##ion at untru#ted #tore#/H in CCS 2?M; 5roceeding# of the @>th AC) conference on Computer and communication# #ecurit-* Ne' Yor(/ NY/ USA; AC)/ =??M/ pp* AIPRQ?I*

Si #3 R#%#""#'* http;88'''*a#p*net*com http;88'''*dotnet#pider*com8 http;88'''*dotnet#par(*com http;88'''*a%maden*ibm*com8#oft'are81ue#t8!e#ource#8 http;88'''*computer*org8pub%ication#8d%ib http;88'''*de.e%operfu#ion*com8

ADD"#2ia i$n3* POR CLS PDA P"$$% $% "# "i#2aDi0i y C$))$n Lang!ag# S1#4i%i4a i$n P#"3$na0 Digi a0 A33i3