論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available
論文名稱 Title |
匿名公平P2P貸款機制 Anonymous Fair P2P-Lending Scheme |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
79 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2015-07-24 |
繳交日期 Date of Submission |
2015-08-26 |
關鍵字 Keywords |
可追蹤、電子合同、公平性、匿名性、代理簽章 Fairness, Traceable, Electronic Contract, Proxy Signature, Anonymity |
||
統計 Statistics |
本論文已被瀏覽 5808 次,被下載 43 次 The thesis/dissertation has been browsed 5808 times, has been downloaded 43 times. |
中文摘要 |
P2P貸款是一種新型的民間借貸形式,其特點是貸款金額與對象分散、靈活,貸款 利率市場化等等。互聯網平台的興起促進了這種貸款形式的發展。但是,目前的P2P貸 款的主要形式需要用戶或者完全相信平台,或者進行線下合同簽訂。這兩種方案都會 帶來一定的問題。然而,現有發表的論文中,還沒有利用密碼學方法來解上述問題的 研究成果。 因此,我們提出一種新的匿名P2P貸款系統,使得借貸雙方的各個角色之間相互匿 名,並借助一個半可信的第三方來保證合同的公平與惡意用戶的追查。 |
Abstract |
P2P-Lending (P2PL) is a new kind of private lending with the feature like loan interest rate marketlized and distributed borrowers/lenders, etc. The development of lending platform on internet helps the growing of P2PL. Currently, the main styles of P2PL system ask the users either fully trust the P2PL platform or sign the loan contract off line. Both these two styles take some shortcomings. However, there is no existing published paper using the cryptographic approaches to solve these issues. In order to make this situation better, we design a new anonymous fair P2PL scheme to make each character in a contract keep anonymity against each other. At the same time, under the help of a semi-trusted third party (lending platform), the fairness in this scheme and the traceability on malicious users are ensured. |
目次 Table of Contents |
論文審定書i Acknowledgments iv 摘要v Abstract vi List of Figures x List of Tables xi Chapter 1 Introduction 1 1.1 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Chapter 2 Preliminaries 5 2.1 Bilinear Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 RSA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2.1 Review of Rivest et al.’s Scheme . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Proxy Signature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3.1 Review of Mambo et al.’s Proxy Signature Scheme . . . . . . . . . . . 8 2.4 ElGamal Signature and Encryption/Decryption . . . . . . . . . . . . . . . . . . 9 2.4.1 Review of Basic ElGamal Signature Scheme . . . . . . . . . . . . . . . 9 2.4.2 Review of Basic ElGamal Encryption/Decryption Scheme . . . . . . . 10 2.5 Attribute-Based Encryption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.6 Complexity Assumption and Hard Problems . . . . . . . . . . . . . . . . . . . . 11 vii 2.6.1 The Discrete Logarithm Problem . . . . . . . . . . . . . . . . . . . . . . 11 2.6.2 The Gap Diffie-Hellman group . . . . . . . . . . . . . . . . . . . . . . . 12 Chapter 3 Related Works 13 3.1 Information Publication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.1.1 Fan et al.’s ABE Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.1.1.1 Review of Fan et al.’s ABE Scheme . . . . . . . . . . . . . . 15 3.2 Contract Signing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.2.1 Wang et al.’s Contract Signing Protocol with STTP . . . . . . . . . . . 22 3.2.1.1 Review of Wang et al.’s Scheme . . . . . . . . . . . . . . . . 22 3.2.2 Gu et al.’s Traceable Anonymous Proxy Signature Scheme . . . . . . . 25 3.2.2.1 Review of Gu et al.’s Scheme . . . . . . . . . . . . . . . . . . 26 3.2.3 Wang et al.’s Multi-Party Contract Signing Protocol . . . . . . . . . . . 28 3.2.3.1 Review ofWang et al.’s Multi-Party Contract Signing Protocol 28 3.3 Loan Payment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 Chapter 4 The Proposed Scheme 32 4.1 Our Proposed Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 4.1.1 Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 4.1.2 Register . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.1.3 Information Publishing . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 4.1.4 Contracts Signing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 4.1.4.1 Setp 1: Z generates the first part signature . . . . . . . . . . . 38 4.1.4.2 Step 2: User i generates the proxy signature . . . . . . . . . . 40 4.1.4.3 Step 3: Z generates proxy signature . . . . . . . . . . . . . . 41 4.1.5 Loan and Repayment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.1.5.1 Loan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4.1.5.2 Repayment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 4.1.6 Abort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 4.1.7 Resolve . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 4.2 Correctness Proof . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 viii Chapter 5 Security Analysis 54 5.1 Unforgeability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 5.1.1 Unforgeability on User Z’s First Part Signature . . . . . . . . . . . . . . 54 5.1.2 Unforgeability on User i (i > )’s Proxy Signature . . . . . . . . . . . . 55 5.2 Undeniability on the Linkability Between zi and i1 . . . . . . . . . . . . . . . 56 5.3 Fairness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 5.3.1 Fairness in Our Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 5.4 Anonymity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 5.5 Traceablity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 5.5.1 Traceablity on Proxy Signature . . . . . . . . . . . . . . . . . . . . . . . 60 Chapter 6 Comparison 61 Chapter 7 Conclusion 62 Bibliography 63 |
參考文獻 References |
[1] 第一財經新金融研究中心. 《中國P2P借貸服務行業白皮書》. 中國經濟出版社, 2013. [2] N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS ’97, pages 7–17, New York, NY, USA, 1997. ACM. [3] G. Ateniese. Efficient verifiable encryption (and fair exchange) of digital signatures. In Proceedings of the 6th ACM Conference on Computer and Communications Security, CCS ’99, pages 138–146, New York, NY, USA, 1999. ACM. [4] J. Baek and Y. Zheng. Simple and efficient threshold cryptosystem from the gap diffiehellman group. In Global Telecommunications Conference, 2003. GLOBECOM ’03. IEEE, volume 3, pages 1491–1495 vol. 3, Dec 2003. [5] S. C. Berger and F. Gleisner. Emergence of financial intermediaries in electronic markets: The case of online p2p lending. BuR - Business Research, 2(1):39–65, 2009. [6] J. Bethencourt, A. Sahai, and B. Waters. Ciphertext-policy attribute-based encryption. In Security and Privacy, 2007. SP ’07. IEEE Symposium on, pages 321–334, May 2007. [7] W. Diffie and M. E. Hellman. New directions in cryptography. Information Theory, IEEE Transactions on, 22(6):644–654, Nov 1976. [8] T. ElGamal. A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms. IEEE Transactions on Information Theory, 31(4):469–472, 1985. [9] C. I. Fan, L. Y. Huang, and P. H. Ho. Anonymous multireceiver identity-based encryption. Computers, IEEE Transactions on, 59(9):1239–1249, Sept 2010. 63 [10] C. I. Fan, V. S. Huang, and H. Ruan. Arbitrary-state attribute-based encryption with dynamic membership. Computers, IEEE Transactions on, 63(8):1951–1961, Aug 2014. [11] R. Ganjavi, M. R. Asaar, and M. Salmasizadeh. A traceable optimistic fair exchange protocol. In Information Security and Cryptology (ISCISC), 2014 11th International ISC Conference on, pages 161–166, Sept 2014. [12] V. Goyal, O. Pandey, A. Sahai, and B.Waters. Attribute-based encryption for fine-grained access control of encrypted data. In Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS ’06, pages 89–98, New York, NY, USA, 2006. ACM. [13] M. E. Greiner and H.Wang. The role of social capital in people-to-people lending marketplaces. In Jay F. Nunamaker Jr. and Wendy L. Currie, editors, ICIS, page 29. Association for Information Systems, 2009. [14] L. Gu, Zh. Li, and Y. Yang. A anonymous proxy signature scheme without a trusted party. Journal of Beijing University of Posts an Telecommunications, 1(3):48–50, 2004. [15] X. Hu, Y. Yang, Y. Liu, J. Wang, and X. Xiong. A highly efficient and identity-based proxy signature scheme without random oracle. In Information Technology and Electronic Commerce (ICITEC), 2014 2nd International Conference on, pages 204–207, Dec 2014. [16] A. Joux and K. Nguyen. Separating decision diffie–hellman from computational diffie–hellman in cryptographic groups. Journal of Cryptology, 16(4):239–247, 2003. [17] X. Li and Q. Zheng. Two-round multi-party contract signing. In Knowledge Discovery and Data Mining, 2010. WKDD ’10. Third International Conference on, pages 486–489, Jan 2010. [18] Y. Liu, Y. Cui, Ch. Gu, and Y. Zhou. Key distribution and signcryption in fair electronic contract. JOURNAL OF INFORMATION ENGINEERING UNIVERSITY, 6(3):22– 25, 2005. [19] M. Mambo, K. Usuda, and E. Okamoto. Proxy signatures for delegating signing operation. In Proceedings of the 3rd ACM Conference on Computer and Communications Security, CCS ’96, pages 48–57, New York, NY, USA, 1996. ACM. 64 [20] F. S. Mishkin. Over the cliff: From the subprime to the global financial crisis. Journal of Economic Perspectives, 25(1):49–70, 2011. [21] National Institute of Standards and Technology. The digital signature standard, proposal and discussion. Communications of the ACM, 35(7):36–54, July 1992. [22] I. Niven and H. S. Zuckerman. AN INTRODUCTION TO THE THEORY OF NUMBERS. Wiley India Pvt., 1972. [23] R. Patidar and R. Bhartiya. Modified rsa cryptosystem based on offline storage and prime number. In Computational Intelligence and Computing Research (ICCIC), 2013 IEEE International Conference on, pages 1–6, Dec 2013. [24] Y. Qu, Z. Hou, and W. Wei. A protocol for signing contracts based on oblivious transfer. JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT, 40(4):615–619, 2003. [25] R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21(2):120–126, February 1978. [26] A. Sahai and B. Waters. Fuzzy identity-based encryption. In Ronald Cramer, editor, Advances in Cryptology –EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 457–473. Springer Berlin Heidelberg, 2005. [27] R. Steinfeld, L. Bull, and Y. Zheng. Content extraction signatures. In Kwangjo Kim, editor, Information Security and Cryptology —ICISC 2001, volume 2288 of Lecture Notes in Computer Science, pages 285–304. Springer Berlin Heidelberg, 2002. [28] X. Sun. The model and supervision problem research on p2p-lening in china. Finance Teaching and Research, pages 16–20, May 2014. [29] Y. Sun, L. Gu, S. Zhang, Y. Yang, and Y. Sun. An aggregate signature based multi-party contract signing protocol. JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT, 34(2):8–11,21, 2011. [30] C.Wang, J. Ge, and Ch. Liu. New contract signing protocol with semi-trusted third party. JOURNAL OF COMPUTER APPLICATIONS, 24(2), March 2004. 65. [31] C. Wang, H. Yu, H. Wang, and W. . Yi. A new multi-party and multi-contract contract signing protocol. ACTA ELECTRONICA SINICA, 35(10):1897–1902, 2007. [32] G. Wang. An abuse-free fair contract signing protocol based on the rsa signature, 2005. [33] X. Ye. The model risk and supervision research on p2p-lening. Financial Regulation Research, pages 71–82, May 2014. [34] F. Zhang and K. Kim. Efficient id-based blind signature and proxy signature from bilinear pairings. In Rei Safavi-Naini and Jennifer Seberry, editors, Information Security and Privacy, volume 2727 of Lecture Notes in Computer Science, pages 312–323. Springer Berlin Heidelberg, 2003. |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:自定論文開放時間 user define 開放時間 Available: 校內 Campus: 已公開 available 校外 Off-campus: 已公開 available |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 已公開 available |
QR Code |