Full metadata record
DC FieldValueLanguage
dc.contributor.author穆罕默德en_US
dc.contributor.author羅濟群en_US
dc.contributor.author陳耀宗en_US
dc.date.accessioned2014-12-12T01:24:15Z-
dc.date.available2014-12-12T01:24:15Z-
dc.date.issued2009en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT079455863en_US
dc.identifier.urihttp://hdl.handle.net/11536/40938-
dc.description.abstractWith the rapid development of internet-based applications which are using open communications key agreements and user authentications become the most important security services for successful internet based commerce. A key agreement protocol is a fundamental building block of cryptography to establish a common secret key over public network. The design of a secure and efficient protocol is far from being a simple task, many protocols have been proposed to be secure in a heuristic argument model or a formal security model thereafter many have been broken. Nevertheless, a formal security proof may concrete a security of the designed new protocol. However, this research shows man in the middle attacks, key compromise impersonation resilience attacks, perfect forward secrecy resilience attacks on Pour public key distribution system, a new approach for key controlled agreement and an efficient & confirmed protocol for authenticated key agreement, and the later two attacks on an improved elliptic curve Diffie-Hellman key agreement protocol. In addition, it shows perfect forward secrecy resilience attacks on the unified model protocol and key compromise impersonation resilience attacks on KEA+ as the modified key exchange authentication protocol. Moreover, it shows that Lim et al.’s protocol as a secure and efficient three-pass authenticated key agreement protocol based on elliptic curves is vulnerable to leakage of responder’s static private key by malicious party. To eliminate the pointed out security leaks, this study further proposes a new two-pass authenticated key agreement with key confirmation protocol. The proposed protocol has the following security properties: (i) it is proved to be secure against above attacks, stronger adversary attacks and provide the desirable security properties as a three-pass authenticated key agreement protocol. (ii) It can provide entity authentication and assurance for key reception in an indirect way. (iii) It can withstand denial of service attacks. Furthermore, this research also proposes a derivation one-pass protocol from the proposed two-pass protocol to fit a one-way communication channel, which is suitable for mobile stations and electronic business transactions. The security and the computational complexities of the proposed two protocols outperform those of previously related proposed protocols. This research proposed a robust Diffie-Hellman based authenticated key agreement protocol without using a trick of NAXOS which has a tight security reduction proof in eCK model under gap Diffie-Hellman and random oracle assumptions and overcomes the security flaws in the existing those protocols based on MQV key agreement. In addition, the proposed protocol is an efficient protocol due to the total computation cost is 2.5 exponentiations only. Furthermore, it enhances an improved elliptic curve Diffie-Hellman key agreement protocol to overcome its security flaws, and this research shows that the proposed protocol is a secure against stronger adversary in a heuristic argument approach. Remedy to the security flaws in Lim et al.’s, this study proposed a new efficient and secure three-pass authenticated key agreement protocol elliptic curves based. The proposed three-pass protocol has the following security properties: (i) it is proved to be a secure against the attacks on Lim et al.’s protocol, stronger adversary attacks. (ii) It can provide an assurance of the identity authentication of its partner, thus it can withstand non-repudiation attacks. (iii) It can withstand denial of service attacks. The security and the computational complexities of the proposed three-pass protocol outperform that of Lim et al.’s protocol.zh_TW
dc.description.abstractWith the rapid development of internet-based applications which are using open communications key agreements and user authentications become the most important security services for successful internet based commerce. A key agreement protocol is a fundamental building block of cryptography to establish a common secret key over public network. The design of a secure and efficient protocol is far from being a simple task, many protocols have been proposed to be secure in a heuristic argument model or a formal security model thereafter many have been broken. Nevertheless, a formal security proof may concrete a security of the designed new protocol. However, this research shows man in the middle attacks, key compromise impersonation resilience attacks, perfect forward secrecy resilience attacks on Pour public key distribution system, a new approach for key controlled agreement and an efficient & confirmed protocol for authenticated key agreement, and the later two attacks on an improved elliptic curve Diffie-Hellman key agreement protocol. In addition, it shows perfect forward secrecy resilience attacks on the unified model protocol and key compromise impersonation resilience attacks on KEA+ as the modified key exchange authentication protocol. Moreover, it shows that Lim et al.’s protocol as a secure and efficient three-pass authenticated key agreement protocol based on elliptic curves is vulnerable to leakage of responder’s static private key by malicious party. To eliminate the pointed out security leaks, this study further proposes a new two-pass authenticated key agreement with key confirmation protocol. The proposed protocol has the following security properties: (i) it is proved to be secure against above attacks, stronger adversary attacks and provide the desirable security properties as a three-pass authenticated key agreement protocol. (ii) It can provide entity authentication and assurance for key reception in an indirect way. (iii) It can withstand denial of service attacks. Furthermore, this research also proposes a derivation one-pass protocol from the proposed two-pass protocol to fit a one-way communication channel, which is suitable for mobile stations and electronic business transactions. The security and the computational complexities of the proposed two protocols outperform those of previously related proposed protocols. This research proposed a robust Diffie-Hellman based authenticated key agreement protocol without using a trick of NAXOS which has a tight security reduction proof in eCK model under gap Diffie-Hellman and random oracle assumptions and overcomes the security flaws in the existing those protocols based on MQV key agreement. In addition, the proposed protocol is an efficient protocol due to the total computation cost is 2.5 exponentiations only. Furthermore, it enhances an improved elliptic curve Diffie-Hellman key agreement protocol to overcome its security flaws, and this research shows that the proposed protocol is a secure against stronger adversary in a heuristic argument approach. Remedy to the security flaws in Lim et al.’s, this study proposed a new efficient and secure three-pass authenticated key agreement protocol elliptic curves based. The proposed three-pass protocol has the following security properties: (i) it is proved to be a secure against the attacks on Lim et al.’s protocol, stronger adversary attacks. (ii) It can provide an assurance of the identity authentication of its partner, thus it can withstand non-repudiation attacks. (iii) It can withstand denial of service attacks. The security and the computational complexities of the proposed three-pass protocol outperform that of Lim et al.’s protocol.en_US
dc.language.isoen_USen_US
dc.subjectCryptanalysiszh_TW
dc.subjectCryptographyzh_TW
dc.subjectdenial of service attackszh_TW
dc.subjectDiffie-Hellmanzh_TW
dc.subjectelliptic curve cryptosystemzh_TW
dc.subjectkey agreementzh_TW
dc.subjectkey compromise impersonation resiliencezh_TW
dc.subjectman-in-the-middle attackszh_TW
dc.subjectnon-repudiation attackszh_TW
dc.subjectperfect forward secrecy resiliencezh_TW
dc.subjectstatic private key leakagezh_TW
dc.subjectextended Canetti-Krawczykzh_TW
dc.subjectCryptanalysisen_US
dc.subjectCryptographyen_US
dc.subjectdenial of service attacksen_US
dc.subjectDiffie-Hellmanen_US
dc.subjectelliptic curve cryptosystemen_US
dc.subjectkey agreementen_US
dc.subjectkey compromise impersonation resilienceen_US
dc.subjectman-in-the-middle attacksen_US
dc.subjectnon-repudiation attacksen_US
dc.subjectperfect forward secrecy resilienceen_US
dc.subjectstatic private key leakageen_US
dc.subjectextended Canetti-Krawczyken_US
dc.title金鑰一致性協定與安全模組之密碼分析與改善zh_TW
dc.titleCryptanalysis and Enhancement of Authenticated Key Agreement Protocols and Their Security Modelsen_US
dc.typeThesisen_US
dc.contributor.department資訊管理研究所zh_TW
Appears in Collections:Thesis