臺灣博碩士論文加值系統

在許多已提出的多人代理簽章，是建立於離散對數問題，本文希望結合離散對數問題與因數分解問題的方式，加強多人代理簽章的安全性（離散對數與因式分解均是計算上難解的問題）。
在執行多人代理簽章時，需考慮到代理人異動的狀況，代理人有可能離職、生病、死亡等情形，本文期望以Rabin的方法來改善多人代理簽章成員的增刪問

Most of proposed multi-proxy signature schemes based on discrete logarithm. In this paper, we hope to combine discrete logarithm with factorization, that strengthen the security of multi-proxy.　Both of discrete logarithm and factorization are the hard problem of computational complexity.
In execution of multi-proxy signature, we have to think over the problem of proxy change, for example quit job, sickness, or death. Then, in the paper, we hope to improve multi-proxy signature scheme for the problem of proxyies append and delete by Rabin’s scheme.

目 錄i
第壹章 緒論1
第一節 研究動機3
第二節 研究目的5
第三節 定義7
第四節 論文結構12
第貳章 文獻探討13
第一節 El Gamal Signature Scheme13
第二節 Digital Signature Algorithm19
第三節 代理簽章21
第參章 研究方法24
第一節 研究架構24
第二節 理論基礎24
第三節　研究設計與使用工具26
第四節　研究限制28
第肆章 多人代理簽章成員的增刪30
第一節 多人代理簽章30
第二節 多人代理簽章成員的增加34
第三節　多人代理簽章成員的刪除35
第伍章 結論37
參考文獻38
圖 次
圖1-1： 秘密金鑰密碼系統圖10
圖1-2： 公開金鑰密碼系統圖11

參考文獻
[行政2061] 八十八年十二月二十三日行政院第二O六一次院會審議通過。
[潘潘95] 潘承洞、潘承彪：初等數論，新竹：凡異，1995。
[許吳98] 許建隆、吳宗成：「簽章加密法（signcryption）及其應用」，資訊安全通訊，第四卷第二期，1998年3月，頁23-29。
[賴韓張98] 賴溪松、韓亮、張真誠：近代密碼學及其應用，台北：松崗，1998。
[AMV90] G. B. Agnew，R. C. Mullin and S. A. Vanstone：”Improved digital signature scheme based on discrete exponentiation”，Electronic Letter，1990，26，（14），pp.1024-1025.
[Ara93] Arazi, B.：”Integrating a key distribution procedure into the digital signature standard”，Electronics Letters，vol. 29，no. 11，May 1993，pp. 966-967.
[Cop84] Don Coppersmith：”Fast evaluation of logarithm in fields of characteristic two”，IEEE Transactions on Information Theory，vol. IT-30，no. 4，July 1984，pp. 587-594.
[CSH01] Bing-Chang Chen, Hung-Ming Sun, and Tzonelih Hwang：”An improved group scheme using proxy provers”， Proceedings of the 11th National Conference on Information Security, May 2001, pp.55-59.
[DH76] Whitfield Diffie and Martin E. Hellman：”New directions in cryptography”，IEEE Transactions on Information Theory，vol. IT-22，no. 6，November 1976，pp. 644-654.
[ElG85] Taher El Gamal：”A public key cryptosystem and a signature scheme based on discrete logarithms”，IEEE Transactions on Information Theory，vol. IT-31，no. 4， July 1985，pp. 469-472.
[ElG851] Taher El Gamal：”A subexponential-time algorithm for computing discrete logarithms over GF（p2）”，IEEE Transactions on Information Theory，vol. IT-31，no. 4， July 1985，pp. 473-481.
[GOS941] GOST R 34.10-94, Gosudarstvennyi Standard of Russian Federation, “Information technology. Cryptographic Data Security. Produce and check procedures of Electronic Digital Signature based on Asymetric Cryptographic Algorithm.” Government Committee of the Russia for Standards, 1994.
[GOS941] GOST R 34.11-94, Gosudarstvennyi Standard of Russian federation, “Information technology. Cryptographic Data Security. Hashing function.” Government committee of the Russian for Standards, 1994.
[Har94] L. Harn：”Public-key cryptosystem design based on factoring and discrete logarithms”，IEE Proc.-Comput. Digit. Tech., vol. 141, no. 3, May 1994, pp. 193-195.
[Har941] L. Harn：”New digital signature scheme based on discrete logarithm”，Electronics Letters，vol. 30，no. 5，March 1994，pp. 396-398.
[Har942] L. Harn：”Group-oriented （t,n） threshold digital signature scheme and digital multisignature”, IEEE Proceeding of Computers Digital Technique, vol. 141, No. 5, 1994, pp. 307-313.
[Har95] L. Harn：”DSA type secure interactive batch verification protocols”，Electronics Letters，vol. 31，no. 4，February 1995，pp. 257-258.
[HK94] J. He and T. Kiesier：”Enhancing the security of El Gamal’s signature scheme”，IEE Proc-Comput. Digit. Tech., vol. 141, no. 4, July 1994, pp. 249-252.
[HS99] Sin-Jia Hwang and Chi-Hwai Shi：” The specifiable proxy signature”, National Computer Symposium 1999, vol. 3, Taiwan Dec. 1999, pp. 190-197.
[HS00] Sin-Jia Hwang and Chi-Hwai Shi：”A simple multi-proxy signature scheme”, Proceedings of the Tenth National Conference on Information Security, May 2000, pp.134-138.
[HX94] L. Harn and Y. Xu：”Design of generalised El Gamal type digital signature schemes based on discrete logarithm”，Electronics Letters，vol. 30，no. 24，November 1994，pp. 2025-2026.
[Lee99] N. Y. Lee：”Security of Shao’s signature schemes based on factoring and discrete logarithms”, IEE Proc.-Comput. Tech., vol. 146, no. 2, Mar 1999, pp. 119-121.
[LH96] N. Y. Lee and T. Hwang：”Modified Harn signature scheme based on factorising and discrete logarithms”，IEE Proc.-Comput. Digit. Tech., vol. 143, no. 3, May 1996, pp. 196-198.
[LHW98] Narn-Yih Lee, Tzonelih Hwang and Chih Hung Wang：”On Zhang’s nonrepudiable proxy signature schemes”, Third Autstralasian Conference, ACISP ’98, 1998, .pp. 415-422.
[LL94] C. H. Lim and P. J. Lee：”Security of interactive DSA batch verification”，Electronics Letters，vol. 30，no. 19，September 1994，pp. 1592-1593.
[LW99] T.-Y. Lin and T.-C. Wu：”（t,n） threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems”, IEE Proc.-Comput. Tech., vol. 146, no. 5, Sep. 1999, pp. 264-268.
[KPW97] S. Kim, S. Park and D. Won：”Proxy signatures”, ICICS ’97, Lecture Notes in Computer Sicence, vol. 1334, Springer, Berlin, 1997, pp.223-232.
[MH78] Ralph C. Merkle and Martin E. Hellman：”Hiding information and signatures in trapdoor knapsacks”，IEEE Transactions on Information Theory，vol. IT-24，no. 5，September 1978，pp. 525-530.
[MUO96] Masahiro Mambo, K. Usuda and E. Okamoto：”Proxy signature: Delegation of the prower to sign messages’, IEICE Trans. Fundam., 1996, E79-A, （9）, pp. 1338-1354.
[MUO961] Masahiro Mambo, K. Usuda and E. Okamoto：”Proxy signatures for delegating signing operation”, Proc 3rd ACM Conference on Computer and Communicatons Security , ACM press, 1996, pp. 48-57.
[NBS77] NBS FIPS PUB 46, “Data Encryption Standard”, National Bureau of Standards, U. S. Department of Commerce, Jan. 1977.
[NBS88] NBS FIPS PUB 46-1, “Data Encryption Standard”, National Bureau of Standards, U. S. Department of Commerce, Jan. 1988.
[Neu93] B. C. Neuman：”Proxy-based authorization and accounting for distributed systems”, Proc. of the 13th Interantional Conference on Distributed Computing Systems, May 1993, pp. 283-291.
[Nic99] Randall K. Nichols：ICSA guide to cryptography，New York: McGraw-Hill，1999.
[NIS92] NIST，”The digital signature standard proposed by NIST”，Communication of the ACM，vol. 35，no. 7，July 1992，pp. 36-40.
[NIS921] “Responses to NIST’s proposal”，Communication of the ACM，vol. 35，no. 7，July 1992，pp. 41-54.
[PH78] Stephen C. Pohlig and Martin E. Hellman：”An improved algorithm computing logarithms over GF（p） and its cryptographic significance”，IEEE Transactions on Information Theory，vol. IT-24，no. 1，January 1978，pp. 106-110.
[RSA78] R. L. Rivest, A. Shamir and L. Adleman：”A method for obtaining digital signatures and public key cryptosystems”，Communication of the ACM，vol. 21，no. 2， February 1978，pp. 120-126.
[Sch91] C. P. Schnorr：”Efficient signature generation by smart cards”，Journal of Cryptography，no. 4，1991，pp. 167-171.
[Sch96] Bruce Schneier：Applied cryptography，New York: John Wiley & Sons，1996.
[Sha84] Adi Shamir：”A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem”，IEEE Transactions on Information Theory，vol. IT-30，no. 5，September 1984，pp. 699-704.
[SLH99] H. —M. Sun, N. —Y. Lee and T. Hwang：”Threshold proxy signatures”, IEE Proc.-Computers & Digital Techniques, vol. 146, no. 5, Sep., 1999, pp. 259-263.
[Sta99] William Stallings：Cryptography and network security，New Jersey: Prentice-Hall，1999.
[VAB91] V. Varadharajan, P. Allen and S. Black：”An analysis of the proxy problem in distributed systems”, Proc. 1991 IEEE Computer Society Symposium on Research in Security and Privacy, May 1991, pp.255-275.
[WC01] Chih-Hung Wang and Yan-Cheng Chen：”Limiting verifiers in designated confirmer signatures”， Proceedings of the 11th National Conference on Information Security, May 2001, pp.67-73.
[Zha97] K. Zhang：”Threshold proxy signature schemes”, 1997 Information Security Workshop, Sep., 1997, Japan, pp. 191-197.