臺灣博碩士論文加值系統

近年來，網際網路被普遍應用在生活上各領域。如眾所週知地，目前已有許多深具實用價值的商業應用成功例證，例如網路上的訊息分享、金鑰交換、使用者認證、電子付款及電子簽章等等機制。
手寫簽名長久以來一直應用在對於文件效力的確認工作上，而在網際網路上時興的許多商業交易中，電子簽章的使用可說是提供了與傳統簽章相同的效力，並成為最廣為接受的工具，電子簽章可說是簽章在網路世界的數位版，而在目前已經研發出的電子簽章機制中，對於代理簽章機制的研究，被認為是頗具潛力的研究領域，更廣受注目。代理簽章機制准許一個代理者代理一位原始簽章者進行簽章工作，在我們的研究中，我們提出一些新的代理簽章機制。
本論文提出了植基於身分碼之代理簽章機制，並提出了不可否認之代理簽章機制，對於以上二種代理簽章機制，本研究同時進行安全性分析，而透過我們的研究分析，我們深信在本論文中所提出的簽章機制具備安全性與可行性，並可為後續研究中之不同代理簽章機制如何進行實際應用時之基礎。

Today, the overarching internet is used broadly in business of very wide range. At present, there are many kinds of successful applications to provide business implementations over the internet such as secret sharing, key exchange, user authentication, electronic payments, and digital signature.
Hand-written signatures have long been used as proof of authorship of the contents of a document. During the contemporary business transaction on the internet, Digital signature is one of the most popular methods used to provide the same benefit as the conventional signature in some degree. A digital signature is the electronic analog of a handwritten signature. Among the variant digital signature scheme, there is one kind of signature scheme, so-called proxy signature scheme, has been recognized as a popular research area and receives great attention in recent years. It allows a proxy signer to sign on behalf of an original signer. The proxy signature schemes play an important role in the practical applications. In our research, we attempt to develop new kinds of proxy signature schemes.
In the thesis, A new proxy signature scheme, called the ID-Based proxy signature, will be proposed based on the concept of the ID-Based method and the conventional proxy signature scheme. Besides, we also demonstrate some kinds of undeniable proxy signature scheme. According to our security analysis described in the thesis, we conclude that all of the proposed proxy signature schemes can be proved secure and feasible for in practical applications.

Table of Contents
Chapter 1 INTRODUCTION………………………………………………………1
1.1 Research Background………………………………………………..…….3
1.2 Research Motivation……..……………………………………..………….4
1.3 Research Purpose…………………..………………………………………6
1.4 Research Scope…………………………..……………..………………….8
1.5 Research Procedure………………………………....…………………… 9
1.6 Thesis Framework………………………………………..……………….12
Chapter 2 LITERATURE REVIEW…………………………………..………..…13
2.1 ID-BASED Signature Scheme………………………………..………...14
2.1.1 Other ID-Based digital Signature Scheme……………………17
2.2 ElGamal Signature Scheme……..……….………………………………21
2.3 Undeniable Signature Schemes…………………………………………22
2.4 The Proxy Signatures and its weakness..…..………………….………27
2.5 Nominative signature scheme……….……………..…..….………….35
2.6 Non-interactive Zero-knowledge proof on the undeniable signature…………………………………………….…..…..…………….37
Chapter 3 ID-BASED PROXY SIGNATURE SCHEMES…….……..…..…39
3.1 ID-based proxy signature scheme…………………………….……...39
3.2 Security considerations …………………………………………...41
Chapter 4 UNDENIABLE PROXY SIGNATURE SCHEMES…….…….…44
4.1 Undeniable proxy signature scheme I……………………………...45
4.1.1 Descriptions of the scheme………………………………………45
4.1.1 Security considerations…………………………………………49
4.2 Undeniable proxy signature scheme II……………………………...50
4.2.1 Descriptions of the scheme………………………………………50
4.2.1 Security considerations…………………………………………52
4.3 Undeniable proxy signature scheme III……………………………...53
4.2.1 Descriptions of the scheme………………………………………53
4.2.2 Security considerations…………………………………………56
4.1 Non-interactive Zero-knowledge proving protocol……………...57
Chapter 5 DISCUSSIONS AND CONCLUSIONS……………..………..…60
Bibliography

〔Bibliography〕
[1]W. Diffie and M. E. Hellman"New directions in Cryptography ," IEEE Transaction on Information Theory, Vol. IT-22, No. 6, pp. 664-654 (1976).
[2]T. ElGamal "A public-key Cryptosystem and a Signature Scheme based on Discrete Logarithms," IEEE Transaction on Information Theory Science, Vol. IT-31, No. 4, pp. 469-472 (1985).
[3]Nechvatal and James "Public Key Cryptography," in Contemporary Cryptology: The Science of Information Integrity, Simmons, G. J. ED., IEEE Press, Piscataway, N. J, pp. 177-288(1991).
[4]Nechvatal and James "ID-Based Cryptographic Schemes for User Identification, Digital Signature, and Key Distribution," in Contemporary Cryptology: The Science of Information Integrity, Simmons, G. J. ED., IEEE Press, Piscataway, N. J, pp. 177-288(1991).
[5]Lein Harn and Shoubao Yang "Public Key Cryptography," IEEE Journal on Selected Area Communications, VOL. 11, NO. 5. JUNE 1993, pp. 757-760(1992).
[6]Tzong-chen Wu and Ru-Lan Su "ID-Based group-oriented cryptosystem and its Digital Signature," in Computer and Communications, 20, pp. 1019-1026. (1997)
[7]S. Tsujii , T. Itoh, "An ID-Based cryptosystem based on the discrete logarithm problem," IEEE Journal on Selected Areas of in Communications, Vol.7 , No. 4, pp. 467-473(1989).
[8]R.C. Merkle , M.E. Hellman, "Hiding information and signature in trapdoor knapsack ," IEEE Transaction on information Theory, IT-24（5）, pp.525-530 (1978).
[9]Wei-Bin Lee and Chin-Chen Chan, "Three ID-based information security functions," Computer Communications, （20）, pp.1301-1307(1997).
[10]W. –H. He and T. –C. Wu., "Cryptanalysis of Lee and Chang’s ID-based information security functions," Computer Communications, （22）, pp.723-726(1999).
[11]U.M. Maurer, Y. Yacobi, "A non-interactive public-key distribution system," Design, Codes Cryptography , 9（3）, pp.305-316. (1996)
[12]Yuh-Min Tseng, Jinn-Ke Jan, "ID-Based Cryptographic Schemes using a Non-interactive public-key distribution system," Computer Security Applications Conference, 1998. Proceedings. 14th Annual, pp. 237-243(1998).
[13]U.M. Maurer, Y. Yacobi," Non-interactive public-key cryptography," in Proc. Eurocrypt’91, pp.498-507 (1992).
[14]U.M. Maurer, Y. Yacobi, (1996) "A remark on a non-interactive public-key distribution system," in Proc. Eurocrypt’92, pp.548-460.
[15]U.M. Maurer, Y. Yacobi, "A remark on a non-interactive public-key distribution system," in Proc. Eurocrypt’92, pp.548-460 (1996).
[16]D. Chaum and H. van Antwerpen, "Undeniable signature," in Proc. Crypt’89, pp.212-216 (1989).
[17]D. Chaum, "Zero-knowledge undeniable signature," LNCS 473, Proc. Eurocrypt’90, Springer Verlag, pp.548-460 (1990).
[18]Sung Jun Park, Tae Hoon Kim, Dong Ho Won, " A Provably Entrusted Undeniable Signature," the International Conference on Information Engineering., Proceedings of IEEE Singapore International Conference, pp.644-648 (1995).
[19]T. Okamoto and K. Ohta, " How to utilizes the randomness of zero-knowledge proofs," in Proc. Crypt’90, pp.456-475 (1990).
[20]S. C. Pohlig and M. E. Hellman, " An improvement aigorithm for computing logarithms in GF(p) and its Cryptographic Significance," IEEE transactions on Information Theory Vol.24, No.1, pp.106-111(1978).
[21]J. Boyar, D. Chaum I. Damgard, T. Petersen, "Convertible Undeniable signature," in LNCS 537, Advances in cryptology: Proc. Crypt’89, Springer Verlag, pp.212-216 (1991).
[22]M. Mambo, K. Usuda and E. Okmaoto, "Proxy signatures：Delegation of the power to sign messages," in IEICE, Trans. Fundementals, VOL.E79-A, No.9, pp.1338-1354 (1996).
[23]M. Mambo, K. Usuda and E. Okmaoto, "Proxy signatures for delegating signing operation, " in Proc. Third ACM Conf. On Computer and Communications Security, pp. 48-57(1996).
[24]K. Usuda, M. Mambo, T. Uyematsu, and E. Okmaoto, "Proposal of an automatic signature scheme using a compiler," in IEICE, Trans. Fundementals, VOL.E79-A, No.9, pp.94-101 (1996).
[25]Kim S., Park S., and Won D., "Proxy signatures, revisited," in ICICS’97, Lecture Notes in Computer Science 1334, Springer Verlag, pp.223-232. (1997)
[26]V. Varadharajan, P. Allen, and S. Black, "An analysis of the proxy problem in distributed systems," in IEEE Computer Society Symposium on research in Security and Privacy, pp.255-275 (1991).
[27]B.C. Neuman, "Proxy-based authorization and accounting for distributed systems," in Proc. 13th International Conference on Distributed Computing Systems, pp.283-291 (1993).
[28]Markus Michels, Markus Stadler "Efficient Convertible Undeniable Signature," in Proc. 4th International Workshop on selected Areas in Cryptography (SAC’97), pp.231-244 (1997).
[29] M.O. Rabin, "Digitalized Signatures and Public Key Functions as Intractable as factorization," MIT/LCS/TR-212. (1979)
[30] Tzong-Chen Wu, Shu-Lin Chou, Tzong-Sun Wu, "Two ID-based multisignature protocols for sequential and broadcast architectures," Computer Communications (19), pp.851-856 (1996).
[31] Narn-Yih Lee, Tzonelih Hwang, Chih-Hung Wang, "the security of Two ID-based multisignature protocols for sequential and broadcast architectures," Information Processing Letters (70) , pp.79-81. (1979)
[32] Yuh-Shihng Chang, Tzong-Chen Wu, Shih-Chan Huang, "ElGamal-like digital signature and multisignature schemes using self-certified public keys," The Journal of Systems and software (50) , pp.99-105 (2000).
[33] J. L. Chen and T. Hwang, "Identity-based conference key broadcast schemes with authentication," Computers and Security, (13), pp.99-105(1994).
[34] D. Chaum, "Zero-knowledge undeniable signatures," Advanced in Cryptography: Proceeding of Eurocrypt ’90, pp.458-464 (1990).
[35] Seungjoo Kim, Sungjun Park and Dongho Wo, "Zero-knowledge Nominative Signatures," Proc. Of Pragocrypt’96, International Conference on the Theory and Applications of Cryptology, pp.380-392 (1996).
[36] L. Harn, "New Digital Signature Based on Discrete Logarithm," Electronics Letters, Vol. 30, No. 5, pp. 396-398(1996).
[37] L. Harn, "Public-Key Cryptosystem Design Based on Factoring and Discrete Logarithms," IEE Proc.-Computers and Digital Techniques, Vol. 142, No. 3, pp. 193-195(1994).
[38] L. Harn, "Comment: Enhancing of the Security of ElGarmal's Signature Scheme," IEE Proc.-Computers and Digital Techniques, Vol. 142, No. 5, pp. 376(1995).
[39] K. Nyberg, and R. Rueppel, "Message Recovery for Signature Schemes Base on the Discrete Logarithm Problem," Proceedings of Eurocrypt '94, pp. 175-190(1994).
[40] K. Nyberg, "Comments: New Digital Signature Scheme Based on Discrete Logarithm," Electronics Letters, Vol. 30, No. 6, pp. 481(1994).
[41] S. M. Yen, C. S. Laih, "New Digital Signature Scheme Based on Discrete Logarithm," Electronics Letters, Vol. 28, No. 12, pp. 1120-1121(1993).
[42] Hung Min Sun, Bin-Tsan Hsieh, "Remark on two Nonrepudiable Proxy Signature Schemes," Proceeding of the Ninth National Conference on Information Security, Taiwan, pp. 241-246(1999).
[43] Schnorr, C.P., "Efficient identification and signatures for smart cards, " Advances in Cryptology, CRYPT’89, Springer-Verlag, Berlin, pp.239-252 (1989).
[44] Yuh-Min Tseng, Jinn-Ke Jan, "A novel ID-Based group signature, " Information Sciences, pp. 131-141(1999).
[45] Girault, M., "Self-certified public keys, " Advances in Cryptology, Eurocrypt’91, Springer-Verlag, Berlin, pp. 491-497(1991).
[46] Ivan Damgard, Torben Pedersen " New Convertible Undeniable Signature Schemes" Advances in Cryptology, Eurocrypt’96, Proceedings, LNCS, pp. 372-385 (1996).
[47] Hung Min Sun, "On Proxy (multi-) Signature Schemes," Proceeding of ISC2000, Taiwan, pp. 172-179 (2000).
[48] H. Petersen and P. Horster, "Self-certified keys-concepts and applications," Proc. 3. Conf. On Communications and Multimedia Security, September 22-23,(1997).
[49] Sung-Ming Yen, Chung-Pei Hung, and Yi-Yuan Lee, “Remark on some proxy Signature Schemes," Proceeding of ISC2000, Taiwan, pp. 202-207 (2000).
[50] B. A. LaMacchia and A. M. Odlyzko, "Computation of discrete logarithms in Prime Fields,” Available at <http://www.research .att.com/~amo>(1990).
[51] Andrew Odlyzko, "Discrete logarithms：the past and the future,". Available at <http://www.research .att.com/~amo>(1999).