A new anonymity-based protocol preserving privacy based cloud environment

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "A new anonymity-based protocol preserving privacy based cloud environment"

Transcription

1 Abstract A new anonymty-based protocol preservng prvacy based cloud envronment Jan Wang 1*, Le Wang 2 1 College of Computer and Informaton Engneerng, Henan Unversty of Economcs and Law, Chna 2 SIAS Internatonal Unversty Zhengzhou, Chna Receved 1 March 2014, Wth the development of cloud computng applcaton, more and more people would lke to do busness under ths envronment. But more attenton should be pad to the dsclosure of prvacy durng the transacton. Customers wll reject to do busness on the cloud platform f the cloud envronment cannot avod dsclosng ther prvate data. Nowadays, lttle work has been done about how to prevent senstve attrbutes leakng between servce provders. Therefore, ths paper proposed a new anonymty-based protocol to protect prvacy. Keywords: anonymty, cloud computng, prvacy preservng, senstve attrbutes, protocol 1 Introducton Cloud computng rases a range of mportant prvacy ssues as acknowledged by a number of recent work [1]. Such ssues are due to the fact that, n the cloud, users' data and applcatons resde on the cloud cluster whch s owned and mantaned by a thrd party [2]. Concerns arse snce n the cloud t s not clear to ndvduals why ther personal nformaton s requested or how t wll be used or passed on to other partes [3, 4]. Despte ncreased awareness of the prvacy ssues n the cloud, lttle work has been done n ths space. Recently, Pearson et al. has proposed accountablty mechansms to address prvacy concerns of end users [5] and then develop a smple soluton, a prvacy manager, relyng on obfuscaton technques [6]. Ther basc dea s that the user's prvate data s sent to the cloud n an encrypted form, and the processng s done on the encrypted data. The output of the processng s de-obfuscated by the prvacy manager to reveal the correct result. However, the prvacy manager provdes only lmted features n that t does not guarantee protecton once the data s beng dsclosed [7-9]. There are many servce provders n the cloud, we can call each servce as a cloud, each cloud servce wll exchange data wth other cloud, when the data s exchanged between the clouds, and there exsts the problem of dsclosure of prvacy [10]. So my research ams at avodng the dsclosure of the senstve attrbutes of users when user ask for servce from the servce provder n cloud computng. 2 Related work There are some prvacy problems we want to address n the cloud computng [11]: The frst problem s the dsclosure of senstve prvate nformaton when exchangng data through the cloud servce. And the senstve prvate nformaton ncludes: personally dentfable nformaton, usage data, unque devce denttes and so on [12]. The second problem s that people gettng napproprate or unauthorzed access to personal data n the cloud by takng advantage of certan vulnerabltes, such as lack of access control enforcement, securty holes and so on [13]. The thrd problem s that: because the feature of cloud computng s that t s a dynamc envronment, n that servce nteractons can be created n a more dynamc way than tradtonal e-commerce scenaros [14]. Servces can potentally be aggregated and changed dynamcally by servce provders can change the provsonng of servces. In such scenaros, personal senstve data may move around wthn an organzaton or across organzatonal boundares, so adequate protecton of ths nformaton must be mantaned despte the changes. So desgn the method to protect the prvacy n cloud computng must meet the dynamcal exchange of data. Nowadays, some researchers focus on cloud data storage securty n cloud computng [15]. And other researchers focus on the dsclosure of senstve prvate nformaton when exchangng data through the cloud computng [16]. Some researchers use dentty technology to solve these prvacy problems n cloud computng [17]. They propose some requrements for dentty servces [18]. For * Correspondng author e-mal: 139

2 example, the dentty servces should be ndependent of devces; should permt a sngle sgn-on to thousands of dfferent onlne servces; should allow pseudonyms and multple dscrete denttes to protect user prvacy; should be nteroperable, based on open standards, and should be transparent and audtable. When create an dentty management nfrastructure n the cloud computng, we should consder: 1) There are already a number of dentty management systems n place on a wde varety of platforms. These need to be supported by the dentty management nfrastructure. The nfrastructure must support crosssystem nteracton as well as nteroperaton and delegaton between them. Ths s only possble f the nfrastructure and the ndvdual systems are based on open standards, avalable on all platforms. 2) Identty management systems wll support a wde varety of prvacy and securty propertes, rangng from low-securty password-based one-factor authentcaton to hgh-end, attrbute-based systems deployng state-of-theart prvacy-enhancng certfcates. Whle the nfrastructure needs to support all of these systems, users should understand the mplcatons of usng one system over the other [19]. 3 Anonymty-based method Our paper proposed a new anonymty protocol for the cloud computng servces. Before the mcro data are publshed, ths anonymty algorthm wll process these data. And then send these anonymous data to servce provders n the cloud. Then the servce provder can ntegrate the auxlary nformaton (also called external knowledge, background knowledge, or sde nformaton that the servce provder can get from other channels such as the web, publc records, or doman knowledge) to analyse the anonymous data n order to mne the knowledge they want. For example, the traffc management board of a regon collects records of road accdents for research and analyss. Suppose each record has fve attrbutes, namely occupaton, age, vehcle-type, postcode, and faulty. Consder the tuples n Table 1. The traffc management board anonymsed the traffc accdent records on attrbutes age, vehcle-type, and postcode before the data can be released to the servce provder n the cloud. Suppose 2-anonymty s requred. Table 2 shows a 2-anonymous release of the records wth respect to quas-dentfer (age, vehcle-type, postcode). And then the traffc management board anonymsed the traffc accdent records on attrbutes occupaton, age, and postcode. Agan, suppose 2-anonymty s requred. Table 3 shows a 2-anonymous release of the records wth respect to quas-dentfer (occupaton, age, postcode). Suppose one servce provder n the cloud obtans both releases n Tables 2 and 3. By comparng the two tables, the servce provder mmedately knows that a famly doctor of age 30 drvng a whte Sedan lvng n area was faulty n an accdent. The vctm may be easly redentfed by both these anonymous tables. TABLE 1 A set of traffc accdent record Occupaton Age Vehcle Postcode Faulty Dentst 30 Red Truck No Famly doctor 30 Whte Sedan Yes Banker 30 Green Sedan No Mortgage broker 30 Black Truck No TABLE 2 2-anonymous release of Table 1 wth respect to quasattrbutes (age, vehcle-type, postcode) Occupaton Age Vehcle Postcode Faulty Dentst 30 Truck No Famly doctor 30 Sedan Yes Banker 30 Sedan No Mortgage broker 30 Truck No TABLE 3 A 2-anonymous release of Table 1 wth respect to quasattrbutes (occupaton, age, postcode) Occupaton Age Vehcle Postcode Faulty Medcal 30 Red Truck No Medcal 30 Whte Sedan Yes Fnance 30 Green Sedan No Fnance 30 Black Truck No Besdes, when publsh anonymous data, we should consder multple quas-dentfers (QI) attrbutes for dfferent servce provders carryng dfferent background knowledge [20]. So the data publshng sde should anonymse dfferent quas-dentfers (QI) attrbutes of the records for dfferent servce provders carryng dfferent background knowledge. We can take an example to explan. Suppose the traffc management board have records of road accdents for research and analyss. Suppose each record has fve attrbutes, namely occupaton, age, vehcle-type, postcode, and faulty. And the traffc management board wants to release these records to dfferent servce provders n the cloud. Suppose there are two servce provder named "auto nsurance companes" and "human resource department" n the cloud servce. Both of them want to use the anonymous records of road accdents. Importantly, dfferent servce provders may carry dfferent background knowledge. For example, the auto nsurance company may jon the traffc accdent records wth the vehcle regstraton records on attrbutes age, vehcle-type, and postcode to fnd out whether ts customers were at fault n some accdents. Typcally, the company does not have the occupaton nformaton of ts customers, as such nformaton s not requred n applyng for auto nsurance. Therefore, to protect prvacy, the traffc management board has to anonymse the traffc accdent records on attrbutes age, vehcle-type, and postcode before the data can be released to the auto nsurance company. Smultaneously, the human resource department may jon the traffc accdent records wth the resdent records on attrbutes occupaton, age, and postcode to fnd out whch resdents were faulty n some accdents. Therefore, to protect prvacy, the traffc management board needs to anonymse the traffc accdent records on attrbutes occupaton, age, and postcode. Note that vehcle-type s 140

3 not part of the anonymsaton, because the human resource department typcally does not have nformaton about resdents' vehcle types. Our method s dfferent from the tradtonal cryptography technology to protect ndvduals prvacy n the cloud computng servces. If we use the cryptography technology. Then we should use cryptography technology to process the data, and send the processed data to servce provder n the cloud. Then ths servce provder can t use these data f t ddn t get the key of cryptography. So the servce provder n the cloud should use the key to restore the data frstly and then can use these data. However, f we use anonymty technology to process these data and send these anonymous data to servce provders n the cloud. Then the servce provder can drectly use these data wthout any key and wthout restorng these data. So ths wll be more flexble and safe to protect ndvduals prvacy n the cloud computng servces. 4 Prvate matchng protocol 5b) S encrypts each y Yc, wth S key es and sends back to C the pars <y, Fes (y)>=<fec (h (v)), Fes (Fec (h (v)))>. 6) C encrypts each y Ys, wth C s key ec, obtanng Zs=Fec (y)=fec (Fes (h (v))), here the v Vs. Also, from pars <Fec (h (v)), Fes (Fec (h (v)))> obtaned n Step 5b for the v Vc, It creats pars <v, Fes (Fec (h (v)))> by replacng Fec (h (v)) wth the correspondng v. 7) Because the Vc has only one element v (that s to say Vc has only one tuple). So f ths element v Vc meets (Fes (Fec (h (v)))) Zs, then ths v Vs. then Vs and Vc has one dentcal element, else Vs and Vc has no dentcal element. Vs and Vc has one dentcal element s equal to V V =1. s c Vs and Vc has no dentcal element s equal to V V =0. s c The man purpose for our research s to use prvate matchng technology [21] to ntersect user s data and datasets of servce provder wthout accessng each other s data, so ths can let the user check whether hs anonymous data meet k-anonymty to the datasets of servce provder, meanwhle avodng the dsclosure of each other s data. Our proposed prvate matchng protocol: 1) Both the Clent and the SP seralze the attrbutes and concatenate them to convert ther data set nto a strng of concatenated attrbute values, and produce set Vs and set Vc. Whch Vc s the set of elements (tuples) n Clent, correspondng to the attrbutes requested by the SP n the current servce request, whle Vs s the set of elements (tuples) n SP, correspondng to the attrbutes requested by the SP n the current servce request. Noton 1: Before the user n clent adds hs tuple to the table of SP, the user should check whether the one new tuple meets k-anonymty to the table of SP. So Vc =1. Because before addng one new tuple to the table of SP, the set of Vc only has one tuple to check. But Vs >=1. Because the set of Vs may have many tuples before checkng. 2) Both Clent (named C, for short) and SP (named S, for short) apply hash functon h to ther sets. Xc=h (Vc), Xs=h (Vs). Each party randomly chooses a secret key. And ec s the key for C, es s the key for S. 3) Both partes encrypt ther hashed sets: Yc=Fec (Xc)=Fec (h (Vc)), Ys=Fes (Xs)=Fes (h (Vs)). 4) C sends to S ts encrypted set Yc=Fec (h (Vc)). 5 Case studes Despte ncreased awareness of the prvacy ssues n the cloud, lttle work has been done n ths space. When users order servce n the cloud, lots of data ncludng users' attrbutes need to be transmtted between users and servce provders. How to protect users' senstve attrbutes and avod the dentfcaton by adversary s stll an mportant problem to solve. Most exstng methods are that the user s prvate data s sent to the cloud n an encrypted form [22], and the processng s done on the encrypted data. However, n ths method, the servce provder needs to decode these data before they access them. So ths wll be a waste of tme and wll be very nconvenent to servce provders. Besdes, once the data s decrypted the user s prvacy may be at rsk, snce the SP has full control of t. So our proposed approach s dfferent from tradtonal methods to avod dsclosure of ndvduals' prvacy. In our proposed approach, the datasets of servce provder meet k-anonymty. If a user wants to request a servce n the cloud, the user should anonymsed hs attrbutes correspondng to the attrbutes requested by the SP n the current servce request, then f ths user's anonymsed data meet k-anonymty to datasets of ths servce provder, ths user can send hs anonymsed data to ths servce provder. Then the servce provder wll prepare servce for ths rght user. Our proposed approach has two advantages, the frst one s the data transmtted n the cloud are anonymsed data, so f the adversary get these anonymsed data, he cannot dentfy users. The second advantage s that when servce provder gets these anonymsed data, servce provder can drectly use these data wthout restorng these data. So ths wll be more flexble and safe to protect ndvduals prvacy n the cloud. 5a) S shps to C ts set Ys=Fes (h (Vs)). 141

4 6 Avodng prvacy ndexng In order to avod the dsclosure of ndvduals prvacy n cloud, our research address that the user should send the anonymous data to servce provder (SP) n the cloud, and the datasets n SP should meet k-anonymty. The k-anonymty approach publshes a table T' whch changes the values on the quas-dentfer attrbutes so that every tuple n T s publshed n a group-by of at least k tuples on the quas-dentfer. Publshng T' nstead of T can protect prvacy effectvely aganst prvacy ndexng, snce the attacker cannot re-dentfy any ndvdual wth a confdence more than 1/k. In fact the k-anonymty approach meets the second condton of prvacy-preservng ndex (PPI) s defnton n paper [23]. Because the datasets n SP meet k-anonymty, so the datasets n SP also meet the second condton of prvacy-preservng ndex (PPI) s defnton. If an adversary wants to dentfy who satsfy the query, ths adversary executes query on the datasets of SP, then the returned results contan k users (both true postves users and false postves users are n the k users), therefore the probablty that the adversary can dentfy the real user s 1/k. So our based on k-anonymty approach lke the method n paper [23], can avod prvacy ndexng ssue. Let us take an example. If an adversary executes a query on the datasets of SP, and ths adversary wants to dentfy user s phone number (senstve attrbute) through ths query. Assume table s dataset of one servce provder, and table meets 3- anonymty. Then assume the adversary s query s on table. The query s (select phone number from table where Age=27 & Zp code= & gender=m). So the returned results wll be ( , , , ). In these results, s true postves and the other three phone numbers are false postves. So the adversary gets four dfferent phone numbers and ths adversary can t dentfy the user whose other attrbutes satsfy ths query. So executng query on these datasets whch meet k-anonymty wll avod prvacy ndexng ssue. Another reason s that the datasets n SP meet 3- anonymty, so ths query wll return at least 3 dfferent results. All of these results wll contan both true postves and false postves. Accordng to the defnton of prvacypreservng ndex (PPI) n paper [23], our proposed approach can avod prvacy ndexng ssue. 7 Securty analyss Now we use a formal proof method proposed by [24] to prove the securty of proposed protocol. Frstly we gve some defntons of the sgns used n the proof process. PD : Prvate data. PDDM : Prvacy-preservng data mnng protocol. PD : Prvate data of P. P EXT P : Extra nformaton P can obtan through the underlyng protocol. GAIN P : Advantage of P to get access to any other party s prvate data usng a protocol. GAIN SEC : Advantage of P to get access to any other party s prvate data usng a protocol by lookng at a semantcally secure cphertext whch s neglgble when usng an RSA [25] type of encrypton. Pr( PD ) : Probablty of dsclosng the prvate data PD wthout usng prvacy preservng protocol. : Level of securty. As stated n [24] that f you want to prove whether our proposed protocol named PRPT s prvacy preservng, accordng to any prvate data, you can fnd a such that: Pr( PD PDDM ) Pr( PD). So f we want to prove whether the proposed PRPT protocol s prvacy preservng, we only need to fnd such that: Pr( PD PRPT ) Pr( PD). Because the advantage of each party P j by the protocol can access another party s prvate data can be shown as: GAIN Pr( PD EXT, PRPT ) Pr( PD EXT ), Pj Pk Pj Pk Pj ( k j). Because each party P j only runs secure dot product protocol wth P j by usng hs own randomly generated vector. And party P j runs secure mult-party addton protocol [26] wth other partes by usng hs prvate output share. Therefore: GAIN Pj GAIN, ( j ). SEC Because GAIN SEC means that advantage of P j to get access to any other party s prvate data, usng a protocol by lookng at a semantcally secure [27] cphertext whch s neglgble, when usng an RSA type of encrypton. So GAIN s also neglgble. P Partcpant P j by decryptng the message receved from other partes and decryptng the sgns of ther prvate output, can only know hs prvate value of the fnal weght vector, whch s hs own fnal output. So we can conclude: max( GAIN, GAIN ) GAIN. Therefore for each conclude: P P j P j k, j 1,..., n, k j, we can Pr( PD EXT, PRPT ) Pr( PD EXT ) GAIN. Pk Pj Pk Pj P So at last we can fnd GAIN P, such that Pr( PD PRRT ) Pr( PD). Therefore, the proposed PRPT protocol s prvacy preservng. 142

5 Executon Tme(sec ) COMPUTER MODELLING & NEW TECHNOLOGIES (9) Expermental evaluaton In ths secton we desgn experments to show the applcaton and performance of our proposed protocol named PRPT. We have used Java language to mplement our experments. The experments are carred out on Wndows XP operatng system wth 2.13 GHz Intel Core 3 processor and 4 GB of memory. In the followng experments we use IBM Quest Synthetc Data Generator to generate the expermental data. Fgure 1 llustrates that dstorton rato changes dependng on the varaton of l-value, k-value and -value. When l-value ncreases, prvacy protecton degree ncreases. The number of dfferent senstve attrbutes wthn the same equvalent group ncreases, resultng n the generalzaton level of dentfer attrbutes ncreased, then leadng to substantal nformaton loss from the orgnal data ncreased, ultmately causng dstorton rato of multple senstve attrbutes set ncreased. When other condtons are dentcal, k-value ncreased, the group sze becomes larger. Because the grouped data should meet dverse, attrbutes n equvalent group ncrease. Then generalzaton levels ncrease and data dstorton rate also ncreases. When the number of data sets and the parameters are equal, the dmenson of senstve attrbute ncreases, the dstorton rate of multple senstve attrbutes s hgher, whch s caused by senstve property dversty n each dmenson. By contrastng the followng fgure, we can conclude that PRPT protocol by usng multple senstve attrbutes generalzaton can avod excessve generalzaton of the dentfer attrbutes, so the total dstorton rate s less than the other method. Therefore the total dstorton rato of PRPT protocol s smaller than other algorthm. And compared to the l-dversty, k-l-senstve rules has a relatvely low level of data loss. Ths experment suggests that PRPT protocol has lower nformaton loss than l-dversty algorthm and k-l algorthm. Accordng to the above expermental results analyss, we can conclude that PRPT protocol can get References better performance than other algorthm under the same condtons FIGURE 1 Dstorton rato changes dependng on l-value changes (k=40, =3) 9 Conclusons Cloud computng has been envsoned as the next generaton archtecture of IT Enterprse. Ths technology not only gave us more convenence, but also exposed some securty problem. When people access cloud servce or receve cloud servce, they should provde many attrbutes to ensure ths servce accomplsh successfully. But much prvate data are ncluded n these attrbutes. If these senstve attrbutes are dsclosed, t wll brng sufferng to people. Ths paper llustrated the mportance of protectng customers' prvate data n cloud computng. We have argued that t s very mportant to take prvacy nto account and we proposed a novel anonymty-based protocol preservng prvacy based cloud envronment. Acknowledgements PRPT Number of Nodes k-anonymty Ths research s supported by the Educaton Scence and Technology Project of Henan Provnce under the grant No. 13A and by the Technology Bureau Project of Zhengzhou Cty under the grant No. 131PPTGG [1] Wang J,, Zhao Y, Shuo J, Le J 2009 Provdng Prvacy Preservng n Cloud Computng n ICTM Proceedngs IEEE [2] Almorsy M 2011 Collaboraton-Based Cloud Computng Securty Management Framework, n CLOUD Proceedngs IEEE [3] Kretzschmar M, Gollng M 2011 Securty management spectrum n future mult-provder Inter-Cloud envronments-method to hghlght necessary further development n SVM Proceedngs IEEE 1-8 [4] Bouayad A, Bllat A, El Houda Mejhed N, El Ghaz M 2012 Cloud computng: Securty challenges n CIST Proceedngs IEEE [5] Khall I, Khreshah A, Bouktf S, Ahmad A 2013 Securty Concerns n Cloud Computng n ITNG Proceedngs IEEE [6] Kandukur B, Patur V, Raksht A 2009 Cloud Securty Issues n SCC Proceedngs IEEE [7] Hamd M 2012 Securty of cloud computng, storage, and networkng n CTS Proceedngs IEEE 1-5 [8] Behl A, Behl K 2012 Securty Paradgms for Cloud Computng n CICSYN Proceedngs IEEE [9] Al Awadh E, Salah K, Martn T 2013 Assessng the securty of the cloud envronment n GCC Proceedngs IEEE [10] Wang J, Le J A New Prvacy Preservng Approach Used n Cloud Computng Journal of Key Engneerng Materals (1) (n Chnese) [11] Francs T, Vadvel S 2012 Cloud computng securty: Concerns, strateges and best practces n ICCCTAM Proceedngs IEEE [12] Wang J, Novel 2012 A Anonymty Algorthm for Prvacy Preservng n Publshng Multple Senstve Attrbutes Research Journal of Appled Scences, Engneerng and Technology 4(22) [13] Mell P 2012 What's Specal about Cloud Securty Journal of IT Professonal 14(4) 6-8 [14] Vega J 2012 Cloud Securty: Not a Problem Journal of Securty & Prvacy 10(4) 3 [15] Goth G 2011 Publc Sector Clouds Begnnng to Blossom: Effcency, New Culture Trumpng Securty Fears Journal of Internet Computng 15(6) 7-9 [16] Kaufman L M 2009 Data securty n the World of Cloud Computng n Securty and Prvacy Proceedngs IEEE 61-4 [17] Behl A, Behl K 2012 An analyss of cloud computng securty ssues n WICT Proceedngs IEEE

6 [18] Wang J, Le J 2010 Novel Prvacy Preservng Classfcaton Mnng Approach Based Cloud Envronment n BTMC Proceedngs IEEE [19] Wang J, Luo Y, Zhao Y, Le J 2009 A Survey on Prvacy Preservng Data Mnng n DBTA Proceedngs IEEE [20] Zhang Q, Koudas N, Srvastava D, Yu T 2007 Aggregate query answerng on anonymzed tables n ICDE Proceedngs IEEE [21] L Y, Tygar JD, Hellersten J M 2005 Prvate Matchng, n Computer Securty Proceedngs Sprnger [22] San P, Yun S, Mranda M 2009 A prvacy manager for cloud computng In CloudCom Proceedngs IEEE [23] Mayank B, Rakesh A, Jadeep V 2009 Prvacy-preservng ndexng of documents on the network The VLDB Journal (n Chnese) [24] Zhan J, Matwn S 2006 A Crypto-Based Approach to Prvacy- Preservng Collaboratve Data Mnng n Data Mnng Proceedngs IEEE [25] Wang S, Lu G 2011 Fle Encrypton and Decrypton System Based on RSA Algorthm n Computatonal and Informaton Scences Proceedngs IEEE [26] Lu W, Wang Y, Cao Y 2011 Research on Secure Mult-Party Closest Strng Problem n Wreless Communcatons, Networkng and Moble Computng Proceedngs IEEE 1-4 [27] Lee J, Chang J 2007 Semantcally Secure Authentcated Encrypton Scheme and the Same Scheme for Ad-hoc Group Called a Rng n Informaton Technology Proceedngs IEEE Authors Jan Wang, born n 1981, November 26th, Chna Current poston: an nstructor n Henan Unversty of Economcs and Law. Unversty studes: Ph.D. degree from Donghua Unversty, Shangha, Chna n June Scentfc nterest: prvacy preservng n cloud computng, nformaton securty. Publcatons: 10 papers. Le Wang, born n 1983, October 29th, Chna Current poston: an nstructor n SIAS Internatonal Unversty. Unversty studes: Bachelor degree from Zhengzhou Unversty, Zhengzhou, Chna n June Scentfc nterest: computer scence, database applcaton. 144

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS

AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Internatonal Journal of Network Securty & Its Applcatons (IJNSA), Vol.5, No.3, May 2013 AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Len Harn 1 and Changlu Ln 2 1 Department of Computer Scence

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

Proactive Secret Sharing Or: How to Cope With Perpetual Leakage Proactve Secret Sharng Or: How to Cope Wth Perpetual Leakage Paper by Amr Herzberg Stanslaw Jareck Hugo Krawczyk Mot Yung Presentaton by Davd Zage What s Secret Sharng Basc Idea ((2, 2)-threshold scheme):

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Trivial lump sum R5.0

Trivial lump sum R5.0 Optons form Once you have flled n ths form, please return t wth your orgnal brth certfcate to: Premer PO Box 2067 Croydon CR90 9ND. Fll n ths form usng BLOCK CAPITALS and black nk. Mark all answers wth

More information

PKIS: practical keyword index search on cloud datacenter

PKIS: practical keyword index search on cloud datacenter Park et al. EURASIP Journal on Wreless Communcatons and Networkng 20, 20:64 http://jwcn.euraspjournals.com/content/20//64 RESEARCH Open Access PKIS: practcal keyword ndex search on cloud datacenter Hyun-A

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

Study on Model of Risks Assessment of Standard Operation in Rural Power Network

Study on Model of Risks Assessment of Standard Operation in Rural Power Network Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analysis of View Maintenance Techniques for Data Warehouses A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

An Analysis of Factors Influencing the Self-Rated Health of Elderly Chinese People

An Analysis of Factors Influencing the Self-Rated Health of Elderly Chinese People Open Journal of Socal Scences, 205, 3, 5-20 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/ss http://dx.do.org/0.4236/ss.205.35003 An Analyss of Factors Influencng the Self-Rated Health of

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Multi-sensor Data Fusion for Cyber Security Situation Awareness

Multi-sensor Data Fusion for Cyber Security Situation Awareness Avalable onlne at www.scencedrect.com Proceda Envronmental Scences 0 (20 ) 029 034 20 3rd Internatonal Conference on Envronmental 3rd Internatonal Conference on Envronmental Scence and Informaton Applcaton

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

More information

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy 4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

More information

Optimization Model of Reliable Data Storage in Cloud Environment Using Genetic Algorithm

Optimization Model of Reliable Data Storage in Cloud Environment Using Genetic Algorithm Internatonal Journal of Grd Dstrbuton Computng, pp.175-190 http://dx.do.org/10.14257/gdc.2014.7.6.14 Optmzaton odel of Relable Data Storage n Cloud Envronment Usng Genetc Algorthm Feng Lu 1,2,3, Hatao

More information

Watermark-based Provable Data Possession for Multimedia File in Cloud Storage

Watermark-based Provable Data Possession for Multimedia File in Cloud Storage Vol.48 (CIA 014), pp.103-107 http://dx.do.org/10.1457/astl.014.48.18 Watermar-based Provable Data Possesson for Multmeda Fle n Cloud Storage Yongjun Ren 1,, Jang Xu 1,, Jn Wang 1,, Lmng Fang 3, Jeong-U

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Hollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA )

Hollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA ) February 17, 2011 Andrew J. Hatnay ahatnay@kmlaw.ca Dear Sr/Madam: Re: Re: Hollnger Canadan Publshng Holdngs Co. ( HCPH ) proceedng under the Companes Credtors Arrangement Act ( CCAA ) Update on CCAA Proceedngs

More information

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks PP/ Grd-based Overlay Archtecture to Support VoIP Servces n Large Scale IP Networks We Yu *, Srram Chellappan # and Dong Xuan # * Dept. of Computer Scence, Texas A&M Unversty, U.S.A. {weyu}@cs.tamu.edu

More information

Identifying Workloads in Mixed Applications

Identifying Workloads in Mixed Applications , pp.395-400 http://dx.do.org/0.4257/astl.203.29.8 Identfyng Workloads n Mxed Applcatons Jeong Seok Oh, Hyo Jung Bang, Yong Do Cho, Insttute of Gas Safety R&D, Korea Gas Safety Corporaton, Shghung-Sh,

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Graph Theory and Cayley s Formula

Graph Theory and Cayley s Formula Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll

More information

Communication Networks II Contents

Communication Networks II Contents 8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Research of concurrency control protocol based on the main memory database

Research of concurrency control protocol based on the main memory database Research of concurrency control protocol based on the man memory database Abstract Yonghua Zhang * Shjazhuang Unversty of economcs, Shjazhuang, Shjazhuang, Chna Receved 1 October 2014, www.cmnt.lv The

More information

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,

More information

LIFETIME INCOME OPTIONS

LIFETIME INCOME OPTIONS LIFETIME INCOME OPTIONS May 2011 by: Marca S. Wagner, Esq. The Wagner Law Group A Professonal Corporaton 99 Summer Street, 13 th Floor Boston, MA 02110 Tel: (617) 357-5200 Fax: (617) 357-5250 www.ersa-lawyers.com

More information

Canon NTSC Help Desk Documentation

Canon NTSC Help Desk Documentation Canon NTSC Help Desk Documentaton READ THIS BEFORE PROCEEDING Before revewng ths documentaton, Canon Busness Solutons, Inc. ( CBS ) hereby refers you, the customer or customer s representatve or agent

More information

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1 Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center

More information

Uncrystallised funds pension lump sum payment instruction

Uncrystallised funds pension lump sum payment instruction For customers Uncrystallsed funds penson lump sum payment nstructon Don t complete ths form f your wrapper s derved from a penson credt receved followng a dvorce where your ex spouse or cvl partner had

More information

IT09 - Identity Management Policy

IT09 - Identity Management Policy IT09 - Identty Management Polcy Introducton 1 The Unersty needs to manage dentty accounts for all users of the Unersty s electronc systems and ensure that users hae an approprate leel of access to these

More information

Local Business Starter Pack.

Local Business Starter Pack. Local Busness Starter Pack. Who should complete ths applcaton? If the busness s A company An assocaton (ncorporated or unncorporated) A partnershp A sole propretor or ndvdual A busness trust Ths form can

More information

Small pots lump sum payment instruction

Small pots lump sum payment instruction For customers Small pots lump sum payment nstructon Please read these notes before completng ths nstructon About ths nstructon Use ths nstructon f you re an ndvdual wth Aegon Retrement Choces Self Invested

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Fuzzy Keyword Search over Encrypted Data in Cloud Computing

Fuzzy Keyword Search over Encrypted Data in Cloud Computing Fuzzy Keyword Search over Encrypted Data n Cloud Computng Jn L,QanWang, Cong Wang,NngCao,KuRen, and Wenjng Lou Department of ECE, Illnos Insttute of Technology Department of ECE, Worcester Polytechnc Insttute

More information

Towards a Global Online Reputation

Towards a Global Online Reputation Hu L Unversty of Ottawa 55 Laurer Ave E Ottawa, ON KN 6N5 Canada + (63) 562 5800, 8834 Hl03@uottawa.ca Towards a Global Onlne Reputaton Morad Benyoucef Unversty of Ottawa 55 Laurer Ave E Ottawa, ON KN

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

Tools for Privacy Preserving Distributed Data Mining

Tools for Privacy Preserving Distributed Data Mining Tools for Prvacy Preservng Dstrbuted Data Mnng hrs lfton, Murat Kantarcoglu, Jadeep Vadya Purdue Unversty Department of omputer Scences 250 N Unversty St West Lafayette, IN 47907-2066 USA (clfton, kanmurat,

More information

PEER REVIEWER RECOMMENDATION IN ONLINE SOCIAL LEARNING CONTEXT: INTEGRATING INFORMATION OF LEARNERS AND SUBMISSIONS

PEER REVIEWER RECOMMENDATION IN ONLINE SOCIAL LEARNING CONTEXT: INTEGRATING INFORMATION OF LEARNERS AND SUBMISSIONS PEER REVIEWER RECOMMENDATION IN ONLINE SOCIAL LEARNING CONTEXT: INTEGRATING INFORMATION OF LEARNERS AND SUBMISSIONS Yunhong Xu, Faculty of Management and Economcs, Kunmng Unversty of Scence and Technology,

More information

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

More information

A Hierarchical Reliability Model of Service-Based Software System

A Hierarchical Reliability Model of Service-Based Software System 2009 33rd Annual IEEE Internatonal Computer Software and Applcatons Conference A Herarchcal Relablty Model of Servce-Based Software System Lun Wang, Xaoyng Ba, Lzhu Zhou Department of Computer Scence and

More information

Provably Secure Single Sign-on Scheme in Distributed Systems and Networks

Provably Secure Single Sign-on Scheme in Distributed Systems and Networks 0 IEEE th Internatonal Conference on Trust, Securty and Prvacy n Computng and Communcatons Provably Secure Sngle Sgn-on Scheme n Dstrbuted Systems and Networks Jangshan Yu, Guln Wang, and Y Mu Center for

More information

A FASTER EXTERNAL SORTING ALGORITHM USING NO ADDITIONAL DISK SPACE

A FASTER EXTERNAL SORTING ALGORITHM USING NO ADDITIONAL DISK SPACE 47 A FASTER EXTERAL SORTIG ALGORITHM USIG O ADDITIOAL DISK SPACE Md. Rafqul Islam +, Mohd. oor Md. Sap ++, Md. Sumon Sarker +, Sk. Razbul Islam + + Computer Scence and Engneerng Dscplne, Khulna Unversty,

More information

A heuristic task deployment approach for load balancing

A heuristic task deployment approach for load balancing Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

A High-confidence Cyber-Physical Alarm System: Design and Implementation

A High-confidence Cyber-Physical Alarm System: Design and Implementation A Hgh-confdence Cyber-Physcal Alarm System: Desgn and Implementaton Longhua Ma 1,2, Tengka Yuan 1, Feng Xa 3, Mng Xu 1, Jun Yao 1, Meng Shao 4 1 Department of Control Scence and Engneerng, Zhejang Unversty,

More information

An Approach for Detecting a Flooding Attack Based on Entropy Measurement of Multiple E-Mail Protocols

An Approach for Detecting a Flooding Attack Based on Entropy Measurement of Multiple E-Mail Protocols Journal of Appled Scence and Engneerng, Vol. 18, No. 1, pp. 79 88 (2015) DOI: 10.6180/jase.2015.18.1.10 An Approach for Detectng a Floodng Attack Based on Entropy Measurement of Multple E-Mal Protocols

More information

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com

More information

To manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.

To manage leave, meeting institutional requirements and treating individual staff members fairly and consistently. Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:

More information

A Novel Problem-solving Metric for Future Internet Routing Based on Virtualization and Cloud-computing

A Novel Problem-solving Metric for Future Internet Routing Based on Virtualization and Cloud-computing www.ijcsi.org 159 A Novel Problem-solvng Metrc for Future Internet Routng Based on Vrtualzaton and Cloud-computng Rujuan Zheng, Mngchuan Zhang, Qngtao Wu, Wangyang We and Haxa Zhao Electronc & Informaton

More information

Aryabhata s Root Extraction Methods. Abhishek Parakh Louisiana State University Aug 31 st 2006

Aryabhata s Root Extraction Methods. Abhishek Parakh Louisiana State University Aug 31 st 2006 Aryabhata s Root Extracton Methods Abhshek Parakh Lousana State Unversty Aug 1 st 1 Introducton Ths artcle presents an analyss of the root extracton algorthms of Aryabhata gven n hs book Āryabhatīya [1,

More information

Research of Network System Reconfigurable Model Based on the Finite State Automation

Research of Network System Reconfigurable Model Based on the Finite State Automation JOURNAL OF NETWORKS, VOL., NO. 5, MAY 24 237 Research of Network System Reconfgurable Model Based on the Fnte State Automaton Shenghan Zhou and Wenbng Chang School of Relablty and System Engneerng, Behang

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

Auditing Cloud Service Level Agreement on VM CPU Speed

Auditing Cloud Service Level Agreement on VM CPU Speed Audtng Cloud Servce Level Agreement on VM CPU Speed Ryan Houlhan, aojang Du, Chu C. Tan, Je Wu Department of Computer and Informaton Scences Temple Unversty Phladelpha, PA 19122, USA Emal: {ryan.houlhan,

More information

Complex Service Provisioning in Collaborative Cloud Markets

Complex Service Provisioning in Collaborative Cloud Markets Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zöller, Stefan Schulte, Ralf Stenmetz: Complex Servce Provsonng n Collaboratve Cloud Markets. In: W. Abramowcz et al. (Eds.): Proceedngs of the 4th European

More information

ADVERTISEMENT FOR THE POST OF DIRECTOR, lim TIRUCHIRAPPALLI

ADVERTISEMENT FOR THE POST OF DIRECTOR, lim TIRUCHIRAPPALLI ADVERTSEMENT FOR THE POST OF DRECTOR, lm TRUCHRAPPALL The ndan nsttute of Management Truchrappall (MT), establshed n 2011 n the regon of Taml Nadu s a leadng management school n nda. ts vson s "Preparng

More information

Compact CCA2-secure Hierarchical Identity-Based Broadcast Encryption for Fuzzy-entity Data Sharing

Compact CCA2-secure Hierarchical Identity-Based Broadcast Encryption for Fuzzy-entity Data Sharing Compact CCA2-secure Herarchcal Identty-Based Broadcast Encrypton for Fuzzy-entty Data Sharng Weran Lu 1, Janwe Lu 1, Qanhong Wu 1, Bo Qn 2, Davd Naccache 3, and Houda Ferrad 4 1 School of Electronc and

More information

A role based access in a hierarchical sensor network architecture to provide multilevel security

A role based access in a hierarchical sensor network architecture to provide multilevel security 1 A role based access n a herarchcal sensor network archtecture to provde multlevel securty Bswajt Panja a Sanjay Kumar Madra b and Bharat Bhargava c a Department of Computer Scenc Morehead State Unversty

More information

LATTICE-BASED FIREWALL FOR SAFETY INTERNET ACCESS

LATTICE-BASED FIREWALL FOR SAFETY INTERNET ACCESS Proceedngs of the Postgraduate Annual Research Semnar 2005 238 LATTICE-BASED FIREWALL FOR SAFETY INTERNET ACCESS Cahyo Crysdan and Abdul Hanan Abdullah The Faculty of Computer Scence and Informaton System

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked

More information

Scalable and Secure Architecture for Digital Content Distribution

Scalable and Secure Architecture for Digital Content Distribution Valer Bocan Scalable and Secure Archtecture for Dgtal Content Dstrbuton Mha Fagadar-Cosma Department of Computer Scence and Engneerng Informaton Technology Department Poltehnca Unversty of Tmsoara Alcatel

More information

Capacity-building and training

Capacity-building and training 92 Toolkt to Combat Traffckng n Persons Tool 2.14 Capacty-buldng and tranng Overvew Ths tool provdes references to tranng programmes and materals. For more tranng materals, refer also to Tool 9.18. Capacty-buldng

More information

Data Mining from the Information Systems: Performance Indicators at Masaryk University in Brno

Data Mining from the Information Systems: Performance Indicators at Masaryk University in Brno Data Mnng from the Informaton Systems: Performance Indcators at Masaryk Unversty n Brno Mkuláš Bek EUA Workshop Strasbourg, 1-2 December 2006 1 Locaton of Brno Brno EUA Workshop Strasbourg, 1-2 December

More information

Research on Privacy Protection Approach for Cloud Computing Environments

Research on Privacy Protection Approach for Cloud Computing Environments , pp. 113-120 http://dx.do.org/10.14257/jsa.2015.9.3.11 Research on Prvacy Protecton Approach for Cloud Computng Envronments Xaohu L 1,2, Hongxng Lang 3 and Dan Ja 1 1 College of Electrcal and Informaton

More information

Vembu StoreGrid Windows Client Installation Guide

Vembu StoreGrid Windows Client Installation Guide Ser v cepr ov dered t on Cl enti nst al l at ongu de W ndows Vembu StoreGrd Wndows Clent Installaton Gude Download the Wndows nstaller, VembuStoreGrd_4_2_0_SP_Clent_Only.exe To nstall StoreGrd clent on

More information

A Dynamic Load Balancing for Massive Multiplayer Online Game Server

A Dynamic Load Balancing for Massive Multiplayer Online Game Server A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,

More information

An Efficient Social Search Method Based on Location and User Preferences in Mobile Environments

An Efficient Social Search Method Based on Location and User Preferences in Mobile Environments , pp.355-368 http://dx.do.org/10.14257/jmue.2015.10.12.34 An Effcent Socal Search Method Based on Locaton and User Preferences n Moble Envronments Byoungyup Lee 1, Mnje Ahn 2, Jongtae Lm 2, Kyungsoo Bok

More information

A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS

A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS Shanthy Menezes 1 and S. Venkatesan 2 1 Department of Computer Scence, Unversty of Texas at Dallas, Rchardson, TX, USA 1 shanthy.menezes@student.utdallas.edu

More information

One Click.. Ȯne Location.. Ȯne Portal...

One Click.. Ȯne Location.. Ȯne Portal... New Addton to your NJ-HITEC Membershp! Member Portal Detals & Features Insde! One Clck.. Ȯne Locaton.. Ȯne Portal... Connect...Share...Smplfy Health IT Member Portal Benefts Trusted Advsor - NJ-HITEC s

More information

Tuition Fee Loan application notes

Tuition Fee Loan application notes Tuton Fee Loan applcaton notes for new part-tme EU students 2012/13 About these notes These notes should be read along wth your Tuton Fee Loan applcaton form. The notes are splt nto three parts: Part 1

More information

Study on CET4 Marks in China s Graded English Teaching

Study on CET4 Marks in China s Graded English Teaching Study on CET4 Marks n Chna s Graded Englsh Teachng CHE We College of Foregn Studes, Shandong Insttute of Busness and Technology, P.R.Chna, 264005 Abstract: Ths paper deploys Logt model, and decomposes

More information

Genetic Algorithm Based Optimization Model for Reliable Data Storage in Cloud Environment

Genetic Algorithm Based Optimization Model for Reliable Data Storage in Cloud Environment Advanced Scence and Technology Letters, pp.74-79 http://dx.do.org/10.14257/astl.2014.50.12 Genetc Algorthm Based Optmzaton Model for Relable Data Storage n Cloud Envronment Feng Lu 1,2,3, Hatao Wu 1,3,

More information

A Falling Detection System with wireless sensor for the Elderly People Based on Ergnomics

A Falling Detection System with wireless sensor for the Elderly People Based on Ergnomics Vol.8, o.1 (14), pp.187-196 http://dx.do.org/1.1457/sh.14.8.1. A Fallng Detecton System wth wreless sensor for the Elderly People Based on Ergnomcs Zhenhe e 1, ng L, Qaoxang Zhao and Xue Lu 3 1 College

More information

Fast Variants of RSA

Fast Variants of RSA Fast Varants of RSA Dan Boneh dabo@cs.stanford.edu Hovav Shacham hovav@cs.stanford.edu Abstract We survey three varants of RSA desgned to speed up RSA decrypton. These varants are backwards compatble n

More information

Ameriprise Financial Services, Inc. or RiverSource Life Insurance Company Account Registration

Ameriprise Financial Services, Inc. or RiverSource Life Insurance Company Account Registration CED0105200808 Amerprse Fnancal Servces, Inc. 70400 Amerprse Fnancal Center Mnneapols, MN 55474 Incomng Account Transfer/Exchange/ Drect Rollover (Qualfed Plans Only) for Amerprse certfcates, Columba mutual

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS

M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS Bogdan Cubotaru, Gabrel-Mro Muntean Performance Engneerng Laboratory, RINCE School of Electronc Engneerng Dubln Cty

More information

Protection, assistance and human rights. Recommended Principles and Guidelines on Human Rights and Human Trafficking (E/2002/68/Add.

Protection, assistance and human rights. Recommended Principles and Guidelines on Human Rights and Human Trafficking (E/2002/68/Add. chapter 8 Vctm assstance 385 Tool 8.3 Protecton, assstance and human rghts Overvew Ths tool dscusses the human rghts consderatons whch must be borne n mnd n protectng and assstng vctms of traffckng. Recommended

More information

Simple Interest Loans (Section 5.1) :

Simple Interest Loans (Section 5.1) : Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

More information

A Cryptographic Key Assignment Scheme for Access Control in Poset Ordered Hierarchies with Enhanced Security

A Cryptographic Key Assignment Scheme for Access Control in Poset Ordered Hierarchies with Enhanced Security Internatonal Journal of Network Securty, Vol.7, No., PP.3 34, Sept. 8 3 A ryptographc Key Assgnment Scheme for Access ontrol n Poset Ordered Herarches wth Enhanced Securty Debass Gr and P. D. Srvastava

More information

Data security in Intelligent Transport Systems

Data security in Intelligent Transport Systems Data securty n Intellgent Transport Systems Tomas ZELINKA Czech Techncal Unversty n rague, FTS 110 00 raha 1, Czech Republc Mroslav SVITEK Czech Techncal Unversty n rague, FTS 110 00 raha 1, Czech Republc

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING

LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING 1 MS. POOJA.P.VASANI, 2 MR. NISHANT.S. SANGHANI 1 M.Tech. [Software Systems] Student, Patel College of Scence and

More information

Mining Multiple Large Data Sources

Mining Multiple Large Data Sources The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of

More information

Cross-Domain Authorization Management Model for Multi- Levels Hybrid Cloud Computing

Cross-Domain Authorization Management Model for Multi- Levels Hybrid Cloud Computing Internatonal Journal of Securty and Its Applcatons, pp.343-352 http://dx.do.org/10.14257/sa.2015.9.12.33 Cross-Doman Authorzaton Management Model for Mult- Levels Hybrd Cloud Computng L Na 1, Dong Yun-We

More information

A Programming Model for the Cloud Platform

A Programming Model for the Cloud Platform Internatonal Journal of Advanced Scence and Technology A Programmng Model for the Cloud Platform Xaodong Lu School of Computer Engneerng and Scence Shangha Unversty, Shangha 200072, Chna luxaodongxht@qq.com

More information

Semantic Link Analysis for Finding Answer Experts *

Semantic Link Analysis for Finding Answer Experts * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 28, 51-65 (2012) Semantc Lnk Analyss for Fndng Answer Experts * YAO LU 1,2,3, XIAOJUN QUAN 2, JINGSHENG LEI 4, XINGLIANG NI 1,2,3, WENYIN LIU 2,3 AND YINLONG

More information

SEVERAL trends are opening up the era of Cloud

SEVERAL trends are opening up the era of Cloud 1 Towards Secure and Dependable Storage Servces n Cloud Computng Cong Wang, Student Member, IEEE, Qan Wang, Student Member, IEEE, Ku Ren, Member, IEEE, Nng Cao, Student Member, IEEE, and Wenjng Lou, Senor

More information

SEVERAL trends are opening up the era of Cloud

SEVERAL trends are opening up the era of Cloud IEEE Transactons on Cloud Computng Date of Publcaton: Aprl-June 2012 Volume: 5, Issue: 2 1 Towards Secure and Dependable Storage Servces n Cloud Computng Cong Wang, Student Member, IEEE, Qan Wang, Student

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

VoIP Pricing in Competitive Telephony Markets

VoIP Pricing in Competitive Telephony Markets o rcng n Compettve Telephony Markets Yung-Mng L nsttute of nformaton Management Natonal Chao Tung Unversty, Tawan 886-3-57111 Ext 57414 yml@mal.nctu.edu.tw Shh-Wen Chu nsttute of nformaton Management Natonal

More information