《计算机网络安全双语chapter 3_3 key distribute》-公开·课件设计.pptVIP

A B CA CB B : get the public key of A Get CA Dauth公(CA)=IDA, Ka公 CA= Eauth私[IDA, Ka公] CB= Eauth私[IDB, Kb公] Key Distribution Protocol Needham-Schroeder Kerberos….. Needham-Schroeder KDC A ?? B. A will send a request to KDC to get the session key, Ks. 在话密钥的分配过程中，双方身份得以鉴别。 ① A?KDC：IDA‖IDB‖N1 ② A?KDC： EKA公[KS‖IDB‖N1‖EKB公(KS‖IDA)] ③ A→B：EKB公[KS‖IDA] ④ B→A：EKS[N2] ⑤ A→B：EKS[f(N2)] 总结 * * * * * * * * * * * * * * * * * * Key Distribution Establish a secure communication 两个阶段 密钥协商阶段 安全数据传输阶段(使用密钥，采用对称的加密算法进行加密) Key! Key Distribution How can we get the keys? Secret key distribution Public key distribution 1. Secret Key Distribution A and B can establish a secret key by: Manual delivery. Using a previous key to encrypt the new key. Selection and delivery by a trusted third party. Using public encryption method. Key Distribution Center (KDC) a trusted third party It is responsible for distributing keys. An example KDC A B Ka Kb Ks Ka, Kb are master keys, Ks is a session key KDC A B (1) Request|N1 (2) EKa [ Ks| Request|N1 |EKb(Ks, IDA)] (3) EKb [Ks, IDA] (4) EKs[N2] (5) EKs[f(N2)] Ka, Kb are master keys, Ks is a session key (1) A?KDC: Request|N1 KDC?A: EKa [ Ks| Request|N1 | EKb(Ks, IDA)] A?B: EKb(Ks, IDA) B?A: EKs[N2] A?B: EKs[f(N2)] Ticket! KDC A B Ka Kb Ks Authentication ? AB ? Confidentiality ? Using public encryption method 【假设】通讯各方已经获知对方的公钥信息 Simple Secret Key Distribution Vulnerable to an active attack A B (1) KA公|IDA (2) EA公[Ks] Improvement A B (1) EB公 [N1|IDA] (2) EA公[N1| N2] (3) EB公[N2] (4) EB私[EA公 (Ks)] 练习：请改进为通讯步骤最少的方案 A申请认证B的身份 (1) A?B: EPUB(N1|IDA)=C B: DPRB(C)= N1|IDA B向A确认自己是B，并且申请认证A (2) B?A: EPUA( N1| N2)=C’ A: DPRA(C’)= N1| N2  如果 N1(1)=N1(2)，那么A确认对方就是B A向B确认自己是A (3) EPRA(N2)=C’’ DPUA(C’’)=N2 如果 N2(2)=N2(3)，那么B确认对方就是A 协商会话密钥途径的总结 以上4种 DH exercise Three people want to establish a secure communication group. [要求] Authenticate each