Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/19369
DC FieldValueLanguage
dc.contributor張真誠zh_TW
dc.contributor伍麗樵zh_TW
dc.contributor陳育毅zh_TW
dc.contributor.advisor曾育民zh_TW
dc.contributor.author康諾zh_TW
dc.contributor.authorMamadou, KONEen_US
dc.contributor.other中興大學zh_TW
dc.date2007zh_TW
dc.date.accessioned2014-06-06T07:06:38Z-
dc.date.available2014-06-06T07:06:38Z-
dc.identifierU0005-2207200623330800zh_TW
dc.identifier.citation[1] Amazon: http://www.amazon.com [2] A. Jøsang, S. Pope, “Semantic Constraints for Trust Transitivity”. Second Asia-Pacific Conference on Conceptual Modeling (APCCM2005), Newcastle, Australia, January-February 2005. [3] A. A. Selcuk, E. Uzun, and M. R. Pariente, “A Reputation-Based Trust Management System for P2P Networks”, Proc. 4th Int''l workshop on GP2PC, 2004. [4] A. Singh, L. Liu, “TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems”, In the Proceedings of the third IEEE International Conference on P2P Computing, Linköping, Sweden, Sept, 2003. [5]. B. C. Ooi, C. Y. Kiau, and K.-L. Tan, “Managing trust in peer-to-peer systems using reputation-based techniques,” in The 4th International Conference on Web Age Information Management. LNCS, August 2003, http://xena1.ddns.comp.nus.edu.sg/P2P/waim03.pdf. [6] B. Gross, A. Acquisti “Balances of Power on eBay: Peers or Unequals?” In the Workshop of Economics of Peer-to-peer Systems, Berkerly CA, June 2003. [7] B. Sieka, A. D. Kshemkalyani, Mukesh Singhaly, On the Security of Polling Protocols in Peer-to-Peer Systems,”Proceedings of the Fourth International Conference on Peer-to-Peer Computing”(P2P'04), 2004 IEEE. [8] C. Dellarocas “Building Trust On-line: The Design of Reliable Reputation Reporting System” eBusiness@MIT working paper, MIT Sloan School of management, Cambridge, Mass. 2001 [9] C. Dellarocas, “Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior,” in ACM Conference on Electronic Commerce, 2000, pp. 150-157. [10] E. Adar, B. Huberman. “Free Riding on Gnutella”, Technical report, Xerox PARC, 10 Aug. 2000. [11] eBay. http://ebay.com. [12] E. Damiani, D. C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante, “A reputation-based approach for choosing reliable resources in peer-to-peer networks”. In Proceedings of the 9th ACM conference on Computer and communications security, pages 207-216. ACM Press, 2002. [13] E. Damiani, D. C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante, “Managing and Sharing Servents' Reputations in P2P Systems” in IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 4, July/August 2003, pp. 840-854. [14] F. K. Hussain, E. Chang, T. Dillon, Classification of Reputation in Peer-to-Peer (P2P) Communication, In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA ''04, June 21-24, 2004, Las Vegas, Nevada, USA, Volume 3. [15] I. Clarke, O. Sandberg, B. Wiley, and T. Hong. “Freenet: A distributed anonymous information storage and retrieval system”, In Proc. of the ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000. [16] J. Douceur. The Sybil Attack. 2002. http://citeseer.ist.psu.edu/douceur02sybil.html [17] J. Ruderman “A comparison of two trust metrics”, UCSD CSE 202 Fall 2004 December 15, 2004 [18] K. Ranganathan, M. Ripeanu, A. Sarin, I.Foster, To Share or not to Share, An Analysis of Incentives to Contribute in Collaborative File Sharing Environments, in Proc. Of the Workshop on Economics of Peer-to-Peer Systems 2003, Berkeley, CA, USA, June 2003” ” [19] Kazaa. http://www.kazaa.com. [20] Napster. http://www.napster.com. [21] P.Dewan, P. Dasgupta, Securing reputation data in peer-to-peer networks, In International Conference on Parallel and Distributed Computing and Systems (PDCS 2004). IASTED, November 2004. [22] P. Dewan, P. Dasgupta. Pride: Peer-to-peer reputation infrastructure for decentralized environments. In Proceedings of the 13th International World Wide Web Conference (WWW13), pages 480-481, 2004 [23] P. Resnick, R. Zeckhauser, E. Friedman, and K. Kuwabara, “Reputation Systems,” Comm. ACM, vol. 43, no. 12, pp. 45-48,Dec. 2000. [24] R. L. Rivest and B. Lampson, “SDSI a simple,distributed,security infrastructure,” in Crypto. Santa Barbara ,USA: IEEE Computer Society, 1996, very near to self-certification. [25] S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in P2P networks. In Proc. of the Twelfth International World Wide Web Conference (WWW2003). 2003. [26] R. Dingledine. In irc://irc.freenode.net/p2p-hackers on 2004-12-13.] [27] R. Levien, “Advogato,” Webpage, 2003. [Online].Available: www.Advogato.org [28] ”Symantec http//securityresponse.symantec.com” [29] Seti@Home website. http://setiathome.ssl.berkely.edu [30] Th. G. Papaioannou and G. D. Stamoulis. Reputation-based Policies that Provide the Right Incentives in Peer-to-Peer Environments. Computer Networks (Special Issue on Management in Peer-to-Peer Systems: Trust, Reputation and Security), Elsevier, vol. 50, issue 4, pp. 563-578, 2006.zh_TW
dc.identifier.urihttp://hdl.handle.net/11455/19369-
dc.description.abstract由於其服務使用者是採用非集中式的架構,已使得點對點(Peer-to-peer, P2P)的系統廣泛地被使用在現今實際的網路上,不過此開放與匿名式的系統環境其隱含的問題是易於遭受攻擊。一個信任系統是解決此惡意攻擊問題的方法,然而此信任系統必須是植基於一些規則且提供強健與完整的設計,以使得攻擊者不易攻擊與傷害此信任系統,並且可鼓勵誠實參與者加入此系統。 在本論文中,我們提出一個植基於群體遞移的安全信任系統,其中每一個要求者與提供者是利用其信任度與在此系統的參與度而所決定。整個網路被區分為幾個區域,每一個區域存在一個管理者負責管理存取點(peer)對其他存取點的存取授權。在不同的存取點(peer)間以及不同的管理者間之交易是採用不同的協定以滿足其不同的交易性質。在本系統中我們採用一種稱為Simple Distributed Security Infrastructure (SDSI)的自我驗證 ( self-certification)的憑證系統以達成交易簽章與代表在此網路下各個存取點的身份 。 我們相信此種沒有貢獻就沒有服務的信任系統將適用於現今的點對點網路系統。zh_TW
dc.description.abstractPeer-to-peer (P2P) systems are gaining a wide popularity in actual networks, due to their decentralized structure in offering services to users. The inherent problem of such an open and anonymous environment is its weakness to attackers. A reputation system is believed to be a solution to alleviate or even stop malicious peers from harming the system. However, this reputation system should be strong enough, well designed and based on certain rules to discourage attackers and inject trust and incentives to participation into the system. In this paper, we propose a secure reputation system based on group transitivity where every requester and provider is selected according to her reputation and participation in the community service. The network is organized by area, each having a manager responsible for handling its peers' access to other groups' peers. In every area the transactions between the different peers and Area Managers are insured through different protocols that we designed for this purpose. A self-certification generating a Simple Distributed Security Infrastructure (SDSI) certificate is used for each transaction's signature and uniquely identifies every peer in the network. We believe that this kind of reputation system where no contribution results in no service will have its domain of application in the large world of P2P network.en_US
dc.description.tableofcontentsCHAPTER 1: INTRODUCTION 1 1.1 Overview of P2P Networks 1 1.2 Security Issues in P2P Systems 2 1.3 New Concept of Design for Reputation Systems 2 CHAPTER 2: PRELIMINARIES AND PREVIOUS WORKS 4 2.1 The Main Concept of Reputation Based Systems 4 2.2 Client/Server Based Recommendation System 5 2.2.1 eBay Reputation Systems 5 2.3 Reputation Systems Based Policy 5 2.4 Reputation Based Trust Management 6 2.4.1 EigenTrust 6 2.5 Online Systems 7 2.5.1 Advogato Trust Metric 7 2.6 Reputations based Infrastructure 9 2.6.1 P2Prep: A Polling Protocol 10 2.7 Simple Distributed Security Infrastructure (S.D.S.I) 11 2.7.1 SDSI: A Public Key Cryptography 11 2.7.2 Groups and Permissions with SDSI 12 CHAPTER 3: SYSTEM MODEL AND DESIGN CONCEPT 14 3.1 System Model 14 3.2 Notations 17 3.3 Design concept 19 3.3.1 Peers' Classification Evaluation 19 3.3.2 Transitive Reputation of Area Manager 20 CHAPTER 4: DESCRIPTION OF THE PROPOSED PROTOCOLS 23 4.1 Requester and Provider First Selection Protocols 23 4.1.1 Requester First Selection Protocol 23 4.1.2 Provider first selection 24 4.2 Resources download Protocol 25 4.3 Area Manager Protocol 26 CHAPTER 5: DISCUSSIONS AND COMPARISONS 29 5.1 Discussions 29 5.1.1 Peers Cannot Free Ride 29 5.1.2 Man-in-the Middle Attack 30 5.1.3 Malicious Peers Issue 30 5.1.4 Limiting the Spread of Bad Peers 31 5.1.5 Collusion by Rogues 31 5.1.6 Multiple Identities Issue 32 5.1.7 Network Connections and Overload Issue 33 5.1.8 Local Storage Cost 33 5.2 Comparisons 34 CHAPTER 6: CONCLUSION 37 REFERENCES 38en_US
dc.language.isoen_USzh_TW
dc.publisher資訊科學系所zh_TW
dc.relation.urihttp://www.airitilibrary.com/Publication/alDetailedMesh1?DocID=U0005-2207200623330800en_US
dc.subjectReputationen_US
dc.subject信任zh_TW
dc.subjectTransitivityen_US
dc.subjectSecurityen_US
dc.subjectPeer-to-peer networksen_US
dc.subject遞移zh_TW
dc.subject安全zh_TW
dc.subject點對點網路zh_TW
dc.title在對等式網路下植基於群體遞移性與節點分類性之安全信任系統zh_TW
dc.titleSecure Reputation System Based on Group Transitivity And Peer''s Classification for Peer-to-Peer Networksen_US
dc.typeThesis and Dissertationzh_TW
item.openairetypeThesis and Dissertation-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en_US-
item.grantfulltextnone-
item.fulltextno fulltext-
item.cerifentitytypePublications-
Appears in Collections:資訊科學與工程學系所
Show simple item record
 

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.