淡江大學覺生紀念圖書館 (TKU Library)
進階搜尋


下載電子全文限經由淡江IP使用) 
系統識別號 U0002-2006201116523200
中文論文名稱 可提供不可區分安全性與匿名性之非互動式公平可否認驗證協定
英文論文名稱 Non-interactive Fair Deniable Authentication Protocols with Indistinguishable Confidentiality and Anonymity
校院名稱 淡江大學
系所名稱(中) 資訊工程學系碩士班
系所名稱(英) Department of Computer Science and Information Engineering
學年度 99
學期 2
出版年 100
研究生中文姓名 紀仁富
研究生英文姓名 Jen-Fu Chi
學號 698410528
學位類別 碩士
語文別 英文
口試日期 2011-06-14
論文頁數 43頁
口試委員 指導教授-黃心嘉
委員-顏嵩銘
委員-黃心嘉
委員-黃仁俊
中文關鍵字 可否認驗證協定  機密性  匿名性  公平保護 
英文關鍵字 deniable authentication protocol  confidentiality  anonymity  fair protections 
學科別分類 學科別應用科學資訊工程
中文摘要 許多提供匿名性的可否認驗證協定都假設收送雙方事先已互相知道對方身份為基礎;而且為了防止傳送訊息洩露身份隱私,Hwang和Sung進一步提出第一個提供機密性、匿名性與公平保護的非互動式可否認驗證協定。然而,因為匿名的特性,使得事先已互相知道對方身份的假設並不實際。另一方面,Hwang和Sung所提出的協定中的機密性,其安全層級只達到IND-CPA。為了移除不實際的假設,並且提高機密性的安全層級至IND-CCA2,我們提出了可提供不可區分安全性與匿名性之非互動式公平可否認驗證協定。
此外針對Shao學者的非互動式可否認驗證協定,在假設過去秘密驗證金鑰洩露時,Wu等學者指出Shao學者的協定會遭受偽造攻擊,並提出了改良的協定。然而,在相同的假設前提下,本論文提出了針對Wu等學者所提出的改良協定的兩種偽造攻擊。因此Wu等學者的改良協定並不安全,且該假設也過強。
英文摘要 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.
論文目次 Table of Content
Chapter 1 Introduction 1
Chapter 2 Related Works 4
2.1 Schnorr Signature Scheme and Its Promise 4
2.2 Non-interactive Designated Verifier Proof Scheme 5
2.3 Our Security Assumption 6
Chapter 3 Our Non-interactive Fair Deniable Authentication Protocols with Indistinguishable Confidentiality and Anonymity 7
3.1 Our FDAP-ICA 7
3.2 Security Proofs and Analysis 11
3.3 Performance Analysis and Discussions 28
Chapter 4 Comments on Wu et al.’s Efficient Deniable Authentication Protocol 31
4.1 Brief Review of Wu et al.’s Forgery Attack and Improved Protocol 31
4.2 Our Attacks on Wu et al.’s Deniable Authentication Protocol 33
4.3 Discussions and Future Research 34
Chapter 5 Conclusions 36
References 37
Appendix A 40

List of Tables
Table 3.1: Security Property Comparison 29
Table 3.2: Performance Comparison 30
參考文獻 [1] C. Dwork, M. Naor, and A. Sahai, “Concurrent Zero-Knowledge,” Proc. of 30th ACM STOC’ 98, Dallas TX, USA, 1998, pp. 409-418.
[2] Y. Aumann and M. Rabin, “Efficient Deniable Authentication of Long Messages,” Presented at International Conference on Theoretical Computer Science in Honor of Professor Manuel Blum’s 60th birthday, 1998. [Online] Available: http://www.cs.cityu.edu.hk/dept/video.html.
[3] X. Deng, C.-H. Lee, and H. Zhu, “Deniable Authentication Protocols,” IEE Proceeding-Computers and Digital Techniques, Vol. 148, No.2, pp. 101-104, 2001.
[4] L. Fan, C.-X. Xu, and J.-H. Li, “Deniable Authentication Protocol Based on Diffie-Hellman Algorithm,” Electronics Letters, Vol.38, No.4, pp. 705-706, 2002.
[5] M. Naor, “Deniable Ring Authentication,” Advances in Cryptology — CRYPTO'02, LNCS 2442, London: Springer-Verlag, 2002, pp. 481-498.
[6] Z. Shao, “Efficient Deniable Authentication Protocol Based on Generalized ElGamal Signature Scheme,” Computer Standards and Interfaces, Vol. 26, pp. 449-454, 2004.
[7] W.-B. Lee, C.-C. Wu, and W.-J. Tsaur, “A Novel Deniable Authentication Protocol Using Generalized ElGamal Signature Scheme,” Information Sciences, Vol. 177, pp.1376-1381, 2007.
[8] B. Wang and Z.-X. Song, “A Non-Interactive Deniable Authentication Scheme Based on Designated Verifier Proofs,” Information Sciences, Vol. 179, pp. 858-865, 2009.
[9] T. Wu, W.-J. Zhang, Z.-H. Liu, and C.-X. Mu, “An Efficient Deniable Authentication Protocol,” Management and Service Science, Wuhan, China, pp. 1-4, 2009.
[10] S.-J. Hwang and J.-C. Ma, “Deniable Authentication Protocols with Sender Protection,” in 2007 National Computer Symposium (NCS 2007), Wufeng, Taiwan, 2007, pp. 762-767.
[11] S.-J. Hwang and J.-C. Ma, “Deniable Authentication Protocols with (Anonymous) Sender Protection,” in 2008 International Computer Symposium (ICS 2008), Tamsui, Taiwan, 2008, pp. 412-419.
[12] S.-J. Hwang and C.-H. Chao, “An Efficient Non-Interactive Deniable Authentication Protocol with Anonymous Sender Protection,” in Cryptology and Information Security Conference, Taipei City, Taiwan, R.O.C., 2009.
[13] S.-J. Hwang and C.-H. Chao, “Deniable Authentication Protocols with Anonymous Fair Protections,” in Cryptology and Information Security Conference 2010, Hsinchu, Taiwan, R.O.C., 2010.
[14] R.-X. Lu, X.-D. Lin, Z.-F. Cao, L.-Q. Qin, and X.-H. Liang, “A Simple Deniable Authentication Protocol Based on the Diffie-Hellman Algorithm,” International Journal of Computer Mathematics, Vol. 85, Issue 9, pp. 1315-1323, 2008.
[15] E.-J. Yoon and K.-Y. Yoo, “Secure Deniable Authentication Protocol Based on ElGamal Cryptography,” Networks, Vol. 45, pp. 193-194, 2005.
[16] S.-J. Hwang and Y.-H. Sung, “Confidential Deniable Authentication Using Promised Signcryption,” to appear in Journal of Systems and Software.
[17] Y. Zheng, “Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(encryption),” Advances in Cryptology — CRYPTO'97, LNCS 1294, New York: Springer-Verlag, 1997, pp. 165-179.
[18] K. Nguyen, “Asymmetric Concurrent Signatures,” in Proceedings of Information and Communications Security Conference (ICICS 2005), LNCS 3783, New York: Springer Verlag, 2005, pp. 181-193.
[19] Caroline J. Kudla, “Special Signature Scheme and Key Agreement Protocols,” Ph.D. dissertation, Royal Holloway, University of London, Egham, Surrey, England, 2006.
[20] Y.-H. Sung, “Deniable Authentication Protocols with Confidentiality, Anonymity, and Senders’ and Receivers’ Protections,” M.S. thesis, University of Tamkang, Taipei country, Taiwan R.O.C., 2010.
[21] C. P. Schnorr, “Efficient Identification and Signatures for Smart Cards,” Advances in Cryptology: Proceedings of CRYPTO’ 89, LNCS 435, G. Brassard, Ed., New York: Springer Verlag, 1990, pp. 239-252.
[22] W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, Vol. 22, Issue 6, pp. 644-654, Nov. 1976.
[23] D. Pointcheval and J. Stern, “Security Arguments for Digital Signatures and Blind Signatures*,” Journal of Cryptology, Vol. 13, Issue 3, pp.361-396, 2000.
[24] D. Chaum and H. van Antwerpen, “Undeniable Signatures,” Advances in Cryptology: Proceedings of CRYPTO’ 89, LNCS 435, G. Brassard, Ed., New York: Springer Verlag, 1990, pp. 212-216.
[25] G. Ateniese, “Efficient Verifiable Encryption (and Fair Exchange) of Digital Signature,” in Proc. of ACM Conference on Computer and Communications Security (CCS’ 99), ACM Press, New York, U.S.A., 1999, pp. 138-146.
論文使用權限
  • 同意紙本無償授權給館內讀者為學術之目的重製使用,於2012-07-27公開。
  • 同意授權瀏覽/列印電子全文服務,於2012-07-27起公開。


  • 若您有任何疑問,請與我們聯絡!
    圖書館: 請來電 (02)2621-5656 轉 2281 或 來信