身分驗證協定的安全性分析之研究

A Study of Security Analysis to Some Authentication Protocols

顏佑如(Yuo-Ju Yen)

指導教授 ： 張雅芬

國立臺中科技大學/資訊與流通學院/資訊工程系碩士班/碩士(2014年)

https://doi.org/10.6826/NUTC.2014.00044

摘要

網際網路技術改變人類的生活，越來越多的使用者趨向透過網際網路來分享或是獲得所需的服務。然而，網際網路是一個開放且不安全的通訊媒介，因此，如何確認通訊方的身分便為一個重要的議題。公開金鑰技術提供了解決一個確認通訊方身分的方法。傳統的公開金鑰密碼系統需核發每位使用者憑證，以利使用者證明其確實為聲稱公鑰的擁有者並知道相對應的私密金鑰。但當要使用特定使用者之公開金鑰進行加密或是進行簽章驗證，皆需透過驗證憑證以確認公開金鑰之有效性。此驗證憑證的步驟是相當惱人的，故後來便有以使用者辨別號為公開金鑰的公開金鑰密碼系統被提出，藉此改進可免除驗證憑證的動作。
在2012年，Xue和Hong兩位學者提出一個基於混沌系統匿名性驗證的密鑰協商方法，並宣稱他們所提出的方法可使使用者有匿名性。但經過深入分析後，發現他們的方法不能確保使用者的匿名性。次年，Shim等學者改進兩個以辨別號為公開金鑰之簽章方法以提出一個適用於無線感測網路的廣播身分驗證方法，並宣稱他們所提出的方法是符合所有的安全要求。然而，仔細研讀他們的論文以後，發現他們的方法是無法正常運作的。因為這個致命的缺點，使得沒有訊息可以成功地被廣播。因此，本研究針對此一缺失進行修正，確保修正後的方法在資料傳輸時可以正常運作。

關鍵字

身分驗證 ； 混沌系統 ； 匿名性 ； 通訊 ； 資訊安全

並列摘要

Internet technologies change human life. More and more users tend to share or obtain required resources through the Internet. However, the Internet is an open but insecure communication channel. Therefore, how to authenticate the other communication party becomes an important issue. Public-key cryptography provides a solution to ensure who the communication party is. Conventional public-key cryptosystems need to issue each user a certificate to prove that he/she is indeed the owner of the claimed public key and knows the corresponding private key. However, before a user’s public key is used for encryption or verification, the certificate needs to be verified to prove that the public is valid. This places a heavy burden on users. As a result, identity-based public-key cryptosystems are proposed.
In 2012, Xue and Hong proposed an anonymous authentication scheme with key agreement based on chaotic maps. After analyzing Xue and Hong’s scheme thoroughly, we find that their scheme cannot ensure user anonymity as claimed. We will show this found security flaw which Xue and Hong’s scheme from in Chapter 2. Next year, Shim et al. improved two identity-based signature schemes to propose an identity-based broadcast authentication scheme to meet security requirements in wireless sensor networks. However, after analyzing their scheme, it is found that their scheme cannot work at all. Their scheme suffers from one fatal flaw such that no message can be verified successfully to be broadcasted. In this study, the found flaw that Shim et al.’s scheme is also fixed to make sure the modified scheme works well.

並列關鍵字

authentication ； chaotic map ； anonymous ； communication ； security

參考文獻

[3] Hess, F., “Efficient Identity Based Signature Schemes Based on Pairings,” Selected Areas in Cryptography – SAC’2002, Springer-Verlag, LNCS 2595, pp. 310-324, 2003.

[4] Cha, J. C. and Choen, J. H., “An Identity-based Signature from Gap Diffie-Hellman Groups,” PKC 2003, Springer-Verlag, LNCS 2567, pp. 18-30, 2003.

[5] Yi, X., “An Identity-based Signature Scheme from the Weil Pairing,” IEEE Communications Letters, Vol. 7, No. 2, pp. 76-78, 2003.

[6] Wang, R. C., Juang, W. S., and Lei, C. L., “Provably Secure and Efficient Identification and Key Agreement Protocol with User Anonymity,” Journal of Computer and System Sciences, Vol. 77, No. 4, pp. 790-798, Jul. 2011.

[7] Malone-Lee, J., “Identity Based Signcryption,” Cryptology ePrint Archive Report2002-098, 2002.