SeDas: A Self-Destructing Data System Based on Active Storage Framework

Personal data stored in the Cloud may contain account numbers, passwords, notes, and other important information that could be used and misused by a miscreant, a competitor, or a court of law. These data are cached, copied, and archived by Cloud Service Providers (CSPs), often without users' authorization and control. Self destructin! data mainly aims at protectin! the user data's privacy. "ll the data and their copies become destructed or unreadable after a user specified time, without any user intervention. #n addition, the decryption $ey is destructed after the user specified time. #n this paper, we present Se%as, a system that meets this challen!e throu!h a novel inte!ration of crypto!raphic techni&ues with active stora!e techni&ues based on T'( )S% standard. *e implemented a proof of concept Se%as prototype. Throu!h functionality and security properties evaluations of the Se%as prototype, the results demonstrate that Se%as is practical to use and meets all the privacy preservin! !oals described. Compared to the system without self destructin! data mechanism, throu!hput for uploadin! and downloadin! with the proposed Se%as acceptably decreases by less than +,-, while latency for upload.download operations with self destructin! data mechanism increases by less than /(-.

Published in: Magnetics, IEEE Transactions on (Volume:49 , Issue: 6 ) Date of Publication: June 2013

Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data

ABST A!T

T e a!"ent o# clou! com$uting, !ata o%ners are moti"ate! to outsource t eir com$le& !ata management s'stems #rom local sites to commercial $u(lic clou! #or great #le&i(ilit' an! economic sa"ings) *ut #or $rotecting !ata $ri"ac', sensiti"e !ata as to (e encr'$te! (e#ore outsourcing, % ic o(soletes tra!itional !ata utili+ation (ase! on $lainte&t ,e'%or! searc ) T us, ena(ling an encr'$te! clou! !ata searc ser"ice is o# $aramount im$ortance) -onsi!ering t e large num(er o# !ata users an! !ocuments in clou!, it is crucial #or t e searc ser"ice to allo% multi.,e'%or! /uer' an! $ro"i!e result similarit' ran,ing to meet t e e##ecti"e !ata retrie"al nee!) 0elate! %or,s on searc a(le encr'$tion #ocus on single ,e'%or! searc or *oolean ,e'%or! searc , an! rarel' !i##erentiate t e searc results) In t is $a$er, #or t e #irst time, %e !e#ine an! sol"e t e c allenging $ro(lem o# $ri"ac'.$reser"ing multi. ,e'%or! ran,e! searc o"er encr'$te! clou! !ata (M01E), an! esta(lis a set o# strict $ri"ac' re/uirements #or suc a secure clou! !ata utili+ation s'stem to (ecome a realit') 2mong "arious multi. ,e'%or! semantics, %e c oose t e e##icient $rinci$le o# 3coor!inate matc ing4, i)e), as man' matc es as $ossi(le, to ca$ture t e similarit' (et%een searc /uer' an! !ata !ocuments, an! #urt er use 3inner $ro!uct similarit'4 to /uantitati"el' #ormali+e suc $rinci$le #or similarit' measurement) 5e #irst $ro$ose a (asic M01E sc eme using secure inner $ro!uct com$utation, an! t en signi#icantl' im$ro"e it to meet !i##erent $ri"ac' re/uirements in t%o le"els o# t reat mo!els) T oroug anal'sis in"estigating $ri"ac' an! e##icienc' guarantees o# $ro$ose! sc emes is gi"en, an! e&$eriments on t e real.%orl! !ataset #urt er s o% $ro$ose! sc emes in!ee! intro!uce lo% o"er ea! on com$utation an! communication)

"ona: Secure "ulti-#wner Data Sharing for Dynamic $rou%s in the !loud

*ith the character of low maintenance, cloud computin! provides an economical and efficient solution for sharin! !roup resource amon! cloud users. 0nfortunately, sharin! data in a multi owner manner while preservin! data and identity privacy from an untrusted cloud is still a challen!in! issue, due to the fre&uent chan!e of the membership. #n this paper, we propose a secure multi owner data sharin! scheme, named 1ona, for dynamic !roups in the cloud. 2y levera!in! !roup si!nature and dynamic broadcast encryption techni&ues, any cloud user can anonymously share data with others. 1eanwhile, the stora!e overhead and encryption computation cost of our scheme are independent with the number of revo$ed users. #n addition, we analyze the security of our scheme with ri!orous proofs, and demonstrate the efficiency of our scheme in e3periments.

Published in: 6arallel an! 7istri(ute! 1'stems, IEEE Transactions on (Volume:24 , Issue: 6 ) Date of Publication: June 2013