跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.126) 您好!臺灣時間:2025/09/10 13:48
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:楊富堯
研究生(外文):Fu-Yao Yang
論文名稱:多方電子合同簽署協議之研究
論文名稱(外文):A Study of Electronic Multi-Party Contract Signing Protocol
指導教授:古政元古政元引用關係
指導教授(外文):Cheng-Yuan Ku
口試委員:陳世彬阮金聲
口試委員(外文):Shih-Pin ChenJin-sheng Roan
口試日期:2014-06-25
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊管理學系暨研究所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2014
畢業學年度:102
語文別:中文
論文頁數:65
中文關鍵詞:多方合同簽署協議公平交換可信任第三方
外文關鍵詞:multi-party contract signing protocolfair exchangetrusted third part
相關次數:
  • 被引用被引用:0
  • 點閱點閱:310
  • 評分評分:
  • 下載下載:14
  • 收藏至我的研究室書目清單書目收藏:0
隨著科技進步,許多人類行為都可在網路上完成,本論文主要在討論多方電子合同簽署協議。在網路上交換簽署協議,必須注重其公平性、安全性及時效性。我們先討論了雙方協議,進而討論多方協議,最後才做出我們主要的貢獻-循環多方協議。為了確保本協議是可被應用,我們在第四章做了公平性、安全性及時效性等分析。當中討論了各種可能的攻擊,也討論了不誠實的參與者所造成的情形,最終我們確認了循環多方協議是具有這些性質。
As technology advances, many human activities can be completed on the Internet now. Therefore, this paper would like to discuss the electronic multi-party contract signing happening in our everyday life. To exchange the contract signing on the Internet, we shall ensure its fairness, security and timeliness. We first introduce the two-party protocol, and then discuss the multi-party protocol. After the detailed review, we propose our main contribution, the so-called cyclic multi-party protocol. For validating the effectiveness of cyclic multi-party protocol, we analyze its fairness, security and timeliness in the later chapter. Finally, we discussed various possible attacks, and also discussed the situation caused by the dishonest participants, which do confirm the above-mentioned properties for our protocol.
中文摘要 Ⅰ
ABSTRACT Ⅱ
誌謝 Ⅲ
目錄 Ⅳ
表目錄 Ⅵ
圖目錄 Ⅶ
第一章 緒論 1
第一節 研究背景與動機 1
第二節 研究目的與問題 2
第三節 研究貢獻 3
第二章 文獻探討 4
第一節 重要性質 4
第二節 雙方合同簽署協議 5
第三節 多方合同簽署協議 8
第三章 循環多方協議 10
第一節 前提與假設 10
第二節 雙方協議架構之抽象分析 12
第三節 多方協議之抽象分析 31
第四節 循環多方協議 40
第四章 公平性、安全性與時效性分析 48
第一節 公平性分析 48
第二節 安全性分析 49
第三節 時效性分析 51
第五章 結論與建議 58
第一節 結論 58
第二節 未來建議與方向 60
參考文獻 61
1. Aizatulin, M. (2008). A timely and balanced optimistic contract-signing protocol. Diploma thesis, Christian-Albrechts-Universität zu Kiel, Germany.
2. Asokan, N. (1998). Fairness in electronic commerce. PhD thesis, University of Waterloo, Ontario, Canada.
3. Asokan, N., Baum-Waidner, B., Schunter, M., & Waidner, M. (1998). Optimistic synchronous multi-party contract signing. Tech. Rep. RZ 3089 (#93135), IBM Zurich Research Laboratory.
4. Asokan, N., Schunter, M., & Waidner, M. (1996). Optimistic protocols for multi-party fair exchange. Tech. Rep. RZ 2892, IBM, Zurich Research Laboratory.
5. Asokan, N., Schunter, M., and Waidner, M. (1997, April). Optimistic protocols for fair exchange. Proceedings of the 4th ACM conference on Computer and communications security, Zurich, Switzerland.
6. Asokan, N., Shoup, V., & Waidner, M. (1998, May). Asynchronous protocols for optimistic fair exchange. Proceedings of the 1998 IEEE Symposium on Security and Privacy, Oakland, CA, USA.
7. Asokan, N., Shoup, V., & Waidner, M. (2000). Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4), 593-610.
8. Bao, F., Deng, R. H., & Mao, W. (1998, May). Efficient and practical fair exchange protocols with off-line TTP. Proceedings of the 1998 IEEE Symposium on Security and Privacy, Oakland, CA, USA.
9. Bao, F., Deng, R., Nguyen, K. Q., & Vardharajan, V. (1999, September). Multi-party fair exchange with an off-line trusted neutral party. Proceedings of the 10th International Workshop on Database and Expert Systems Applications, Florence , Italy.
10. Bao, F., Wang, G., Zhou, J., & Zhu, H. (2004). Analysis and improvement of Micali's fair contract signing protocol. ACISP’04, Lecture Notes in Computer Science, 3108, 176-187.
11. Baum-Waidner, B. (2001). Optimistic asynchronous multi-party contract signing with reduced number of rounds. ICALP’01, Lecture Notes in Computer Science, 2076, 898-911.
12. Baum-Waidner, B., & Waidner, M. (1998). Optimistic asynchronous multi-party contract signing. Tech. Rep. RZ 3078 (#93124), IBM Zurich Research Laboratory.
13. Baum-Waidner, B., & Waidner, M. (2000). Round-optimal and abuse-free optimistic multi-party contract signing. ICALP’00, Lecture Notes in Computer Science, 1853, 524-535.
14. Ben-Or, M., Goldreich, O., Micali, S., & Rivest, R.L. (1990). A fair protocol for signing contracts. IEEE Transactions on Information Theory, 36(1), 40-46.
15. Boyd, C., & Foo, E. (1998). Off-line fair payment protocols using convertible signatures. Asiacrypt’98, Lecture Notes in Computer Science, 1514, 271-285.
16. Chadha, R., Kremer, S., & Scedrov, A. (2004). Formal analysis of multiparty contract signing. Journal of Automated Reasoning, 36(1-2), 39-83.
17. Coffey, T., & Saidha, P. (1996). Non-repudiation with mandatory proof of receipt. Computer Communication Review, 26(1), 6-17.
18. Deng, R. H., Gong, L., Lazar, A. A., & Wang, W. (1996). Practical protocol for certified electronic mail. Journal of Network and Systems Management, 4(3), 279-297.
19. Draper-Gil, G., Zhou, J., Ferrer-Gomila, J. L., & Hinarejos, M. F. (2013). An optimistic fair exchange protocol with active intermediaries. International journal of information security, 12(4), 299-318.
20. Even, S., Goldreich, O., & Lempel, A. (1985). A randomized protocol for signing contracts. Communications of the ACM, 28(6), 637-647.
21. Fan, K., Wang, Y., & Li, H. (2009, August). A new abuse-free fair electronic payment Protocol. IAS '09 Proceedings of the 5th International Conference on Information Assurance and Security, Xi'an, China.
22. Franklin, M. K. & Reiter, M. K. (1997, April). Fair exchange with a semi-trusted third party. Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland.
23. Franklin, M., & Tsudik, G. (1998). Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. FC’98, Lecture Notes in Computer Science, 1465, 90-102.
24. Gaber, T., & Zhang, N. (2011, February). Fair and abuse-free contract signing protocol supporting fair license reselling. 4th IFIP International Conference on New Technologies, Mobility and Security, Paris, France.
25. Garay, J. A., Jakobsson, M., & MacKenzie, P. (1999). Abuse-free optimistic contract signing. Crypto’99, Lecture Notes in Computer Science, 1666, 449-466.
26. Garay, J. A., & MacKenzie, P. (1999). Abuse-free multi-party contract signing. DISC’99, Lecture Notes in Computer Science, 1693, 151-166.
27. Goldreich, O. (1983). A simple protocol for signing contracts. In D. Chaum (Eds.), Advances in cryptology : proceedings of Crypto 83 (pp. 133-136). New York: Plenum Press.
28. Khill, I., Kim, J., Han, I., & Ryou, J. (2001). Multi-party fair exchange protocol using ring architecture model. Computers & Security, 20(5), 422-439.
29. Kim, K., Park, S., & Baek, J. (1999, September). Improving fairness and privacy of Zhou-Gollmann’s fair non-repudiation Protocol. Proceedings of 1999 International Workshops on Parallel Processing, Aizu-Wakamatsu, Japan.
30. Kordy, B., & Radomirovic, S. (2012, June). Constructing Optimistic Multi-party Contract Signing Protocols. IEEE 25th Computer Security Foundations Symposium, Cambridge MA, USA.
31. Kremer, S. (2003). Formal analysis of optimistic fair exchange protocols. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium.
32. Kremer, S., & Markowitch, O. (2000a). Optimistic non-repudiable information exchange. In J. Biemond (Eds.), 21st Symposium on Information Theory in the Benelux (pp. 139-146). Wassenaar, The Netherlands: Werkgemeenschap Informatieen Communicatietheorie, Enschede.
33. Kremer, S. & Markowitch, O. (2000b). A multi-party non-repudiation protocol. Proceedings of the 15th International Conference on Information Security (SEC), IFIP World Computer Congress, 271-280.
34. Kremer, S., & Markowitch, O. (2003). Fair multi-party non-repudiation protocols. International Journal on Information Security, 1(4), 223-235.
35. Kremer, S., Markowitch, O., & Zhou, J. (2002). An intensive survey of fair non-repudiation protocols. Computer Communications, 25(17), 1606-1621.
36. Kremer, S., and Raskin, J.-F. (2001). A game-based verification of non-repudiation and fair exchange protocols. Concur'01, Lecture Notes in Computer Science, 2154, 551-565.
37. Kremer, S., & Raskin, J.-F.; (2002, June). Game analysis of abuse-free contract signing. Proceedings of the 15th IEEE Computer Security Foundations Workshop, Nova Scotia, Canada.
38. Küpçü, A., & Lysyanskaya, A. (2012). Usable optimistic fair exchange.Computer Networks, 56(1), 50-63.
39. Li, X., & Zheng, Q. (2010, January). Two-round Multi-Party Contract Signing. Third International Conference on Knowledge Discovery and Data Mining, Phuket , Thailand .
40. Markowitch, O., & Kremer, S. (2000). A multi-party optimistic non-repudiation protocol. ICISC’00, Lecture Notes in Computer Science, 2015, 109-122.
41. Micali, S. (2003, July). Simple and fast optimistic protocols for fair electronic exchange. Proceedings of the 21th Annual Symposium on Principles of Distributed Computing, 2003, Boston, MA, USA.
42. Mukhamedov, A., & Ryan, M. D. (2008). Fair multi-party contract signing using private contract signatures. Information and Computation, 206(2-7), 272-290.
43. Onieva, J. A., Zhou, J., & Lopez, J. (2004). Non-repudiation protocols for multiple entities. Computer Communications, 27(16), 1608-1616.
44. Onieva, J. A., Zhou, J., & Lopez, J. (2008). Multiparty non-repudiation: A survey. ACM Computing Surveys, 41(1), Article 5.
45. Pagnia, H., & Gartner, F. C. (1999). On the impossibility of fair exchange without a trusted third party. Tech. Rep. TUD-BS-1999-02, Darmstadt University of Technology.
46. Payeras-Capellà, M., Ferrer-Gomila, J. L., & Huguet-Rotger, L. (2006, April). Achieving fairness and timeliness in a previous electronic contract signing protocol. Proceedings of the 1st International Conference on Availability, Reliability and Security, Vienna, Austria.
47. Pfitzmann, B., Schunter, M., & Waidner. M. (1998, May). Optimal efficiency of optimistic contract signing. Proceedings of the 17th Symposium on Principles of Distributed Computing, New York, USA.
48. Shmatikov, V., & Mitchell, J. C. (2001a). Analysis of abuse-free contract signing. FC’00, Lecture Notes in Computer Science, 1962, 174-191.
49. Slanina, M., Sipma, H. B., & Manna, Z. (2006a). Game-theoretic deductive verification of a contract-signing protocol. Tech. Rep. REACT-TR-2006-03, Stanford University.
50. Slanina, M., Sipma, H. B., & Manna, Z. (2006b). Game-theoretic deductive verification of a contract-signing protocol II. Tech. Rep. REACT-TR-2006-04, Stanford University.
51. Wang, C.-H. (2003). Untraceable fair network payment protocols with off-line TTP. Asiacrypt’03, Lecture Notes in Computer Science, 2894, 173-187.
52. Wang, C.-H. (2006). How to protect exchanged secrets in the fair exchange protocol with off-line TTP. Computers & Electrical Engineering, 32(5), 364-375.
53. Wu, Q., Zhang, H., & Pu, J. (2007). A fair-exchange protocol based on off-line semi-trusted third party. International Journal of Computer Science and Network Security, 7(7), 208-212.
54. Zhang, Y., Zhang, C., Pang, J., & Mauw, S. (2010). Game-based verification of multi-party contract signing protocols. FAST'09, Lecture Notes in Computer Science, 5983, 186-200.
55. Zhou, J., & Gollmann, D. (1996, May). A fair non-repudiation protocol. Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, CA , USA.
56. Zhou, J., & Gollmann, D. (1997, June). An efficient non-repudiation protocol. Proceedings of the 10th Computer Security Foundations Workshop, Rockport, MA, USA.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top