臺灣博碩士論文加值系統

由於網路與通訊技術的成熟，使得電子商務蓬勃發展，一些與電子商務相關的服務也相繼出現，例如線上購物、線上競標與線上博奕。博奕有各種的型式，例如樂透彩券、運動彩券與撲克牌競賽等。在本篇論文中，我們會注重在電子彩券方面的設計。由於彩券需要具備一些特殊的性質像是公平性與匿名性，因此電子彩券的設計有其困難度。而電子彩券的交易機制也是一個很重要的議題。在大多數的文獻中討論到如何在一個彩券系統中產生隨機的中獎號碼，但卻只有少數的文獻有提到在買彩票與兌換獎金時，如何去確保交易的公平性與消費者的匿名性，然而其公平性與匿名性可能有所瑕疵。在本論文中，我們會提出具有交易公平性與消費者完美匿名性的電子彩券協定。

Due to the mature of networks and communication technologies, electronic commerce is growing up rapidly and many advanced applications in electronic commerce are developed recently, such as on-line shopping, on-line bidding, and on-line gambling. There are numerous types of gambling like typical lottery, sport lottery, and poker gambling where our research will focus on the lottery games. Because of some special characteristics of the lottery games such as fairness and anonymity, it is hard to design a perfect electronic lottery protocol. The transaction mechanism in an electronic lottery protocol is an important issue since it will affect the benefits of customers if it is not fair or secure. The generating of random winning numbers in a lottery game has been discussed in many papers, but the fairness and anonymity for purchasing tickets and claiming the prizes are only discussed in few papers where these previous results cannot completely cope with the problems of fairness and anonymity. In the thesis, we will propose two electronic lottery protocols that can achieve the fairness and perfect anonymity simultaneously.

CHINESE ABSTRACT III
ENGLISH ABSTRACT IV
TABLE OF CONTENTS V
LIST OF FIGUERS VII
LIST OF TABLES VII

Chap 1 Introduction 1
1.1 Motivations 1
1.2 Basic Ideas 3
1.3 Thesis Organization 4
Chap 2 Related Works 5
2.1 Zhou and Tan’s Protocol 5
2.2 Ham and Kim’s Protocol 9
2.3 Chow et al.’s Protocol 11
2.4 Goldschlag and Stubblebine’s Protocol 15
2.5 Kushilevitz and Rabin’s Protocols 17
2.6 Kobayashi et al’s Protocol 19
Chap 3 Basic Foundations of the Proposed Protoclos 23
3.1 A Generic Partially Blind Signature Scheme 23
3.2 An Untraceable Electronic Cash Scheme 25
3.3 An Anonymous Channel Scheme 26
Chap 4 The Proposed Electronic Lottery Protocols 28
4.1 Two-Party Electronic Lottery Protocol 28
4.2 Three-Party Electronic Lottery Protocol 33
Chap 5 Security Analysis and Comparisons 38
Chap 6 Conclusions 45
References 45
Appendix 48
A.1 The Implementation of the Two-Party Protocol 48
A.2 The Key Part of the Source Codes 56

[1] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate and Verifiably Encrypted Signatures from Bilinear Maps,” Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques-EUROCRYPT 03, LNCS 2656, pp. 416-432, 2003.
[2] D. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM, vol. 24, pp. 84-88, 1981.
[3] D. Chaum, “The dining cryptographers problem: unconditional sender and recipient untraceability,” Journal of Cryptology, vol. 1, no. 1, pp. 65-75, 1988.
[4] D. Chaum, “Blind Signatures for Untraceable Payments,” Advances in Cryptology Proceeding of CRYPTO 82, pp. 199-203, 1983.
[5] S. S. M. Chow, L. C. K. Hui, S. M. Yiu, and K. P. Chow, “An e-Lottery Scheme Using Verifiable Random Function,” International Conference on Computational Science and its Applications, LNCS 3482, pp. 651-660, 2005.
[6] C. I. Fan and C. L. Lei, “Secure Rewarding Schemes,” Proceedings of the 30th Hawaii International Conference on System Sciences: Information System Track-Organizational Systems and Technology, vol. 3, pp. 571-580, 1997.
[7] C. I. Fan and C. L. Lei, “Low-Computation Partially Blind Signatures for Electronic Cash,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E81-A, pp. 818-824, 1998.
[8] C. I. Fan and C. L. Lei, “A User Efficient Fair Blind Signature Scheme for Untraceable Electronic Cash,” Journal of Information Science and Engineering, vol. 18, pp. 47-58, 2002.
[9] C. I. Fan, “Improved Low-Computation Partially Blind Signatures,” Applied Mathematics and Computation, vol. 145, pp. 853-867, 2003.
[10] D. M. Goldschlag and S. G. Stubblebine, “Publicly Verifiable Lotteries: Applications of Delaying Functions,” Proceedings of the 2nd International Conference on Financial Cryptography, LNCS 1465, pp. 214-226, 1998.
[11] W. Ham and K. Kim, “A Secure On-line Lottery Using Bank as a Notary,” CISC, pp. 121-124, 2002.
[12] K. Kobayashi, H. Morita, M. Hakuta, and T. Nakanowatari, “An Electronic Soccer Lottery System that Uses Bit Commitment,” IEICE Trans. Inf. & Syst., vol. E83-D, No. 5, pp. 980-987, 2000.
[13] E. Kushilevitz and T. Rabin, “Fair e-Lotteries and e-Casinos,” The Cryptographers'' Track at RSA Conference, LNCS 2020, pp. 100-109, 2001.
[14] S. Micali, M. O. Rabin, and S. P. Vadhan, “Verifiable Random Functions,” IEEE Symposium on Foundations of Computer Science, pp. 120-130, 1999.
[15] I. Ray and N. Natarajan, “An anonymous and failure resilient fair-exchange e-commerce protocol,” Decision Support Systems, vol. 39, no. 3, pp. 267-292, 2005.
[16] H. Xu, X. Fu, Y. Zhu, R. Bettati, J. Chen, and W. Zhao, “SAS: A Scalar Anonymous Communication System,” Proceedings of the 3rd International Conference on Networking and Mobile Computing, LNCS 3619, pp. 452-461, 2005.
[17] J. Zhou and C. Tan, “Playing Lottery on the Internet,” Proceedings of the 3rd International Conference on Information and Communications Security, LNCS 2229, pp. 189-201, 2001.