English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52514/87720 (60%)
Visitors : 9371404      Online Users : 477
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/74598

    Title: Non-interactive fair deniable authentication protocols with indistinguishable confidentiality and anonymity
    Other Titles: 可提供不可區分安全性與匿名性之非互動式公平可否認驗證協定
    Authors: 紀仁富;Chi, Jen-Fu
    Contributors: 淡江大學資訊工程學系碩士班
    黃心嘉;Hwang, Shin-Jia
    Keywords: 可否認驗證協定;機密性;匿名性;公平保護;deniable authentication protocol;confidentiality;Anonymity;fair protections
    Date: 2011
    Issue Date: 2011-12-28 19:00:23 (UTC+8)
    Abstract: 許多提供匿名性的可否認驗證協定都假設收送雙方事先已互相知道對方身份為基礎;而且為了防止傳送訊息洩露身份隱私,Hwang和Sung進一步提出第一個提供機密性、匿名性與公平保護的非互動式可否認驗證協定。然而,因為匿名的特性,使得事先已互相知道對方身份的假設並不實際。另一方面,Hwang和Sung所提出的協定中的機密性,其安全層級只達到IND-CPA。為了移除不實際的假設,並且提高機密性的安全層級至IND-CCA2,我們提出了可提供不可區分安全性與匿名性之非互動式公平可否認驗證協定。
    Many non-interactive deniable authentication protocols with anonymity are proposed by assuming that the sender and receiver know each other in advance. To protect the transmitted sensitive identity data, Hwang and Sung proposed the first non-interactive deniable authentication protocol with message confidentiality, anonymity and fair protections. But the underlying assumption of those protocols with anonymity is impractical for the anonymity property. Moreover, the message confidentiality of Hwang and Sung’s protocol is only indistinguishably secure against chosen plaintext attacks. To remove the inappropriate assumption, our non-interactive fair deniable authentication protocol with indistinguishable message confidentiality against adaptive chosen ciphertext attacks and anonymity is proposed.
    On Shao’s non-interactive deniable authentication protocol, Wu et al. proposed a forgery attack by assuming that the used session secrets are leaked out. They also proposed their improvement. However, two forgery attacks are proposed to show that Wu et al.’s protocol also suffers the forgery attack based on the same assumption. Moreover, the assumption is too strong.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback