Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/24168
標題: 在點對點網路架構中數位產權管理之研究
A Study of DRM in P2P Network Architecture
作者: 江俊毅
Jiang, Jyun-Yi
關鍵字: Peer to Peer (P2P)
點對點網路
Client-Server Architecture
Digital Rights Management (DRM)
intellectual property
license
主從式架構
數位權利管理
智慧財產權
許可證
出版社: 資訊管理學系所
引用: [1] Internet World Stats, Available: http://www.internetworldstats.com/stats.htm [2] F. Vanier, “World Broadband Statistics: Q4 2008,” Available: http://point-topic.com/contentDownload/operatorsource/dslreports/world%20broadband%20statistics%20q4%202008.pdf, 2009. [3] J.T. Kim, H.K. Park, and E.H. Paik, “Security Issues in Peer-to-peer Systems,” in Proceedings of the 7th International Conference on Advanced Communication Technology, 2005, pp. 1059-1063. [4] E. Sit and R. Morris, “Security Considerations for Peer-to-Peer Distributed Hash Tables,” in Proceedings of the 1st International Workshop on Peer-to-Peer Systems, 2002, pp. 261-269. [5] Z. Dehua and Z. Yuqing, “A Survey of P2P Network Security Issues Based on Protocol Stack,” in Progress on Cryptography, 2004, pp. 209-216. [6] K. Taima, “Can We Ever Charge Napster Users? ,” Multimedia, IEEE, Vol. 9, pp. 76-81, 2002. [7] U. Lechner and B.F. Schmid, “Communities-business Models and System Architectures: The Blueprint of MP3.com, Napster and Gnutella Revisited,” in Proceedings of the 34th Annual Hawaii International Conference on System Sciences, 2001, p.p. 10-10. [8] S. Chen, Z. Zhang, S. Chen, and B. Shi, “Efficient File Search in Non-DHT P2P Networks,” Computer Communications, Vol. 31, 2007, pp. 304-317. [9] J.S. Beuscart, “Napster Users Between Community and Clientele: The Formation and Regulation of A Sociotechnical Group,” Sociologie du Travail, Vol. 47, 2005, pp. e1-e16. [10] R. Stern, “Napster: A Walking Copyright Infringement? ,” Micro, IEEE, Vol. 20, 2000, pp. 4-5, 95. [11] M. F. Radcliffe, “Grokster: The New Law of Third Party Liability for Copyright Infringement Under United States Law,” Computer Law & Security Report, Vol. 22, 2006, pp. 137-149. [12] K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A Survey and Comparison of Peer-to-peer Overlay Network Schemes,” Communications Surveys & Tutorials, Vol. 7, 2005, pp. 72-93. [13] J. Risson and T. Moors, “Survey of Research Towards Robust Peer-to-peer Networks: Search Methods,” Computer Networks, Vol. 50, 2006, pp. 3485-3521. [14] R.Y. Xiao, “Survey on Anonymity in Unstructured Peer-to-Peer Systems,” Journal of Computer Science and Technology, Vol. 23, pp. 660-671, 2008. [15] R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, “Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as The 5th Utility,” Future Generation Computer Systems, Vol. 25, 2009, pp. 599-616. [16] N. Andrade, W. Cirne, F. Brasileiro, and P. Roisenberg, “OurGrid: An Approach to Easily Assemble Grids with Equitable Resource Sharing,” in Job Scheduling Strategies for Parallel Processing, Vol. 2862, 2003, pp. 61-86. [17] I. Gupta, K. Birman, P. Linga, A. Demers, and R. Renesse, “Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead,” in Peer-to-Peer Systems II, Vol. 2735, 2003, pp. 160-169. [18] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Transactions On Networking, Vol. 11, 2003, pp. 17-32. [19] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, “A Scalable Content-addressable Network,” in Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, Vol. 31, 2001, pp. 161-172. [20] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” In Lecture Notes in Computer Science, Vol. 2218, 2001, pp. 329-350. [21] B. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: A Resilient Global-scale Overlay for Service Deployment,” Journal on Selected Areas in Communications, Vol. 22, 2004, pp. 41-53. [22] M. Portmann, P. Sookavatana, S. Ardon, and A. Seneviratne, “The Cost of Peer Discovery and Searching in The Gnutella Peer-to-peer File Sharing Protocol,” in Proceedings of the 9th International Conference on Networks , 2001, pp. 263-268. [23] M. Ripeanu, “Peer-to-peer Architecture Case Study: Gnutella network,” in Proceedings of the 9th International Conference on Peer-to-Peer Computing, 2001, pp. 99-100. [24] I. Clarke, O. Sandberg, B. Wiley, and T. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” Lecture Notes in Computer Science, Vol. 2009, 2001, pp. 46-66. [25] P.L. Piccard, B. Baskin, C. Edwards, G. Spillman, M.H. Sachs, L.P. Paul, B. Brian, E. Craig, S. George, and H.S. Marcus, “eDonkey and eMule,” in Securing Im and P2P Applications for the Enterprise Burlington: Syngress, 2005, pp. 267-283. [26] W. Ku and C.H. Chi, “Survey on The Technological Aspects of Digital Rights Management,” Springer Berlin / Heidelberg Information Security, Vol. 3225, 2004, pp. 391-403. [27] X. Wang, “MPEG-21 Rights Expression Language: Enabling Interoperable Digital Rights Management,” IEEE MultiMedia, Vol. 11, 2004, pp. 84-87. [28] P. Rodriguez, S.M. Tan, and C. Gkantsidis, “On The Feasibility of Commercial, Legal P2P Content Distribution,” ACM SIGCOMM Computer Communication Review, Vol. 36, pp. 75-78, 2006. [29] S. Ortiz, “Proponents Try to Rehabilitate Peer-to-Peer Technology,” Computer, Vol. 41, 2008, pp. 16-19. [30] Y. Cheng, L. Jianbo, Z. Yichun, and S. Aina, “The Implementation Architecture of Content Protection in P2P Network,” in Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops, 2007, pp. 455-458. [31] J. Nutzel and R. Grimm, “Potato System and Signed Media Format - An Alternative Approach to Online Music Business,” in Proceedings of 3rd International Conference on Web Delivering of music, 2003, pp. 23-26. [32] T. Kalker, D.H. J. Epema, P.H. Hartel, R.L. Lagendijk, and M.V. Steen, “Music2Share - Copyright-compliant Music Sharing in P2P Systems,” Proceedings of the IEEE, Vol. 92, 2004, pp. 961-970. [33] G. Gu, B. Zhu, S. Li, and S. Zhang, “PLI: A New Framework to Protect Digital Content for P2P Networks,” Lecture Notes in Computer Science, Vol. 2846, 2003, pp. 206-216. [34] X. Zhang, D. Liu, S. Chen, Z. Zhang and R. Sandhu, “Towards Digital Rights Protection in BitTorrent-like P2P Systems,” in Proceedings of the 15th ACM/SPIE Multimedia Computing and Networking, Vol. 6818, 2008, pp. 68180F-68180F-12. [35] J.Y. Sunq, J.Y. Jeong, and K.S. Yoon, “DRM Enabled P2P Architecture,” in Proceedings of the 8th International Conference on Advanced Communication Technology, Vol. 1, 2006, pp. 487-490. [36] B. Cohen, “Incentives Build Robustness in BitTorrent,” Available: http://www.bittorrent.org/bittorrentecon.pdf , 2003. [37] A. Shamir, “How to Share A Secret,” Communications of the ACM, Vol. 22, 1979, pp. 612-613. [38] A. Shamir, “Identity-Based Cryptosystems and Signature Schemes,” in Proceedings of CRYPTO 84 on Advances in cryptology, 1985, pp. 47-53. [39] D. Boneh and M. Franklin, “Identity-Based Encryption from The Weil Pairing,” SIAM Journal on Computing, Vol. 32, 2001, pp. 213-229. [40] K. G. Paterson, “ID-based Signatures from Pairings on Elliptic Curves,” Electronics Letters, Vol. 38, 2002, pp. 1025-1026. [41] Q. Wang and Z. Cao, “Identity Based Proxy Multi-signature,” Journal of Systems and Software, Vol. 80, 2007, pp. 1023-1029. [42] Y. Ming, X.Q. Shen, and Y.M. Wang, “Identity-based Encryption with Wildcards in The Standard Model,” The Journal of China Universities of Posts and Telecommunications, Vol. 16, 2009, pp. 64-68. [43] Y. Yu, B. Yang, Y. Sun,S. lin, and Zhu, “Identity Based Signcryption Scheme without Random oracles,” Computer Standards & Interfaces, Vol. 31, , 2009, pp. 56-62. [44] C.C. Yang, T.Y. Chang, and M.S. Hwang, “A New Anonymous Conference Key Distribution System Based on The Elliptic Curve Discrete Logarithm Problem,” Computer Standards & Interfaces, Vol. 25, 2003, pp. 141-145. [45] C. Gorantla, R. Gangishetti, and A. Saxena, “A Survey of Cryptographic Primitives and Implementations for Hardware-constrained Sensor Network nodes,” Mobile Networks and Applications, Vol. 12, 2005, pp. 231-244. [46] L. Chen, “An Interpretation of Identity-Based Cryptography,” in Foundations of Security Analysis and Design IV, Vol. 4677, 2007, pp. 183-208. [47] R. L. Rivest, “The MD4 Message Digest Algorithm,” in Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, 1991, pp. 303-311 [48] R. Rivest, “The MD5 Message-Digest Algorithm: RFC Editor,” Available: http://www.ietf.org/rfc/rfc1321.txt, 1991. [49] H. Dobbertin, A. Bosselaers, and B. Preneel, “RIPEMD-160: A Strengthened Version of RIPEMD,” in Proceedings of the 3rd International Workshop on Fast Software Encryption, 1996, pp. 71-82. [50] D. Eastlake and P. Jones, “US Secure Hash Algorithm 1 (SHA1): RFC Editor,” Available: http://tools.ietf.org/html/rfc3174, 2001. [51] MasterCard and VISA,“Secure Electronic Transaction (SET) Specification Book 1 Business Description,” MasterCard and VISA, 1997. [52] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, “HyperCuP — Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks,” in Proceedings of the 1st International Workshop on Agents and Peer-to-Peer Computing, Vol. 2530, 2002. [53] X. Shi, J. Han, Y. Liu, and L.M. Ni, “Popularity Adaptive Search in Hybrid P2P Systems,” Journal of Parallel and Distributed Computing, Vol. 69, 2009, pp. 125-134. [54] S.S. Cao, W. Yin, and X.Y. Chen, “A Robust Cluster-based Dynamic-super-node Scheme for Hybrid Peer-to-peer Network,” The Journal of China Universities of Posts and Telecommunications, Vol. 14, 2007, pp. 21-26. [55] Simon .G.M. Koo, K. Kannan, and C.S. George Lee, “On Neighbor-selection Strategy in Hybrid Peer-to-peer Networks,” Future Generation Computer Systems, Vol. 22, 2006, pp. 732-741. [56] Digital Property Rights Language (DPRL), Available: http://www.oasis-open.org/cover/dprl.html [57] Extensible Rights Markup Language (XrML), Available: http://www.xrml.org [58] R. Iannella, “Open Digital Rights Language (ODRL) Version 1.1,” Available: http://www.w3.org/TR/odrl/ [59] Microsoft- Window Media Rights Manager (WMRM), Available: http://www.microsoft.com/windows/windowsmedia/drm/default.aspx [60] IBM- Electronic Media Management System (EMMS), Available: http://www-306.ibm.com/software/data/emms/
摘要: 隨著網際網路的發展,越來越多人使用網路來分享檔案。目前熱門的分享技術叫做點對點網路(Peer to Peer Network)。其概念是每位使用者不只是單純的下載所需的檔案,同時也扮演伺服器提供檔案給其他使用者。因為不需要任何中央伺服器,使用者之間就可以互相交換檔案,所以可以解決在傳統主從式架構下伺服器頻寬瓶頸問題並且可以在此分散式的環境中快速地取得所需的資源。不幸地, P2P網路引起嚴重的侵犯智慧財產權問題。使用者在P2P網路分享一些有版權的檔案,此行為造成內容原創者嚴重的損失。數位權利管理(Digital Rights Management)系統是一項新興的檔案版權保護技術,其能有效保護原創者的檔案版權。在P2P網路環境下的檔案版權保護研究是一新興的議題,所以在這方面研究顯然稀少。然而點對點網路引發的智慧財產權問題已嚴重破壞各國的數位內容產值,有安全的分享平台,才能讓數位內容原創者能安心的創作。因此,本論文將數位權利管理系統加入到點對點網路,提出一個安全的交易架構。在此交易架構裡,如果使用者要求檔案,他必須付款才能得到檔案。使用者亦可將下載的檔案分享出去並取得回饋。原創者可以在此架構裡販賣他創作的檔案播放許可證並獲得收益。使用者可以在安全的、信任的和合法的架構來互相分享檔案並且達到保護檔案版權的目標。
With the growing of network, more and more people use network to share files. The most popular sharing technology is called Peer to Peer (P2P) network. The concept is that each user acts not only as the client to download files, but also as the server to provide files. Because users can share files without any central server, it can resolve the bandwidth bottleneck problem of server in client server architecture and users can get resources quickly in the distributed architecture. Unfortunately, the P2P network causes the serious problem of violating the intellectual property. The users spread some files having copyrights in P2P network and their behaviors cause the property loss of content publishers seriously. Digital Rights Management (DRM) system is a novel technology of file copyrights protection which protects original content publishers' file copyrights efficiently. The research of file copyrights protection in P2P network is rare because it is a novel topic. Moreover, the P2P network causes the intellectual property problem which destroys the gross income of digital contents in some countries. If there has any secure infrastructure, the content publishers can keep their mind on creation. In this thesis, we embed DRM in the P2P network architecture to propose a secure transactional architecture. In this architecture, if a user wants to get files, he needs to pay expenses. Then, he can share files which were downloaded from others and get some feedback. The content publisher can sell content licenses of his created files and gets some feedback. The users can share files together and reach the goal of file copyrights protection in the secure, trustful, and legal architecture.
URI: http://hdl.handle.net/11455/24168
其他識別: U0005-2407200916591100
文章連結: http://www.airitilibrary.com/Publication/alDetailedMesh1?DocID=U0005-2407200916591100
Appears in Collections:資訊管理學系

文件中的檔案:

取得全文請前往華藝線上圖書館



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