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


下載電子全文限經由淡江IP使用) 
系統識別號 U0002-3105201016241300
中文論文名稱 具機密性、匿名性與收送方保護之可否認驗證協定
英文論文名稱 Deniable Authentication Protocols with Confidentiality, Anonymity, and Senders’ and Receivers’ Protections
校院名稱 淡江大學
系所名稱(中) 資訊工程學系碩士班
系所名稱(英) Department of Computer Science and Information Engineering
學年度 98
學期 2
出版年 99
研究生中文姓名 宋昀豪
研究生英文姓名 Yun-Hao Sung
電子信箱 697411758@s97.tku.edu.tw
學號 697411758
學位類別 碩士
語文別 英文
口試日期 2010-05-31
論文頁數 46頁
口試委員 指導教授-黃心嘉
委員-顏嵩銘
委員-黃仁俊
委員-黃心嘉
中文關鍵字 可否認認證協定  簽密法  允諾簽章  匿名性  機密性  隱私權 
英文關鍵字 Deniable authentication protocols  signcryption  promise of digital signatures  anonymity  intended receivers  confidentiality 
學科別分類 學科別應用科學資訊工程
中文摘要 近年Hwang和Chao提出具匿名公平保護功能之互動式可否認認證協定,用於保護資料收送雙方的權益,然而他們的協定中對資料並無提供機密性保護,並採互動式設計,而影響協定整體的效能。一般而言,在傳輸效能上,非互動式協定較互動式協定有效率,但目前非互動式可否認驗證協定尚未對資料提供機密性保護,因此傳輸的資料有可能造成雙方權益的損失,進而對其他安全特性造成危害。為了有效地提供傳輸資料的機密性與可否認性,本論文首先提出第一套允諾簽密法;並藉由允諾簽密法的幫助,提出兩套具機密性、匿名性與收(送)方保護之非互動式可否認驗證協定。更重要的是,我們的第二套協定是目前第一套具機密性、匿名性與公平保護之非互動式可否認驗證協定。
英文摘要 Hwang and Chao’s deniable authentication protocols with anonymous fair protection are proposed to protect senders’ and receivers’ benefit recently. However, their protocols do not provide confidentiality property and adopts interactive communication. In general, non-interactive deniable authentication protocols are more efficient than interactive ones by reducing the communication cost. Nevertheless, no non-interactive deniable authentication protocols are proposed to provide confidentiality. Without confidentiality, the transferring data may damage sender’s and receiver’s benefit, and even threaten with some announced security properties. To efficiently provide confidentiality and deniability at the same time, the first promised signcryption scheme is proposed. With the help of the promised signcryption scheme, our two non-interactive deniable authentication protocols with confidentiality, anonymity, and senders’ (and receiver’s) protection are proposed. Moreover, our second protocol is the first non-interactive deniable authentication protocols with confidentiality, anonymity, and fair protection is proposed.
論文目次 Table of Content
Chapter 1 Introduction..................................1
Chapter 2 Review........................................4
2.1 Schnorr Signature Scheme and Its Promise............4
2.2 Non-interactive Designated Verifier Proof Scheme....5
2.3 Underlying Hard Problems............................6
Chapter 3 Our Deniable Authentication Protocols with Confidentiality and Anonymous Signer Protections........8
3.1 Promised Signcryption Scheme........................8
3.2 Our Non-interactive DAP-CASP.......................10
3.3 Security Proof and Analysis........................10
3.3.1 Security Analysis of Our Promised Signcryption Scheme.................................................11
3.3.2 Security Analysis of Our DAP-CASP................17
3.4 Performance Analysis and Discussions...............21
Chapter 4 Our Deniable Authentication Protocols with Confidentiality and Anonymous Fair Protections.........23
4.1 Our DAP-CAFP.......................................23
4.2 Security Proof and Analysis........................27
4.3 Comparison and Discussions.........................39
Chapter 5 Conclusions..................................43
References.............................................44

List of Tables
Table 3.1: Security Comparison of Deniable Authentication Protocols..............................................22
Table 4.1: Security Property Comparison of DAP-AFP.....40
Table 4.2: Performance Comparison between Hwang and Chao’s DAP-AFP, and Our Protocols.............................42

參考文獻 [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, 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] Z. Shao, “Efficient Deniable Authentication Protocol Based on Generalized ElGamal Signature Scheme,” Computer Standards and Interfaces, Vol. 26, pp. 449-454, 2004.
[6] W. B. Lee, C. C. Wu, W. J. Tsaur, “A Novel Deniable Authentication Protocol Using Generalized ElGamal Signature Scheme,” Information Sciences, Vol. 177, pp.1376-1381, 2007.
[7] 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.
[8] 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.
[9] 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.
[10] 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.
[11] 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.
[12] 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.
[13] E. J. Yoon and K. Y. Yoo, “Secure Deniable Authentication Protocol Based on ElGamal Cryptography,” Networks, Vol. 45, pp. 193-194, 2005.
[14] Caroline J. Kudla, “Special Signature Scheme and Key Agreement Protocols,” Ph.D. dissertation, Royal Holloway, University of London, Egham, Surrey, England, 2006.
[15] 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.
[16] 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.
[17] 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.
[18] W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, Vol. 22, Issue 6, pp. 644-654, Nov. 1976.
[19] C. Schnorr, “Efficient Signature Generation by Smart Cards,” Journal of cryptology, Vol. 4, Issue 3, pp.161-174, 1991.
[20] Douglas R. Stinson, “Signature Schemes” in Cryptography: Theory and Practice, 1st ed. CRC Press, Inc, 1995, pp.218-224.
[21] 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-06-08公開。
  • 同意授權瀏覽/列印電子全文服務,於2012-06-08起公開。


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