Certificate Revocation using Fine Grained Certificate Space Partitioning


 Conrad Kennedy
 2 years ago
 Views:
Transcription
1 Certfcate Revocaton usng Fne Graned Certfcate Space Parttonng Vpul Goyal Department of Computer Scence Unversty of Calforna, Los Angeles Abstract A new certfcate revocaton system s presented. The basc dea s to dvde the certfcate space nto several parttons, the number of parttons beng dependent on the PKI envronment. Each partton contans the status of a set of certfcates. A partton may ether expre or be renewed at the end of a tme slot. Ths s done effcently usng hash chans. We evaluate the performance of our scheme followng the framework and numbers used n prevous papers. We show that for many practcal values of the system parameters, our scheme s more effcent than the three well known certfcate revocaton technques: CRL, CRS and CRT. Our scheme ams to strke the rght balance between CA to drectory communcaton costs and query costs by carefully selectng the number of parttons. 1 Introducton A certfcate s a dgtally sgned statement bndng the key holder s (prncpal s) name to a publc key and varous other attrbutes. The sgner (or the ssuer) s commonly called a certfcate authorty (CA). Certfcates act as a mean to provde trusted nformaton about the CA s declaraton w. r. t. the prncpal. The declaraton may be of the form: We, the Certfcate Authorty, declare that we know Alce. The publc key of Alce s... We further declare that we trust Alce for... (optonal part) Certfcates are tamperevdent (modfyng the data makes the sgnature nvald) and unforgeable (only the holder of the secret, sgnng key can produce the sgnature). Certfcates are the buldng blocks of a Publc Key Infrastructure (PKI). When a certfcate s ssued, the CA declares the perod of tme for whch the certfcate s vald. However, there may be stuatons when the certfcate must abnormally be declared nvald pror to ts expraton date. Ths s called certfcate revocaton. Ths can be vewed as blacklstng the certfcate. Ths means that the exstence of a certfcate s a necessary but not suffcent evdence for ts valdty. A method for revokng certfcates and dstrbutng ths revocaton nformaton to all the nvolved partes s thus a requrement n 1
2 PKI. The reasons for revokng a certfcate may be: suspected or detected key compromse, change of prncpal name, change of relatonshp between a prncpal and the CA (e.g., Alce may leave or be fred from the company) or end of CA s trust nto the prncple due to any possble reason. The revocaton mechansm should have an acceptable degree of tmelness,.e., the nterval between when the CA made a record of revocaton and when ths nformaton became avalable to the relyng partes should be small enough to be acceptable. Further, t s very mportant for the revocaton mechansm to be effcent as the runnng expenses of a PKI derves manly from admnsterng revocaton [Stu95]. Exstng Technques for Certfcate Revocaton. Certfcate Revocaton Lst (CRL) s the frst and the smplest method of certfcate revocaton. A CRL s a perodcally ssued and dgtally sgned lst contanng the seral number of all the revoked certfcates ssued by a partcular CA. However, t s wdely recognzed [Mc97, Goy04, Rv98] that CRLs are too costly and cannot provde a good degree of tmelness. Certfcate Revocaton System (CRS) [Mc96, Mc97, Mc02] was ntroduced by Mcal and could answer the user queres wth exceptonal effcency. The man problem wth CRS s that t s not sutable n case of a dstrbuted query answerng system. The CA to drectory communcaton 1 s too hgh shootng up the overall cost of the system [NN98, ALO98]. Aello et al [ALO98] proposed an mprovement to CRS amed at reducng ths communcaton but ther approach had problems as we dscuss n secton 2.2. Certfcate Revocaton Tree (CRT) [Koc98] s the thrd well known technque for certfcate revocaton. Though the CA to drectory communcaton s very low, the query cost s too hgh, agan shootng up the overall cost of the system. Another technque for certfcate revocaton s the Onlne Certfcate Status Protocol (OCSP) [OCSrg] desgned by IETF. In OCSP, the CA smply dgtally sgns the response to a certfcate status query. Thus, OCSP may provde very hgh degree of tmelness but s recognzed to be nonscalable snce the CA s requred to compute a sgnature for answerng every query. Further, OCSP has no dstrbuted mplementaton,.e., t cannot be used n the settngs where there should be a number of untrusted drectores answerng the user queres. Usng technques from Identty based encrypton [BF01], Gentry [Gen03] proposed a new cryptosystem havng attractve propertes n terms of revocaton. However t was not a generc revocaton soluton and could not be used wth exstng cryptosystems (such as RSA). Other revocaton technques nclude [DBW01, BLL00, GGM00, MJ00]. See [Zhe03] for an analyss of these technques. Our Contrbuton. Motvated by the CA to drectory communcaton cost (CDCC) and the query cost (QC) mbalances n both CRS and CRT, we propose a new system amed at balancng the two. CRS and CRT are the two extremes, CDCC beng very hgh and QC beng extremely low n the former, and CDCC beng extremely low and QC beng too hgh n the latter. Our technque ams at strkng the rght balance between CDCC and QC to mnmze the system cost. The basc dea s to dvde the total certfcate space nto 1 The terms CA to drectory communcaton cost and drectory update cost are used nterchangeably n ths paper 2
3 several parttons. The number of parttons s a key parameter whch can be optmzed to reduce the overall communcaton cost. Each partton has a unque seral number, s dgtally sgned and contans the status of a set of certfcate. At the end of a tme slot, a partton may ether expre or be renewed dependng upon whether there was a status change for any of the certfcates covered by t or not. Renewng a partton s done by exposng a lnk of the hash chan whose tp s embedded n that partton. Our system s named CSPR (certfcate space parttonng wth renewals). As we show n secton 4, the overall communcaton cost of our system s less than the three wdely used revocaton technques,.e., CRL, CRS and CRT for many practcal values of the system parameters. Rest of the paper s organzed as follows: secton 2 gves a background on hash chans and common certfcate revocaton technques, secton 3 ntroduces the proposed system called CSPR, secton 4 evaluates the CSPR costs and compares t wth other technques n use, secton 5 concludes the paper. 2 Background 2.1 Hash Chans A hash chan of length L s constructed by applyng a oneway hash functon H(.) recursvely to an ntal seed value s. H L (s) = H (H (...H (s))) } {{ } L tmes The last element H L (s), also called the tp T of the hash chan, has the property that usng H L (s), H L 1 (s) can not be computed but ts correctness can be verfed. 2.2 Certfcate Revocaton Technques Certfcate Revocaton Lst (CRL) s the frst and the smplest method of certfcate revocaton. A CRL s smply a perodcally ssued, tmestamped and dgtally sgned lst contanng the seral number of all the revoked certfcates ssued by a partcular CA. Certfcate revocaton status (CRS) was ntroduced by Mcal [Mc96, Mc97, Mc02]. It was also patented and commercalzed. The basc dea s as follows. For certfcate creaton, the CA chooses two random numbers Y 0 and N 0 and computes Y = H 365 (Y 0 ) and N = H(N 0 ). These two felds are ncluded n the certfcate and are sgned along wth the other usual felds. The number 365 denotes the number of days n the year. On the th day, 1. f the certfcate s revoked, the CA releases N 0, whch can be verfed by hashng and comparng wth N specfed n the certfcate. 2. f the certfcate s stll vald, the CA releases H 365 (Y 0 ) whch can be verfed by hashng tmes and comparng wth Y specfed n the certfcate. 3
4 Aello et al [ALO98] extended CRS by reducng the overall CA to drectory communcaton whle stll mantanng the same tny query communcaton. Ths s done by ncludng log 2 (N) hash chan tps n each certfcate, N beng the number of certfcates n the system. Although the reducton n CDCC was hgh for low revocaton rates, the same cannot be sad for system wth hgher revocaton rates. Further, ths mprovement comes at the prce of a sgnfcant ncrease n the certfcate transmsson costs due to ncrease n the certfcate sze. Certfcate Revocaton Tree (CRT) was ntroduced by Kochar [Koc98, NN98]. A CRT s based on a Merkle hash tree [Mer89] contanng certfcate seral number ranges as the tree leaves. The root of the hash tree s sgned by the CA. Now, the certfcate status proof for a certfcate wth seral number s conssts of the path node sblngs from the root to the approprate leaf (havng s n ts range), n addton to the sgnature on the root of the tree. 3 The Proposed Technque We start by explanng a few notatons to be used n the rest of the paper. N The total number of certfcates handled by the CA R The estmated number of certfcates (out of N) that wll eventually be revoked pror to expraton T The number of tme slots for whch a certfcate s ssued. One tme slot s the duraton between two certfcate status nformaton releases by the CA (e.g., for a weekly CRL, tme slot s one week). It represents the maxmum amount of tme between when a certfcate gets revoked by the CA and when the new status s made avalable to the relyng partes. q Estmated average number of queres per day handled by the system T Representaton of the th absolute tme slot,.e., the th tme slot after the CA has started operaton P The number of parttons n whch the total certfcate space of N certfcates s dvded. P s the key parameter n our scheme. We dscover later the technque to fnd out the optmal value of P for a gven set of system parameters. S The seral number of the th partton n The number of certfcates whose status s contaned n one partton. We have n P = N P j The verson of the th partton created and released at the begnnng of jth tme slot T j. We talk more about versons of a partton later. D Number of drectores n the system U Number of updates to the drectores per day. Hence, U s equal to the number of tme slots n one day. S CA (M) Sgnature on the message M wth the prvate key of the CA. L SR The number of bts needed to hold a seral number (of a certfcate or partton) L H The length of the hash functon output n bts The length of a dgtal sgnature n bts L S 4
5 L P L T The length of a partton n bts The number of bts needed to hold a tme slot number 3.1 Creatng Parttons Unlke CRS and lke CRT and CRL, our soluton works for non custom bult certfcates. Whle CRS requres the certfcates to have two addtonal felds Y and N, our technque can be used wth any set of certfcates havng seral numbers. Ths may be especally mportant whle mgratng an exstng PKI from one certfcate revocaton soluton to another. As dscussed before, the basc dea s to dvde the certfcate space nto a number of parttons, each partton contanng revocaton status of the certfcates wth seral numbers n a partcular range. Note that a partton may have several versons. When a certfcate contaned n a partton changes status (.e., gets revoked), the current verson of that partton s sad to have expred and a new verson, reflectng the new certfcate status, s created and released by the CA at the begnnng of the next tme slot. If none of the certfcates n a partcular partton gets revoked durng a tme slot, the same verson s renewed by the CA by exposng a hash chan lnk at the begnnng of the next tme slot. The detals follow. The CA dvdes the whole certfcate space nto P parttons 2, each partton contanng the status nformaton of n certfcates havng consecutve seral numbers. Each partton s gven a unque seral number whch s one less than the seral number of the frst certfcate n that partton. Hence, a partton havng seral number S contans the revocaton status of certfcates wth seral numbers from S + 1 to S + n. Each partton contans a feld called Certfcate Status Data (CSD). Ths feld contans the revocaton status of all the certfcates n that partton. The jth bt of the CSD of the th partton s 0 f the certfcate wth seral number S + j s revoked and s 1 otherwse. Clearly, the sze of ths feld s n bts, one bt each for holdng the status of one certfcate. We represent the CSD feld of the th partton as CSD. For creatng a verson P j of the th partton to be released at the begnnng of T j, a hash chan of length L wth seed k j s constructed and ts tp s specfed n the partton. We talk more about the choce of L later. The seed k j s chosen randomly by the CA. We have: P j = S CA (T ( ) ) j, S, H L k j, CSD (1) Where CSD s the certfcate status data at the begnnng of T j. It s also possble to later add more certfcates to the already exstng set of certfcates by addng new parttons. Snce certfcates may not always be added n chunks of n, we allow the new partton beng added to have some nonexstent certfcates also. More precsely, a new partton wll be created wth all of ts n CSD bts as 1. It s possble that there may not yet exst certfcates wth some of the seral numbers lyng n the seral number range of that partton. Consequently, as more and more certfcates are later added, there wll be no need to add more parttons untl there are no nonexstent certfcates n that partton. 2 We dscuss how to select P optmally later on 5
6 3.2 System Operaton At the begnnng of the tme slot T k, the CA does the followng: 1. For all the parttons for whch there was no change n the certfcate status data (.e., none of the certfcates n that partton were revoked) durng tme slot T k 1, the CA reveals the next lnk of the hash chan. For partton P j, the lnk HL (k j) (k j ) s revealed. All the drectores n the system are updated wth ths new hash chan lnk. Hash chan traversal technques [Jak02, CJ02, Sel03] may be used by the CA to effcently compute the next lnk to be revealed. Note that CSD need not be changed for a certfcate whch expred (but was not revoked) durng the tme slot T k 1. Hence, t s perfectly possble that the status of a certfcate s 1 even after t has expred. 2. For all the parttons for whch the certfcate status data changed durng tme slot T k 1, a new verson s released by the CA. The new verson P k for P j s created as follows: P k = S CA (T ( ) ) k, S, H L k k, CSD Where CSD s the new certfcate status data for ths partton. As an optmzaton, the CA need not send the whole new partton verson to the drectores. Instead, only the nformaton whch enables the drectores to create the new partton verson usng the older verson s sent. We call ths nformaton the partton update nformaton (PUI). For a partton, the seral number of all the certfcates revoked from t along wth the new hash chan tp and the new sgnature suffce as PUI. Now, durng tme slot T k, a drectory answers a user certfcate status query for a seral number s by frst locatng the approprate partton and then sendng that partton and the latest hash chan lnk revealed for that partton to the user. More precsely, the drectory fnds an S s.t. (S +1) s (S +n), locates ts current (unexpred) verson P j, and then sends back P j along wth H L (k j) (k j ). Note that there s no need to trust the drectory for sendng the unexpred versons only. A drectory wll be unable to produce the hash chan lnk H L (k j) (k j j ) for a verson P whch expred pror to the begnnng of tme slot T k. The verfer can verfy the status of the certfcate from the response by: 1. makng sure that (S + 1) s (S + n) and the (s S ) th bt of the CSD contaned n the sent P j s 1, 2. verfyng the CA sgnature on P j, 3. verfyng that hashng the sent hash chan lnk (current tme slot tme slot number T j specfed n P j j ) tmes matches wth the hash chan tp specfed n P. Now we comment on the choce of L, the length of the hash chan. If a partton does not expre due to changes n ts CSD, t wll automatcally expre when ts hash chan lnks are exhausted. At ths pont, a new verson wll have to be created by the CA. Thus, smply, L should be large enough to ensure that the probablty of the hash chan lnks 6
7 beng exhausted before the partton expres s reasonably low. A good choce for L seems to be T, the total number of tme slots for whch a certfcate s vald. Assumng L = T, by the tme the hash chan gets exhausted, all the certfcates n the partton would have already expred. 3.3 System Costs Now we determne the average daly cost of the proposed system n terms of bts. We have the followng. CA to Drectory Communcaton Cost per Update (CDCCPU). CA to drectory communcaton per update s comprsed of the hash chan lnks for the unexpred parttons and the PUI for the expred parttons. The aggregate of all PUIs conssts of the seral numbers of all the certfcates revoked durng the prevous tme slot plus the new hash chan tp and sgnature for all the expred parttons. Clearly, the average number of certfcates revoked per tme slot s R/T. Assumng E to be the average number of parttons exprng per tme slot, we have the followng: Or, CDCCP U = (P E) L H + R T.L SR + E (L H + L S ) CDCCP U = P.L H + R T.L SR + EL S (2) E s clearly upper bounded by the number of certfcates beng revoked per tme slot,.e., R/T. However, snce multple revoked certfcates may be from the same partton, E may actually be lesser than ths value. E s equal to the number of bns havng at least one ball when R/T balls are thrown nto P bns. Hence, E may be computed as follows: Probablty of the th bn not havng the ball when a ball s thrown nto P bns = (1 1 P ) Probablty of the th bn not havng a ball when R/T balls are thrown nto P bns = (1 1 P ) R T Expected number of bns havng at least one ball = Total number of bns Expected number of bns havng no balls Or, E = P P ( 1 1 )R / T P (3) Drectory Query Cost per Day (QC). A query response conssts of the approprate partton plus a hash chan lnk ndcatng the proof of renewals. Hence, the daly query cost QC s QC = q. (L P + L H ) 7
8 Total System Cost per Day (TC). Total daly cost TC of the system conssts of updatng each of the D drectores U tmes plus the query costs. Hence, we have: T C = U.D. (P.L H + RT ).L SR + EL S + q. (L P + L H ) Further, from (1), we have: Thus, L P = L T + L SR + L H + N P + L S T C = U.D. (P.L H + RT ) (.L SR + EL S + q. L T + L SR + 2.L H + N ) P + L S (4) 3.4 Optmal Number of Parttons In ths secton, we determne the optmal value of P to mnmze the total daly system cost. As wll be clear n the next secton, the total number of parttons P would usually be much hgher than the number of certfcates exprng per tme slot. Hence, to smplfy our analyss, we approxmate E by R/T. We put ths approxmaton of E n equaton (4) and compute the mnma of ts R.H.S. usng dfferentaton. Dfferentatng R.H.S. of (4) w.r.t. P and puttng the result equal to zero, we get: U.D.L H + q ( NP ) 2 = 0 or, N.q P = (5) U.D.L H The above equaton also gves useful nsghts on the ssue of PKI expanson. As more and more certfcates are added to the PKI to ncrease N, the number of queres per day,.e. q, s also expected to ncrease by the same factor. Ths s because the number of daly verfcatons of a certfcate (and hence the queres pertanng to t) s ndependent of N. q s also expected to ncrease lnearly wth N n the Rvest s model [Rv98] of Certfcate holder supples all valdty evdences to the verfer n whch, nstead of the verfer, the holder sends perodc queres to obtan recent valdty evdence for ts certfcate. Thus from (5), along wth q, P also ncreases lnearly wth N. Ths means that the optmal sze of (or the number of certfcates n) a partton,.e., n (=N/P ) remans unaltered as the PKI expands. Hence, no extra efforts are needed to mantan optmalty as the sze of the PKI changes. The above argument may not hold n some specalzed PKIs. It s stll possble to mantan optmalty n such systems by perodcally recomputng the optmal value of n and settng t as the partton sze for new parttons beng created. As certfcates expre, older parttons wll contnue to get removed from the system 3. Hence, the system forever keeps mgratng to the (currently) optmal value of the partton sze. 3 A partton wll be removed from the system when all the certfcates n t get expred. 8
9 4 Evaluaton and Comparson Followng the framework of CRS [Mc96] and CRT [NN98], we evaluate the cost of the proposed system called CSPR from hereon. The followng values of the parameters are assumed. N = , R = , q = , T = 365 U, L H = 160, L S = 1000, L SR = 30, L T = 20 The above values are mostly taken from [NN98]. The evaluatons are done for the values of D between 0 and 10,000 and U between 1 and 100. Observe the value of T, the number of tme slots. Snce we assume that a certfcate s ssued for one year; T s equal to the number of days n one year (365) multpled by the number of tme slots n one day (U). The comparson s done wth CRL, CRS and CRT. Before gong further, we compute the daly communcaton cost of each of these technques. Certfcate Revocaton Lsts Daly Cost. Average CRL Sze = R 2.L SR + L S ( ) ( ) R R Total Daly Cost = D.U 2.L SR + L S + q 2.L SR + L S (6) Certfcate Revocaton System Daly Cost. Total Daly Cost = D.U (N.L H ) + q.l H (7) Certfcate Revocaton Tree Daly Cost. CA to Drectory Communcaton per update conssts of the seral numbers of the certfcates revoked durng the prevous tme slot and the new sgnature on the root of the Merkle tree. Query response conssts of tree path node sblngs from the approprate leaf to the root along wth the root sgnature. Hence, we have: ( ) ( R Total Daly Cost = D.U T.L SR + L S + q L H log R ) 2 + L S (8) Table 1 summarzes the total daly system costs n bts for CRL, CRS and CRT usng (6), (7) and (8) respectvely and for CSPR usng (4) wth optmal number of parttons found usng (5). The values are computed for varous choces of D and U. The mprovement of CRS due to [ALO98] appears n parenthess. It should be stated here that ths mprovement comes at the cost of ncreasng the certfcate sze by 3.5 KB. Assumng one certfcate transmsson per revocaton status query, the ncrease n certfcate transmsson costs comes out to be bts per day (not added n the table). Table 2 lsts the optmal values of P and the correspondng n found usng (5). 9
10 CRL CRS CRT CSPR D = ( ) D = 10, U = ( ) D = 100, U = ( ) D = 100, U = ( ) D = 100, U = ( ) D = 1000, U = ( ) D = 10, 000, U = ( ) Table 1: Daly System Costs n Bts for Common Revocaton Technques Number of Parttons P Certfcates per partton n D = D = 10, U = D = 100, U = D = 100, U = D = 100, U = D = 1000, U = D = 10000, U = Table 2: Optmal Values of P and the correspondng n for varous values of D and U Remark 1. As demonstrated by the above values, CRS and CRT are the two extremes, CRS havng unbeatable query costs but havng CA to Drectory Communcaton as bottleneck and CRT havng unbeatable CA to Drectory Communcaton but havng query costs as the bottleneck. The proposed technque s able to balance the two costs by optmally choosng the number of parttons P and thus mnmzng the overall cost of the system. Hence, P s the key parameter for CSPR. Remark 2. The formula for the total cost of the system may be modfed by assgnng sutable weght to CDCC and QC. For example, n some low budget systems, CDCC may be assgned more weght to prevent CA from becomng the communcaton bottleneck, whle n others, QC may be assgned more weght to mprove the user experence. Accordngly, the formula for P s modfed (by takng the weght durng dfferentaton) and P s stll able to play the role of cost balancer between CDCC and QC. Remark 3. The computaton requred to valdate a certfcate status proof s smlar n CRL, CRT and CSPR (domnated by a sgnature verfcaton). For lower update rates, CRS has an advantage as t does not requre a sgnature verfcaton. However, as update rate ncreases, the computaton starts becomng comparable to others. Ths s because the average number of hash functon evaluatons requred for valdatng one certfcate status proof n CRS s 365 U/2. 10
11 Dstrbuton Degree and System Tmelness CRS CRT CSPR Centralzed system or a system havng very Sutable QC Hgh QC Hgh low dstrbuton degree Moderately low to moderately hgh tmelness CDCC Hgh QC Hgh Sutable or dstrbuton degree Very hgh tmelness or dstrbuton degree CDCC Hgh Sutable TC Hgh Table 3: Revocaton Technque Selecton Future Work. An nterestng observaton n the proposed system s that the parttons (wthout hash chans) may actually be treated as ordnary certfcates and our scheme may be recursvely appled. The noton of partton expry may be replaced wth the noton of partton revocaton. Level 2 parttons may be created whch wll contan the status of a number of level 1 (ordnary) parttons havng consecutve seral numbers. A Level 2 partton wll have hash chans as the renewal mechansm and wll expre as soon as any of the level 1 parttons n t expres (gets revoked). Smlarly, level 3 parttons and so on are possble, the extreme beng a tree of parttons of dfferent levels. The above approach may be worth explorng n envronments where the number of drectores or updates per day s hgh. Ths s because t may reduce the CA to drectory communcaton costs whch are qute hgh n such envronments, though at the prce of ncreasng the query costs. 5 Conclusons We conclude by summarzng the sutablty of varous revocaton schemes under dfferent values of D and U n Table 3. D s an ndcator of the dstrbuton degree of the system whle U s an ndcator of system tmelness. References [ALO98] [BF01] Wllam Aello, Sachn Lodha, and Rafal Ostrovsky. Fast dgtal dentty revocaton (extended abstract). In CRYPTO, pages , Dan Boneh and Matthew K. Frankln. Identtybased encrypton from the wel parng. In Joe Klan, edtor, CRYPTO, volume 2139 of Lecture Notes n Computer Scence, pages Sprnger, [BLL00] Ahto Buldas, Peeter Laud, and Helger Lpmaa. Accountable certfcate management usng undenable attestatons. In ACM Conference on Computer and Communcatons Securty, pages 9 17, [CJ02] Don Coppersmth and Markus Jakobsson. Almost optmal hash sequence traversal. In Fnancal Cryptography, pages ,
12 [DBW01] Gene Tsudk Dan Boneh, Xuhua Dng and Ch Mng Wong. A method for fast revocaton of publc key certfcates and securty capabltes. In The 10th USENIX Securty Symposum, pages , [Gen03] Crag Gentry. Certfcatebased encrypton and the certfcate revocaton problem. In El Bham, edtor, EUROCRYPT, volume 2656 of Lecture Notes n Computer Scence, pages Sprnger, [GGM00] Irene Gassko, Peter Gemmell, and Phlp D. MacKenze. Effcent and fresh cerfcaton. In Publc Key Cryptography, pages , [Goy04] Vpul Goyal. Certfcate revocaton lsts or onlne mechansms. In Eduardo FernándezMedna, Julo César Hernández Castro, and L. Javer GarcíaVllalba, edtors, WOSIS, pages INSTICC Press, [Jak02] M. Jakobsson. Fractal hash sequence representaton and traversal, ISIT 02; avalable at and [Koc98] Paul C. Kocher. On certfcate revocaton and valdaton. In Fnancal Cryptography, pages , [Mer89] Ralph C. Merkle. A certfed dgtal sgnature. In CRYPTO, pages , [Mc96] Slvo Mcal. Effcent certfcate revocaton. Techncal Report MIT/LCS/TM 542b, [Mc97] Slvo Mcal. Effcent certfcate revocaton. In Proceedngs 1997 RSA Data Securty Conference, [Mc02] [MJ00] [NN98] [OCSrg] Slvo Mcal. Novomodo: Scalable certfcate valdaton and smplfed pk management. In 1st Annual PKI Research Workshop  Proceedng, Patrck Drew McDanel and Sugh Jamn. Wndowed certfcate revocaton. In INFOCOM, pages , Mon Naor and Kobb Nssm. Certfcate revocaton and certfcate update. In Proceedngs 7th USENIX Securty Symposum (San Antono, Texas), Jan Onlne certfcate status protocol, verson 2. In Workng document of the Internet Engneerng Task Force (IETF), RFC 2560, Avalable from [Rv98] Ronald L. Rvest. Can we elmnate certfcate revocatons lsts? In Fnancal Cryptography, pages , [Sel03] [Stu95] Yaron Sella. On the computatonstorage tradeoffs of hash chan traversal. In Fnancal Cryptography, pages , Stuart Stubblebne. Recentsecure authentcaton: Enforcng revocaton n dstrbuted systems. In Proceedngs 1995 IEEE Symposum on Research n Securty and Prvacy, pages , May
13 [Zhe03] Pefang Zheng. Tradeoffs n certfcate revocaton schemes. Computer Communcaton Revew, 33(2): ,
The Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationA Secure PasswordAuthenticated Key Agreement Using Smart Cards
A Secure PasswordAuthentcated Key Agreement Usng Smart Cards Ka Chan 1, WenChung Kuo 2 and JnChou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationModule 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 informationAn 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 informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationbenefit 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 informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented 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 informationProactive 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 informationSimple 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 informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationLuby 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 informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationFault 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 information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationAN 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 informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More information1.1 The University may award Higher Doctorate degrees as specified from timetotime in UPR AS11 1.
HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher
More informationVembu 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 informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT09105, Phone: (3705) 2127472, Fax: (3705) 276 1380, Email: info@teltonika.
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths userfrendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationSecure Network Coding Over the Integers
Secure Network Codng Over the Integers Rosaro Gennaro Jonathan Katz Hugo Krawczyk Tal Rabn Abstract Network codng has receved sgnfcant attenton n the networkng communty for ts potental to ncrease throughput
More informationIT09  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 informationA 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 informationInstitute 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 informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy Scurve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy Scurve Regresson ChengWu Chen, Morrs H. L. Wang and TngYa Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationEE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN
EE201 Crcut Theory I 2015 Sprng Dr. Yılmaz KALKAN 1. Basc Concepts (Chapter 1 of Nlsson  3 Hrs.) Introducton, Current and Voltage, Power and Energy 2. Basc Laws (Chapter 2&3 of Nlsson  6 Hrs.) Voltage
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationEfficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ
Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst
More informationWatermarkbased Provable Data Possession for Multimedia File in Cloud Storage
Vol.48 (CIA 014), pp.103107 http://dx.do.org/10.1457/astl.014.48.18 Watermarbased Provable Data Possesson for Multmeda Fle n Cloud Storage Yongjun Ren 1,, Jang Xu 1,, Jn Wang 1,, Lmng Fang 3, JeongU
More information7.5. Present Value of an Annuity. Investigate
7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationTrafficlight a stress test for life insurance provisions
MEMORANDUM Date 006097 Authors Bengt von Bahr, Göran Ronge Traffclght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax
More informationMultiplePeriod Attribution: Residuals and Compounding
MultplePerod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc 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 informationHollinger 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 informationBERNSTEIN POLYNOMIALS
OnLne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationTo 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 informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationA 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 informationThursday, December 10, 2009 Noon  1:50 pm Faraday 143
1. ath 210 Fnte athematcs Chapter 5.2 and 4.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More information1. Math 210 Finite Mathematics
1. ath 210 Fnte athematcs Chapter 5.2 and 5.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210
More informationAn RFID Distance Bounding Protocol
An RFID Dstance Boundng Protocol Gerhard P. Hancke and Markus G. Kuhn May 22, 2006 An RFID Dstance Boundng Protocol p. 1 Dstance boundng Verfer d Prover Places an upper bound on physcal dstance Does not
More informationSection 5.3 Annuities, Future Value, and Sinking Funds
Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme
More informationJoe Pimbley, unpublished, 2005. Yield Curve Calculations
Joe Pmbley, unpublshed, 005. Yeld Curve Calculatons Background: Everythng s dscount factors Yeld curve calculatons nclude valuaton of forward rate agreements (FRAs), swaps, nterest rate optons, and forward
More informationAn MILP model for planning of batch plants operating in a campaignmode
An MILP model for plannng of batch plants operatng n a campagnmode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafeconcet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationConstruction Rules for Morningstar Canada Target Dividend Index SM
Constructon Rules for Mornngstar Canada Target Dvdend Index SM Mornngstar Methodology Paper October 2014 Verson 1.2 2014 Mornngstar, Inc. All rghts reserved. The nformaton n ths document s the property
More informationSmall 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 informationCalculation 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 twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationProceedings of the Annual Meeting of the American Statistical Association, August 59, 2001
Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 59, 2001 LISTASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James
More informationNew bounds in BalogSzemerédiGowers theorem
New bounds n BalogSzemerédGowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A
More informationSurvey 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 informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationSUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.
SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976761000
More informationUsing Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (5357) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng BüyükbakkalköyIstanbul
More informationFINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals
FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationNumber of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000
Problem Set 5 Solutons 1 MIT s consderng buldng a new car park near Kendall Square. o unversty funds are avalable (overhead rates are under pressure and the new faclty would have to pay for tself from
More informationA SECURE BILLING SERVICE WITH TWOFACTOR USER AUTHENTICATION IN WIRELESS SENSOR NETWORKS. Received March 2010; revised July 2010
Internatonal Journal of Innovatve Computng, Informaton and Control ICIC Internatonal c 2011 ISSN 13494198 Volume 7, Number 8, August 2011 pp. 4821 4831 A SECURE BILLING SERVICE WITH TWOFACTOR USER AUTHENTICATION
More informationMathematics of Finance
5 Mathematcs of Fnance 5.1 Smple and Compound Interest 5.2 Future Value of an Annuty 5.3 Present Value of an Annuty;Amortzaton Chapter 5 Revew Extended Applcaton:Tme, Money, and Polynomals Buyng a car
More informationLecture 7 March 20, 2002
MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng
More informationA 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 informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationgreatest common divisor
4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no
More informationConferencing protocols and Petri net analysis
Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre
More informationA 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):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationEfficient Dynamic Integrity Verification for Big Data Supporting Users Revocability
nformaton Artcle Effcent Dynamc Integrty Verfcaton for Bg Data Supportng Users Revocablty Xnpeng Zhang 1,2, *, Chunxang Xu 1, Xaojun Zhang 1, Tazong Gu 2, Zh Geng 2 and Guopng Lu 2 1 School of Computer
More informationA DISTRIBUTED REPUTATION MANAGEMENT SCHEME FOR MOBILE AGENT BASED APPLICATIONS
Bamasak & Zhang: A Dstrbuted Reputaton Management Scheme for Moble AgentBased Applcatons A DISTRIBUTED REPUTATION MANAGEMENT SCHEME FOR MOBILE AGENT BASED APPLICATIONS Omama Bamasak School of Computer
More informationA 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 informationOn Mean Squared Error of Hierarchical Estimator
S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta
More informationData Broadcast on a MultiSystem Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819840 (2008) Data Broadcast on a MultSystem Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationDiVA Digitala Vetenskapliga Arkivet
DVA Dgtala Vetenskaplga Arkvet http://umudvaportalorg Ths s a book chapter publshed n Hghperformance scentfc computng: algorthms and applcatons (ed Berry, MW; Gallvan, KA; Gallopoulos, E; Grama, A; Phlppe,
More informationInequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationPKIS: 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 HyunA
More informationTrivial 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 informationProvably Secure Single Signon Scheme in Distributed Systems and Networks
0 IEEE th Internatonal Conference on Trust, Securty and Prvacy n Computng and Communcatons Provably Secure Sngle Sgnon Scheme n Dstrbuted Systems and Networks Jangshan Yu, Guln Wang, and Y Mu Center for
More informationPolitecnico di Torino. Porto Institutional Repository
Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A costeffectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A costeffectve
More informationLearning the Best Kth Channel for QoS Provisioning in Cognitive Networks
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationAPPLICATION 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. Saedocho
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CACbased Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CACbased Dynamc Prcng Bader AlManthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More information+ + +   This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationAnswer: 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 MultpleChoce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multplechoce questons. For each queston, only one of the answers s correct.
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationDesign and Development of a Security Evaluation Platform Based on International Standards
Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 780 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, AlcatelLucent
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationIn our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is
Payout annutes: Start wth P dollars, e.g., P = 100, 000. Over a 30 year perod you receve equal payments of A dollars at the end of each month. The amount of money left n the account, the balance, earns
More informationCanon 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