臺灣博碩士論文加值系統

在網路的快速發展下，網路的應用變得普及，它帶給人們方便，但也衍生出許多問題。我們常在新聞中聽到關於企業內部的內線交易、大型工程的招標弊案、企業的機密資料外洩等等。在網路環境中的訊息傳送，需要一定的安全性，才能夠避免資料外洩或被有心人士竊取資料，所以網路中的安全性是一個很重要的議題。在本論文中我們針對抵擋網路應用中的內部攻擊，提出了兩個方案應用在不同環境中。
在第一個方案裡，我們主要針對企業內部的內線交易議題，建構一個透過潛隱通道揭發違法行為的機制，當檢調人員搜集到犯罪證據時，如何安全且隱秘的將證據和相關訊息傳送給檢調單位進行逮捕的動作，之後我們設置一個公平仲裁的機制，可以讓雙方擁有公平的判決。第二個方案中，我們針對大型標案議題，提出一個透過潛隱通道的電子公開招標協定，在投標過程中，我們使用基於ElGamal的盲簽章機制來保護投標者的隱私，同時也預防內部人員洩露投標相關資訊，當有爭議發生時，雙方都可以提出仲裁來確保自身的權益。

Due to the rapid development of the Internet, many applications of Internet are widely used. It brings convenient, but derives many problems. We often hear news about insider trading in different enterprises, the cheating case of engineer commercial spying, etc. The security of Internet becomes an important issue in the transaction. In this thesis, we proposed two schemes to apply in different environment.
In the first scheme, we defend against the illegal insider trading of enterprises to construct an investigator unearths illegal behavior via a subliminal channel. The scheme can let investigator safety to send the evidence to the organization. And we set an official agent to make both have fair arbitration. The second scheme focuses on e-bidding case. We proposed an electronic public engineering project bidding protocol via a subliminal channel. In the bidding phase, we use the blind signature based on ElGamal mechanism to protect bidder’s identity, also can prevent the insiders of Public Construction Commission to disclose bid information. And we use the arbitration mechanism to construct a secure and fair scheme to protect the rights benefit.

誌謝 I
中文摘要 I
Abstract II
Table of contents IV
List of tables VI
List of figures VII
Chapter 1 Introduction 1
Chapter 2 Preliminaries 7
2.1 Subliminal channel 7
2.2 The blind signature based on ElGamal 7
2.2.1 Initial phase 8
2.2.2 Blind message phase 8
2.2.3 Message signing 9
2.2.4 Message verification 9
2.3 Construct the session key model 9
Chapter 3 An investigator unearths illegal behavior (IUIB) via a subliminal channel 10
3.1 System architecture of IUIB 10
3.2 Notation 11
3.3 Initial phase 12
3.4 The investigation phase 13
3.5 The arbitration phase 15
3.6 The official agent arbitration phase 17
3.7 Security analyses 20
3.7.1 Replay attack 20
3.7.2 Forgery attack 20
3.7.3 Non-repudiation 21
3.7.4 Untraceable 21
3.7.5 Fair arbitration 22
3.8 Discussions 22
Chapter 4 An electronic public engineering project bidding protocol (EPEPBP) via a subliminal channel 24
4.1 System architecture of EPEPBP 24
4.2 Notation 26
4.3 The registration phase 27
4.4 The bidding phase 28
4.5 The opening bid phase 33
4.6 The official agent arbitration phase 35
4.7 Security Analysis 39
4.7.1 Non-repudiation 39
4.7.2 Fair arbitration 39
4.7.3 Blind and unlinkable issue 41
4.7.4 Auditability 41
4.7.5 One-time registration 42
4.7.6 Against known attacks 42
4.7.6.1 Replay attack 42
4.7.6.2 Forgery attack 42
4.7.6.3 Insider attack 43
4.8 Discussions 43
Chapter 5 Conclusions 46
References 48
附錄 52
附錄I: 作者簡介 52
附錄II：口試委員意見修正 53


List of tables
Table 1. The non-repudiation issue of our IUIB scheme ............................... 21
Table 2. The computation cost of our IUIB scheme ....................................... 22
Table 3. The communication cost of our IUIB scheme .................................. 23
Table 4. The non-repudiation issue of our EPEPBP scheme ......................... 39
Table 5. The computation cost of our EPEPBP scheme ................................. 44
Table 6. The security comparison of the related works and our scheme of our EPEPBP scheme ........................................................................... 45
Table 7口試委員意見及勘誤修正表 ............................................................... 53


List of figures
Figure 1 The system architecture of our IUIB scheme ........................................ 11
Figure 2 The scenario of the investigation phase of our IUIB scheme ........... 13
Figure 3 The scenario of the arbitration phase of our IUIB scheme .............. 16
Figure 4 The flowchart of the official agent arbitration phase of our IUIB scheme ................................................................................................................... 19
Figure 5 The system architecture of our EPEPBP scheme ................................. 25
Figure 6 The scenario of the bidding phase of our EPEPBP scheme ............. 30
Figure 7 The scenario of the opening bid phase of our EPEPBP scheme ..... 34
Figure 8 The overview of the arbitration phase (PCC is accused) ................... 36
Figure 9 The overview of the arbitration phase (BI is accused) ....................... 37
Figure 10 The flowchart of the arbitration phase of our EPEPBP scheme .. 38

[1]G. J. Simmons, “The prisoner’s problem and the subliminal channel,” In Proceedings of Crypto ‘83, New York, 1983, pp. 51-67.
[2]G. J. Simmons, “The subliminal channel and digital signatures,” Lecture Notes in Computer Science (LNCS), 1984, Vol. 209, pp. 364-378.
[3]G. J. Simmons, “Subliminal communication is easy using the DSA,” Lecture Notes in Computer Science (LNCS), 1993, Vol. 765, pp. 218-232.
[4]L. Harn, and G. Gong, “A digital signature with a subliminal channel,” Computers and Digital Techniques, IEE Proceedings, 1997, Vol. 144, No. 6, pp. 387-389.
[5]D. R. Lin, C. I. Wang, Z. K. Zhang, and D. J. Guan, “A digital signature with multiple subliminal channels and its applications,” Computers & Mathematics with Applications, Jun. 2010, Vol. 60, No. 2, pp. 276-284.
[6]Franklin, M. K., & Reiter, M. K. “Fair exchange with a semi-trusted third party,” In Proceedings of the 4th ACM Conference on Computer and communications Security, 1997, pp.1–5.
[7]Zhou, J., & Gollman, D. “A fair non-repudiation protocol,” In Proceedings of the 1996 IEEE Symposium on Security and Privacy, IEEE Computer Press, Oakland, CA, 1996, pp. 55–61.
[8]Chen, C. L., & Liu, M. H. “A traceable e-cash transfer system against blackmail via subliminal channel,” Electronic Commerce Research and Applications, 2009, Vol.8, No.6, pp.327–333.
[9]Chen, C. L. & Liao J.J. “A fair online payment system for digital content via subliminal channel,” Electronic Commerce Research and Applications, 2011, Vol. 10, No. 3, 279-287.
[10]S. Subramanian, “Design and verification of a secure electronic auction protocol,” Reliable Distributed Systems, Oct. 1998, pp. 204-210.
[11]M. S. Hwang, J. L. Lu, and I. C. Lin, “Adding timestamps to the secure electronic auction protocol,” Data & Knowledge Engineering, Feb. 2002, Vol. 40, No. 2, pp. 155-162.
[12]H. T. Liaw, W.S. Juang, and C. K. Lin, “An electronic online bidding auction protocol with both security and efficiency,” Applied Mathematics and Computation, 2006, Vol. 174, No. 2, pp. 1487-1497.
[13]Y. F. Chung, K. H. Huang, H. H. Lee, F. Lai, and T. S. Chen, “Bidder-anonymous English auction scheme with privacy and public verifiability,” Journal of Systems and Software, 2008, Vol. 81, No. 1, pp. 113-119.
[14]H. Xiong, Z. Chen, and F. Li, “Bidder-anonymous English auction protocol based on revocable ring signature,” Expert Systems with Applications, 2012, Vol. 39, No. 8, pp. 7062-7066.
[15]C. I. Fan, C. N. Wu, W. Z. Sun, and W. K. Chen, “Multi-recastable e-bidding game with dual-blindness,” Mathematical and Computer Modelling, In Press, Corrected Proof, Available online 22 June 2012.
[16]C. L. Chen, and M. H. Liu, “A traceable e-cash transfer system against blackmail via subliminal channel,” Electronic Commerce Research and Applications, 2009, Vol. 8, No. 6, pp. 327–333.
[17]C. L. Chen, and J. J. Liao, “A fair online payment system for digital content via subliminal channel,” Electronic Commerce Research and Applications, May- Jun . 2011, Vol. 10, No. 3, pp. 279-287.
[18]S. H. Seo, K. Y. Choi, J. Y. Hwang, and S. Kim, “Efficient certificateless proxy signature scheme with provable security,” Information Sciences, 2012, Vol. 188, No. 1, pp. 322-337.
[19]D. Chaum, "Blind signatures for untraceable payments," Crypto''82," Springer-Verlag, 1983.
[20]L. Harn, "Cryptanalysis of the blind signatures based on the discrete logarithm problem," Electronics Letters, 1995, Vol. 31.
[21]R. L. Shen, and Y. A. Lim, “a novel blind signature scheme based on discrete logarithms problem,” International Conference on Advanced Information Technologies, 2009, April, Taiwan, Taichung.
[22]M. Scott, “Implementing cryptographic pairings,” in: Proceedings of Pairing-Based Cryptography-Pairing, 2007, pp. 177–196.
[23]N. Koblitz, A. J. Menezes, and S. A. Vanstone, “The state of elliptic curve cryptography,” Design, Codes and Cryptography, 2000, Vol. 19 No. 2–3, pp. 173–193.
[24]A. Menezes, P. van Oorschot, and S. Vanstone, “Handbook of Applied Cryptography,” CRC Press LLC, Boca Raton, 1997.
[25]Y. Zhang, W. Liu, W. Lou, and Y. Fang, “Securing mobile ad hoc networks with certificateless public keys,” IEEE Transactions on Dependable and Secure Computing, 2006, Vol. 3, No. 4, pp. 386–399.
[26]C. I. Fan, C. N. Wu, W. Z. Sun, and W. K. Chen “Multi-recastable e-bidding game with dual-blindness” Mathematical and Computer Modelling, In Press, Corrected Proof, Available online 22 June 2012.