| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊管理學系 | zh_TW |
| DC.creator | 莊友豪 | zh_TW |
| DC.creator | Yu-hao Chuang | en_US |
| dc.date.accessioned | 2012-11-23T07:39:07Z | |
| dc.date.available | 2012-11-23T07:39:07Z | |
| dc.date.issued | 2012 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=954403004 | |
| dc.contributor.department | 資訊管理學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 隨著資訊科技不斷進步，網路應用之快速發展下，個人隱私權的安全防護儼然成為在開放式的網路通訊媒介下必須思考且重視的議題。傳統的終端使用者與主機的身分鑑別機制已不符現今安全的需求，無法確保使用者在身分鑑別的過程中，個人私密資料不會外洩，或被惡意的服務終端管理者盜用做為額外商業用途。因此，本論文將提出安全且具可否認的身分鑑別協定機制，使其達到：
1. 使用者可以向特定驗證者提出身分證明的正確性、合法性。
2. 驗證者無法將使用者的身分資料向第三者提出證明，即使提出相關證明文件，第三者仍不會相信。
同時為了滿足現今的公開金鑰基礎建設環境，本論文提出下列二種可否認的身分鑑別協定機制：1) 植基於解離散對數的可否認鑑別協定，此協定能與目前實務上多數的溝通協定相結合，降低建置成本；2) 植基於橢圓曲線計算的可否認鑑別協定，此協定僅需較低的計算量，適合資源有限的行動裝置設備。
公開金鑰基礎建設環境下，使用者持有的公開金鑰須透過憑證中心所發行的憑證驗證其正確性、合法性。為了克服此缺點，本論文進一步提出自我驗證公開金鑰系統下的可否認身分鑑別協定機制，藉由自我驗證公開金鑰系統演算法，使用者不需再額外的憑證來驗證公開金鑰的正確性、合法性，以節省計算與傳送成本；同時，自我驗證公開金鑰系統相對於公開金鑰系統，更能提供較佳的安全防護。因此，本論文根據自我驗證公開金鑰系統的架構提出二種可否認身分鑑別協定機制，分別是：1) 植基於解離散對數的可否認鑑別協定；2) 植基於橢圓曲線計算的可否認鑑別協定。
本論文提出的四種可否認身分鑑別協定機制，皆能滿足以下安全需求：1) 身分鑑別；2) 可否認性。同時，本論文提出的可否認身分鑑別協定皆為非交互溝通機制，與先前研究學者提出的方法比較，具有較佳的執行效率。實務方面，本論文透過實驗設計法對社交網路使用者的行為意圖進行分析，結果顯示安全、可靠的使用者身分登入鑑別機制會增進使用者對於網站的信任度，進而正面影響使用者的使用意圖。因此本論文將提出的可否認鑑別協定應用於社交網路服務架構，藉由提供更安全、可靠的使用者身分登入鑑別機制，使社交網路服務使用者的隱私權獲得更完善的防護，進而增進使用者的使用意圖。
| zh_TW |
| dc.description.abstract | Since the information technology continues to grow and the network applications are getting popular, protecting the privacy of Internet users on the open network becomes a necessary concern. The traditional authentication protocol is not suitable for the requirements of internet security nowadays. That is, it cannot assure that the private information not be revealed during the authentication operation, or be used by malicious terminal service managers for their personal gain in some other business opportunities. Hence, in this dissertation, we propose secure and deniable authentication protocols to fulfill the following security requirements.
1. Each user can prove his/her legitimacy to the designated verifier.
2. The designated verifier cannot prove the identity of the user to the third party even though the verifier provides the testimonials.
In the dissertation, we first propose two types of deniable authentication protocols to satisfy the security requirements of the current public key infrastructure (PKI). The first is based on discrete logarithm problem (DLP), which is suitable to be integrated with the most current communication protocols and the advantage of setting costs reduction; the second is based on elliptic curve cryptography (ECC), which is suitable for the mobile devices since it only needs limited computation resources.
However, in PKI, all public keys for users need the certificates to be issued from the certification authority (CA) to assure the validity and legitimacy of the public keys. To overcome this complexity, we further propose another variant of the deniable authentication protocol based on self-certified public key systems. In such a protocol, it needs no extra certificates to validate the validity and legitimacy of public keys so that to reduce computational complexities and communicational costs. In addition, such self-certified-based protocols can provide superior security protections than certificated-based protocols in PKI. Accordingly, two types of deniable authentication protocols with self-certified public key systems are proposed: DLP-based deniable authentication protocol and ECC-based deniable authentication protocol.
All proposed deniable authentication protocols can not only satisfy the security requirements of user authentication and deniability, but also achieve performance efficiency since they are non-interactive. In practice, using a randomized control group pretest-posttest experimental design, we analyze the user’s behavior in social network services (SNSs). Our tests demonstrate that high security and reliability mechanisms of user’s authentication during logging on online systems will enhance the trust of user toward using the website which positively impact the user’s intention of using the website. In this dissertation, we apply the proposed deniable authentication protocols in SNSs to provide high security and reliability requirements of user’s authentication during logging on online systems. With that, the user who can obtain individual privacy protections impeccably when he logins the systems of SNSs and further enhance his intention toward using the social websites.
| en_US |
| DC.subject | 可否認的身分鑑別 | zh_TW |
| DC.subject | 隱私權 | zh_TW |
| DC.subject | 公開金鑰基礎建設 | zh_TW |
| DC.subject | 行動裝置 | zh_TW |
| DC.subject | 自我驗證公開金鑰系統 | zh_TW |
| DC.subject | 離散對數 | zh_TW |
| DC.subject | 橢圓曲線 | zh_TW |
| DC.subject | 實驗設計法 | zh_TW |
| DC.subject | 使用意圖 | zh_TW |
| DC.subject | 信任 | zh_TW |
| DC.subject | 社交網路 | zh_TW |
| DC.subject | deniable authentication protocol | en_US |
| DC.subject | privacy | en_US |
| DC.subject | public key infrastructure | en_US |
| DC.subject | mobile device | en_US |
| DC.subject | self-certified public key system | en_US |
| DC.subject | discrete logarithm problem | en_US |
| DC.subject | elliptic curve cryptography | en_US |
| DC.subject | experimental design | en_US |
| DC.subject | user intention | en_US |
| DC.subject | trust | en_US |
| DC.subject | social network services | en_US |
| DC.title | 適用於多種設備的可否認鑑別協定之設計 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Design of Deniable Authentication Protocols for Multiple Device Types | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |