Sie sind auf Seite 1von 5

LITERATURE REVIEW

Title: Securing personal health records in cloud computing: Patient-centric and fine-grained data access control in multi-owner settings Author: M. Li, S. Yu, K. Ren, and W. Lou Description: his pro!ect introduces the concept of "ne-grained and scala#le access control for P$Rs, which le%erage attri#ute #ased encr&ption '()*+ techni,ues to encr&pt each patients- P$R data. o reduce the .e& distri#ution comple/it&, we di%ide the s&stem into multiple securit& domains, where each domain manages onl& a su#set of the users. 0n this wa&, each patient has full control o%er her own pri%ac&, and the .e& management comple/it& is reduced dramaticall&. 1ur proposed scheme is also 2e/i#le, in that it supports ecient and on-demand re%ocation of user access rights, and #rea.-glass access under emergenc& scenarios.

Title: Pu#lic standards and patients control: how to .eep electronic medical records accessi#le #ut pri%ate. Author: K. 3. Mandl, P. S4olo%its, and 0. S. Kohane. Description: ( patient5s medical records are generall& fragmented across multiple treatment sites, posing an o#stacle to clinical care, research, and pu#lic health efforts. *lectronic medical records and the internet pro%ide a technical infrastructure on which to #uild longitudinal medical records that can #e integrated across sites of care. 6hoices a#out the structure and ownership of these records will ha%e profound impact on the accessi#ilit& and pri%ac& of patient information. (lread&, alarming trends are apparent as proprietar& online medical record s&stems are de%eloped and deplo&ed. he technolog& promising to unif& the currentl& disparate pieces of a patient5s medical record ma& actuall& threaten the accessi#ilit& of the information and compromise patients5 pri%ac&. 0n this article it propose two doctrines and si/ desira#le characteristics to guide the de%elopment of online medical record s&stems and also descri#es how such s&stems could #e de%eloped and used clinicall&.

Title: 6ipher te/t -polic& attri#ute-#ased threshold decr&ption with fle/i#le delegation and re%ocation of user attri#utes Author: L. 0#raimi, M. Pet.o%ic, S. 7i.o%a, P. $artel, and W. 8on.er Description: 0n 6ipher te/t-Polic& (ttri#ute-)ased *ncr&ption '6P-()*+, a user secret .e& is associated with a set of attri#utes, and the cipher te/t is associated with an access structure or decr&ption polic& o%er attri#utes. he user can decr&pt the cipher te/t if and onl& if the attri#ute set of his secret .e& satisfies the decr&ption polic& specified in the cipher te/t. Se%eral 6P-()* schemes ha%e #een proposed, howe%er, to #ecome practical the pro#lem of re%ocation and delegation should #e addressed. 0n this paper, we propose 6ipher te/t-Polic& (ttri#ute-)ased hreshold 3ecr&ption '6P-() 3+ which e/tends 6P-()* with fle/i#le attri#ute delegation and instantaneous attri#ute re%ocation. 6P-() 3 has three ad%antages o%er 6P()*. 9irst, (lice 'delegator+, who has a secret .e& associated with a set of attri#utes, can delegate her authori4ation to )o# 'delegatee+. Second, (lice can decide whether to allow )o# to #e a#le to delegate her authori4ation further. hird, the proposed scheme achie%es instantaneous attri#ute re%ocation, that is, once the attri#ute is re%o.ed the user cannot use it in the decr&ption phase. We demonstrate how to appl& the proposed 6P-() 3 scheme to securel& manage Personal $ealth Records 'P$Rs+.

Title: 3(66: 3istri#uted access control in clouds Author: S. Ru!, (. 7a&a., and 0. Sto!meno%ic

Description: 0t propose a new model for data storage and access in clouds. 1ur scheme a%oids storing multiple encr&pted copies of same data. 0n our framewor. for secure data storage, cloud stores encr&pted data 'without #eing a#le to decr&pt them+. he main no%elt& of our model is addition of .e& distri#ution centers 'K36s+. We propose 3(66 '3istri#uted (ccess 6ontrol in 6louds+ algorithm, where one or more K36s distri#ute .e&s to data owners and users. K36 ma& pro%ide access to particular fields in all records. hus, a single .e& replaces separate .e&s from owners. 1wners and users are assigned certain set of attri#utes. 1wner encr&pts the data with the attri#utes it has and stores them in the cloud. he users with matching set of attri#utes can retrie%e the data from the cloud. We appl& attri#ute-#ased encr&ption #ased on #ilinear pairings on elliptic cur%es. he scheme is collusion secure: two users cannot together decode an& data that none of them has indi%idual right to access. 3(66 also supports re%ocation of users, without redistri#uting .e&s to all the users of cloud ser%ices. We show that our approach results in lower communication, computation and storage o%erheads, compared to e/isting models and schemes.

Title: (ttri#ute #ased data sharing with attri#ute re%ocation. Author: S. Yu, 6. Wang, K. Ren, and W. Lou Description: 6ipher te/t-Polic& (ttri#ute )ased *ncr&ption '6P-()*+ is a promising cr&ptographic primiti%e for "ne-grained access control of shared data. 0n 6P-()*, each user is associated with a set of attri#utes and data are encr&pted with access structures on attri#utes. ( user is a#le to decr&pt a cipher te/t if and onl& if his attri#utes satisf& the cipher te/t access structure. )eside this #asic propert&, practical applications usuall& ha%e other re,uirements. 0n this paper we focus on an important issue of attri#ute re%ocation which is cum#ersome for 6P()* schemes. 0n particular, we resol%e this challenging issue #& considering more practical scenarios in which semi-trusta#le on-line pro/& ser%ers are a%aila#le. (s compared to e/isting schemes, our proposed solution ena#les the authorit& to re%o.e user attri#utes with minimal eort. We achie%e this #& uni,uel& integrating the techni,ue of pro/& re-encr&ption with 6P-()*, and ena#le the authorit& to delegate most of la#orious tas.s to pro/& ser%ers. 9ormal anal&sis shows that our proposed scheme is pro%a#l& secure against chosen cipher te/t attac.s. 0n addition, we show that our techni,ue can also #e applica#le to the Ke&-Polic& (ttri#ute )ased *ncr&ption 'KP-()*+ counterpart.

Das könnte Ihnen auch gefallen