包海海不才 Denning方法 105 ●Denning81 1.A→KDC:IDa‖DB 2.KDC→A:EKa[Ks II IDB IT‖lEk[KSIlDAlIT可] 3.A-B:EKb[Ks DAIT] 4.B→A:Eks[N] 5.A→B:Eks[f(N] A and B verify timeliness by |Clock-T<△t1+△t2 At,:time difference between KDC and local ones, △t2:network delay 评 2022/10/9 现代密码学理论与实践-13 15/472022/10/9 现代密码学理论与实践-13 15/47 Denning方法 ⚫ Denning 81 1. A→KDC: IDA || IDB 2. KDC→A: EKa[Ks || IDB ||T|| EKb[Ks||IDA ||T] ] 3. A→B: EKb[Ks ||IDA ||T] 4. B→A: EKs[N1 ] 5. A→B: EKs[f(N1 )] A and B verify timeliness by |Clock – T| < Δt1 + Δt2 Δt1 : time difference between KDC and local ones, Δt2 : network delay