臺灣博碩士論文加值系統

發行票劵對於市場的競爭及穩定客源來說，是常見的行銷工具，亦可有效的增加銷售量及消費者購買的便利性，然而，由於網際網路的成熟，隨之而起的電子商務以驚人的速度快速成長。例如：簡訊服務(SMS)、無線應用通訊協定(WAP)以及多媒體簡訊服務(MMS)等等，使得在目前電子商務的環境中，消費者藉由行動式裝置消費電子票劵的觀念已經慢慢的形成一種趨勢。
設若電子票劵系統能夠透過消費者的行動裝置接收電子票劵，消費者接收與使用電子票劵的方式，不只僅於網際網路，亦可透過簡訊服務(SMS)及藍芽技術傳送電子票劵至其他消費者或店家，再由票劵發佈者與電信業者確認此票劵，完成整個交易。在交易過程中，消費者將可全程的使用行動式裝置消費；因此，電子票劵系統所帶來的便利性，將可廣泛地應用於行動電子商務。然而，對於消費者使用行動式裝置消費電子票劵而言，行動式裝置處理器的計算能力就顯得相當重要。
目前大多數的電子票劵系統通常使用公開金鑰演算法，達到系統的安全需求；但是，公開金鑰演算法的計算成本是相當大的，比較不適合應用於行動裝置。在2000年有學者提出一些有後門赫序函數簽章方案，於消費者消費電子票劵的線上計算部分僅需一次的乘法運算。爲改善電子票劵的計算效益，在本論文中，我們結合有後門的赫序函數，提出一個新的且更有效率的行動式電子票劵系統，此電子票劵系統將可實際的應用於許多的電子商務環境之中，特別是使用電池為動力的行動裝置及即時應用。

E-coupon has become a common marketing tool for penetrating sales in competitive marketplace by retaining existing customers while providing convenient referencing for new purchases. Furthermore, owing to the maturity of e-commerce via SMS, WAP, and MMS, there is an increasing tendency for consumers to use E-coupon on their mobile devices.
If e-coupon system can send coupons to consumers’ mobile devices, and the consumer can receive and use such coupons not only on the Internet platforms, but also on the SMS and Bluetooth for the purchases as well as passing on the information to other consumers, and the final sales would be verified by the e-coupon system and the mobile phone operators, then the entire operation can be done via the consumers’ mobile devices solely. Thereby, the e-coupon can be further applied to the mobile e-commerce with better convenience. So, such an e-coupon system may play an important role in the mobile e-commerce, and correspondingly, the processing capability on consumers’ mobile device would become vital for adopting and utilization such e-coupon models.
At present, the most of electronic coupon system usual use public key algorithm, achieves system''s security requirements; however, the public key algorithm will not suitable for mobile device that the computation cost is quite great. In 2006, the researcher proposed some trapdoor hash functions signature schemes, the on-line computation only needs one operation of integer multiplication. In order to improve the computation cost of electronic coupon, in this paper, we propose a novel and efficient electronic coupon system with trapdoor hash functions, will be making it suitable for mobile environment and real-time application.

目錄
中 文 摘 要 I
ABSTRACT III
誌 謝 V
目錄 VI
表目錄 VIII
圖目錄 IX
第一章 緒論 1
1 電子票劵研究 1
1.1 前言 1
1.2 研究動機 1
1.3 研究目的 2
1.4 論文架構 2
第二章 相關知識與文獻探討 4
2.1 有後門赫序函數 (Trapdoor Hash Fuction) 4
2.2 無碰撞的單向赫序函數(Collision-free One Way Hash Function) 5
2.3 對稱式密碼系統 (Symmetric Cryptosystem) 5
2.4 非對稱式密碼系統 (Asymmetric Cryptosystem) 6
第三章 結合有後門赫序函數的電子票劵系統 8
3.1 前言 8
3.2 文獻回顧 9
3.2.1 2006-Chang等人協定參數符號 9
3.2.2 2006-Chang等人協定 10
3.3 我們設計的電子票劵系統 17
3.3.1 參數符號 18
3.3.2 電子票劵系統必要條件 19
3.3.3 電子票劵系統協定 20
3.3.4 討論安全性及實用性 25
第四章 結論 29
參考文獻 30
附錄A：作者簡介 32
附錄B：口試委員意見修正 33

表目錄
表1 RSA加密演算法 8
表2 效能分析表 27


圖目錄
圖1 對稱式密碼系統 6
圖2 非對稱式加解密系統 7
圖3 Chang電子票劵系統註冊階段 12
圖4 Chang電子票劵系統發佈階段 13
圖5 Chang電子票劵系統換回階段 15
圖6 Chang電子票劵系統轉移階段 16
圖7 電子票劵系統雛型 18
圖8 消費者註冊階段 21
圖9 電子票劵發佈階段 22
圖10 電子票劵換回階段 24
圖11電子票劵轉移階段 25

[1]C. C. Chang, C. C. Wu, and I. C. Lin, “A Secure E-coupon System for Mobile Users,” IJCSNS International Journal of Computer Science and Network Security, Vol. 6, No. 1, January, pp. 273-280, 2006.
[2]A. Shamir and Y. Tauman, “Improved online / offline signature schemes,” Advances in Cryptology-CRYPTO’01, LNCS 2139, pp. 355-367, 2001.
[3]H. Krawczyk and T. Rabin, “Chameleon signatures,” Symposium on Network and Distributed Systems Security (NDSS’00), pp. 143-154, 2000.
[4]F. Y. Yang, S. H. Chiu, and C. M. Liao, “Trapdoor Hash Functions with Efficient Online Computations,” The Proceedings of Multimedia and Networking Systems Conference 2006 (MNSC 2006), Kaohsiung Cuty, Taiwan, Session G1, 2006.
[5]F. Y. Yang, “Efficient trapdoor hash function for digital signatures,” Chaoyang Journal, Vol. 12, pp. 351-357, 2007.
[6]F. Y. Yang, “Improvement on a trapdoor hash Function,”International Journal of Network Security, Vol. 8, pp. 317-321, 2009.
[7]T. Okamoto, M. Tada and A. Miyaji, “Efficient ‘on the fly’ signature schemes based on integer factoring,” Proceedings of the 2nd International Conference on Cryptology in India, INDOCRYPT’01, LNCS 2247, pp. 275-286, 2001.
[8]K. Geoffrey, “Performance Analysis of AES candidates on the 6805 CPU core,” Second AES Candidate Conference (AES2),1999.
[9]R. Rivest, “The MD5 Message Digest Algoritm,” RFC 1321, 1992.
[10]NIST FIPS PUB 180, “Secure Hash Standard,” National Institute of Standards and Technology, U.S. Department of Commerce, DRAFT, 1993.
[11]W. Stallings, Cryptography and Network Security: Principles and Practice. Prentice Hall International, Inc., third edition, 2003.
[12]NIST FIPS PUB 197, “Announcing the ADVANCED ENCRYPTION STANDARD (AES),” National Institute of Standards and Technology, U.S. Department of Commerce, November, 2001.
[13]NIST FIPS PUB 46-3, “Data Encryption Standard (DES),” National Institute of Standards and Technology, U.S. Department of Commerce, October, 1999.
[14]X. Lai and J. Massey, “A Proposal for a New Block Encryption Standard,” Advances in Cryptology: Proceedings of EUROCRYPT ''90, Springer-Verlag, 1990, pp. 389-404.
[15]J. Dacmen and V. Rijmen, “AES Proposal: Rijndael,” AES Algorithm Submission, September, 1999.
[16]NIST FIPS PUB 197, “Announcing the ADVANCED ENCRYPTION STANDARD (AES),” National Institute of Standards and Technology, U.S. Department of Commerce, November, 2001.
[17]W.B. Lee, C.C. Wu, and W.J. Tsaur, “A novel deniable authentication protocol using generalized ElGamal signature scheme” Information Science, Vol. 177, No. 6, March, 2007, pp. 1376-1381.
[18]T. ElGamal, “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” Advances in Cryptology: Procedings of CRYPOTO ''84, Springer-Verlag, 1984, pp. 10-18.
[19]W. Stallings, Cryptography and Network Security: Principles and Practice. Prentice Hall International, Inc., third edition, 2003.