Ould perform the following measures to prove him/herself to AS

Матеріал з HistoryPedia
Версія від 16:46, 27 грудня 2017, створена Grease8canoe (обговореннявнесок) (Створена сторінка: The authentication of 1-RAAP.On getting the service request message M M1 , firstfirst checksvalidity of theof thestampstamp On receiving the service request mes...)

(різн.) ← Попередня версія • Поточна версія (різн.) • Новіша версія → (різн.)
Перейти до: навігація, пошук

The authentication of 1-RAAP.On getting the service request message M M1 , firstfirst checksvalidity of theof thestampstamp On receiving the service request message 1 , AS AS checks the the validity time time tc and ?* then computes IndU " IndU ?AS R and s R and searches the the user's index Ind user's index tc and then computes IndU s IndU searches the database with database with the U and verifies AS purchase AZD1775 regardless of whether the equation vP ` hU ? R holds, here h " H ptc , R ` Uq. Therefore, the amount of pairing operations is actually a important functionality metric. It truly is conveniently observed that our scheme is substantially simplified and may obtain larger efficiency as a complete.Sensors 2016, 16,six ofTable 1. Comparison of computational complexity.Ould perform the following measures to prove him/herself to AS when she/he The acquire user need to execute the following measures to prove the protocol AS when must WBAN relevant info, shown as Figure three. Otherwise,him/herself toterminates she/he must get relevant information and facts, shown as Figure 3. Otherwise, the protocol instantly. terminates promptly. * * Pick r Zq randomly and compute R rP and IndU IndU rPK AS . ?, Choose r P Zq randomly and compute R " rP and Ind?" IndU ` rPK AS . Choose up the existing time tc and compute h H tcU R U . , , Pick up the existing time tc and compute h " H ptc , R ` Uq. , Compute v " rr?ssUhk Compute v U hk ( , Send a service request message M1 " R , vv,t tc , IndU towards the AS. Send a service request message M R, , , Ind * ?towards the AS.cU* r Z q R rP* IndU IndU rPK ASh H tC , R Uv r s U hk* M1 R , v , tC , IndU* IndU IndU sAS Rh H (tC , R U ) ? vP hU RK H ( IndU ||tC , R U )M 2 MAC K ( h)K H ( IndU ||tC , R U ) MFigure 3. The authentication of 1-RAAP. Figure 3. The authentication of 1-RAAP.On receiving the service request message M M1 , firstfirst checksvalidity of theof thestampstamp On receiving the service request message 1 , AS AS checks the the validity time time tc and ?* then computes IndU " IndU ?AS R and s R and searches the the user's index Ind user's index tc and after that computes IndU s IndU searches the database with database together with the U and verifies AS whether or not the equation vP ` hU ? R holds, here h " H ptc , R ` Uq. When the equation holds, we contemplate Ind and verifies regardless of whether the will perform hU ? R methods: thatUthe user is reputable. The ASequation vP the followingholds, right here h H tc , R U . In the event the equation holds, we take into account that the user is legitimate. The AS will execute the following measures: ` Compute the session important: crucial " H IndU tc , R ` U . Compute title= s40037-015-0222-8 M2 " MACkey phq.AS sends M2 for the user. Upon receiving the response message M2 , the user computes the session important. Then, the user checks the integrity from the message authentication code by the session key. In the event the outcome is negative, the user quits the existing session.