跳到主要內容

臺灣博碩士論文加值系統

(18.97.14.86) 您好!臺灣時間:2025/02/07 22:49
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:曹昌進
研究生(外文):Chang-Jinn Tsao
論文名稱:無記名電子支票系統
論文名稱(外文):An Electronic Bearer Check System
指導教授:陳建源陳建源引用關係
指導教授(外文):Chien-Yuan Chen
學位類別:碩士
校院名稱:義守大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2000
畢業學年度:88
語文別:英文
論文頁數:47
中文關鍵詞:電子商務電子支票系統電子現金系統
外文關鍵詞:electronic commerceelectronic check systemelectronic cash system
相關次數:
  • 被引用被引用:1
  • 點閱點閱:965
  • 評分評分:
  • 下載下載:24
  • 收藏至我的研究室書目清單書目收藏:2
由於網際網路的快速發展,導致電子商務也隨之盛行,因此,許多的商業交易便在網路上完成,也因為這個原因,使得大量的企業公司無不競相進入這塊具有強大商機的大餅,所以,為了在網路上安全且有效率地處理眾多的電子交易,一個具有完整架構之電子付款系統將不可或缺。
近年來,有許許多多的電子付款系統陸續地被提出,在這些系統中,可根據付款型態大致劃分成電子現金付款系統、電子支票付款系統以及信用卡付款系統。然而,在大部分的電子現金付款系統中,系統常常需要許多額外的空間來記錄消費者過去曾經消費過的資料,以便預防消費者的重覆消費,對於系統而言,這將是一大負擔,另外,雖然信用卡付款系統對消費者而言是非常方便的,但是卻有一個嚴重的缺點,即是任何知道持卡人之密碼者皆可進行提款消費,因此,我們著重於電子支票系統之開發,加上至目前為止,尚未有無記名型態之電子支票問世,因此,在這篇論文中,我們提出了無記名電子支票系統之架構。
在我們的系統中,消費者可自行決定所自費之金額,此外,消費者不需像線上之電子付款系統一樣,每次交易都得經由銀行來處理,所以可減少消費者交易的時間以及銀行的負擔,再者,此系統不但沒有重覆消費和重覆存款的問題,而且也提供消費者之匿名性,因此,本論文所提出之無記名電子支票系統,為一安全且有效率之電子付款系統。
Due to the rapid development of internet, electronic commerce is more and more popular. Many businesses all want to touch this powerful and arrogant area. It resulted in many electronic transactions on the web. Therefore, a secure and efficient payment system is needed to achieve these transactions.
Recently, electronic payment systems have proposed and implemented in many forms including electronic cash systems, electronic check systems and credit card systems. However, the electronic cash systems may have the drawback of large space to retain past transactions to prevent the double spending problem. In addition, although credit card systems are convenient for the consumer, anybody with knowledge of his credit card number can create an order for payment. Therefore, in order to avoid these drawbacks, we present an electronic bearer check system which works like the traditional check.
In our system, the consumer can decide how much he wants to spend. Besides, unlike some on-line electronic payment systems, the consumer doesn’t contract with the bank in every transaction. It is very convenient for the consumer. On the other hand, not only the double spending problem but also the double depositing problem never occur in our system. It is more important that our system also supports the anonymity of the consumer. Therefore, our system is more secure than other payment systems. Obviously, our system can supply to businesses a different payment mechanism other than electronic cash systems.
摘 要I
ABSTRACTII
ACKNOWLEDGEMENTSIII
CONTENTSIV
LIST OF TABLES AND FIGURESVI
CHAPTER ONE INTRODUCTION1
CHAPTER TWO REVIEWS RELATED WORKS10
2.1 THE PARTIAL BLIND SIGNATURES10
2.1.1 Miyazaki and Skurai’ scheme11
2.1.2 MAS scheme12
2.2 THE PROXY PROTOCOLS14
2.2.1 Sun and Hsieh’ scheme16
CHAPTER THREE ELECTRONIC BEARER CHECK SYSTEM19
3.1 CERTIFICATION PROTOCOL20
3.2 DELEGATION PROTOCOL22
3.3 PAYMENT PROTOCOL24
3.4 DEPOSIT PROTOCOL27
3.5 SECURITY ANALYSES28
CHAPTER FOUR COMPARISONS31
4.1 REVIEWS NETBILL SYSTEM31
4.2 COMPARISONS34
CHAPTER FIVE CONCLUSIONS AND FUTURE WORKS37
REFERENCES39
[1]M. Abe and E. Fujisaki: “How to Date Blind Signatures”, Proceeding of ASIACRYPT’96, LNCS 1163, pp. 244-251, 1996.
[2]M. Abe and J. Camenisch: “Partially Blind signature Schemes”, Proceeding of the 1997 symposium on Cryptography and Information Security, SCIS97-33D, 1997.
[3]S. Brands: “Untraceable Off-Line Cash in Wallet with Observers”, Proceeding of CRYPTO’93, pp. 302-318, 1993.
[4]S. Brands: “Restrictive Binding of Secret-Key Certificates”, Proceeding of EUROCRYPT’95, LNCS 921, pp.231-247, 1995.
[5]D. Chaum: “Blind Signatures for Untraceable Payments”, Proceeding of CRYPTO’82, Lecture Notes in Computer Science, Springer-Verlag Berlin, pp. 199-203, 1983.
[6]D. Chaum, A. Fiat and M. Noar: “Untraceable Electronic Cash”, Proceeding of CRYPTO’88, Lecture Notes in Computer Science, pp. 319-327, 1988.
[7]D. Chaum, B. D. Boer, E. V. Heyst, S. Mjflsnes and A. Steenbeek: “Efficient Offline Electronic Checks (Extended Abstract)”, Proceeding of EUROCRYPT’89, Lecture Notes in Computer Science, Springer-Verlag, pp. 294-301, 1989.
[8]Carnegie Mellon University: “NetBill: 1994 Prototype”, Technical Report, Carnegie Mellon University Information Networking Institute, Number TR 1994-11, 1994.
[9]S. J. Hwang and C. H. Shi: “Specifiable Proxy Signature Schemes”, Proceedings of the National Computer Symposium, pp. C-190-197, 1999.
[10] S. J. Hwang and C. H. Shi: “A Simple Multi-Proxy Signature Scheme”, Proceedings of the Tenth National Conference on Information Security, pp. 134-138, 2000.
[11] S. Kim, S. Park and D. Won: “Proxy Signatures, revisited”, ICICS’97, Lecture Notes in Computer Science 1334, Springer-Verlag, pp. 223-232, 1997.
[12] W. B. Lee and C. Y. Chang: “Efficient Proxy-protected Proxy Signature Scheme Based on Discrete Logarithm”, Proceedings of the Tenth National Conference on Information Security, pp. 4-7, 2000.
[13] M. Mambo, K. Usuda and E. Okamoto: “Proxy Signatures: Delegation of the Power to Sign Message”, IEICE Trans. Fundamentals, Vol. E79-A, NO. 9, Sep., pp.1338-1353, 1996.
[14] M. Mambo, K. Usuda and E. Okamoto: “Proxy Signatures for Delegating Signing Operation”, Proceeding of 3rd ACM Conference on Computer and Communications Security, pp. 48-57, 1996.
[15] S. Miyazaki, M. Abe and K. Sakurai: “Partially Blind Signature Schemes for the DSS and for a Discrete Log. Based Message Recovery Signature”, Proceeding of the 1997 Korea-Japan Joint Workshop on Information Security and Cryptology, pp. 217-226, 1997.
[16] S. Miyaaki and K. Sakurai: “A More Efficient Untraceable E-Cash System with Partially Blind Signatures Based on the Discrete Logarithm Problem”, Proceeding of Financial Cryptography 98, pp. 296-308, 1998.
[17] B. Clifford Neuman and G. Medvinsky: “Requirements for Network Payment: The NetChequeTM Perspective”
[18] H. M. Sun and B. T. Hsieh: “Remarks on Two Nonrepudiable Proxy Signature Schemes”, Proceedings of the Ninth National Conference on Information Security, pp. 241-246, 1999.
[19] H. M. Sun and B. J. Chen: “Time-Stamped Proxy Signatures with Traceable Receivers”, Proceedings of the Ninth National Conference on Information Security, pp. 247-253, 1999.
[20] H. M. Sun, N. Y. Lee and T. L. Hwang: “Nonrepudiable Threshold Proxy Signatures”, Proceedings of the Ninth National Conference on Information Security, pp. 254-261, 1999.
[21] H. M. Sun: “Convertible Proxy Signature Scheme”, Proceedings of the National Computer Symposium, pp. C-186-189, 1999.
[22] Y. Yacobi: “Efficient Electronic Money”, Proceeding of ASIACRYPT’94, pp. 153-163, 1995.
[23] K. Zhang: “Threshold Proxy Signature Schemes”, 1997 Information Security Workshop, Japan, Sep., pp. 191-197, 1997.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top