P2P环境下的信任模型研究
摘要
对等计算(P2P)是近年来研究的热点,其目标是充分利用Internet环境中各种可能的端系统进行大规模的协作计算和资源共享。由于下述问题直接影响了对等计算的可用性和实用性,因此对其研究既有理论意义也有实用价值。P2P计算环境具有开放性以及对等节点的匿名性和自治的特点,由于缺乏对与之交互的节点的可信程度的知识,节点需应对交互过程中可能出现的威胁。引入信任模型量化和评估节点的可信程度,是解决问题的一种方法。
本文着重研究这个方面的问题。主要的贡献概括如下
1.综述了环境下的信任模型。对P2P环境下信任模型的研究工作做了详细地整理、分类和评析。
2.提出了基于节点距离加权推荐的全局信任模型。该模型针对P2P环境下信任模型面临的主要挑战:恶意节点协同伪造信任数据对模型攻击,使得信任评估的结果不真实;信任数据的分布式存储及其安全性。已有的两种全局信任模型建立在信任值高的节点其推荐也更可信这个假设基础上,而在某些类型的恶意节点攻击下,该假设并不成立。因此本模型中,提出使用节点的距离加权其推荐。理论分析和仿真实验表明较已有模型更加适合遏制更广泛类型的恶意节点攻击。给出了一种信任数据的分布式存储方案,提出了加强数据安全性的对信任数据存放节点的匿名性的三个要求。
Nowadays Peer-to-Peer(P2P) computing has become a hot research issue. The goal of P2P computing is to pool end-systems in Internet-scale as more as possible to construct large-scale cooperating and resource-sharing environments.
Because the following problem directly decide the usability and practicability of P2P system, it has been in dire need of a solution. In decentralized P2P environments, due to the anonymous and autonomous nature of peers, they have to manage the risk involved with the interaction without prior experience and knowledge about each other’s reputation. Trust models can be used to quantify and to evaluate the trustworthiness of peers so as to reduce the risk.
The dissertation focuses on this problem, and makes these contributions:
1. A comprehensive survey of trust models in P2P environments is made. The newly-proposed models are analyzed, classified and compared.
2. Distance-weighted Trust Model (DTM), a global trust model, is presented, which includes a mathematical description and a distributed implementation. Trust models in P2P environments have two main challenges: various malicious behavior of peers such as providing fake or misleading recommendation about other peers; decentralized and secure trust data management. Previous global trust models are based on the assumption that the peers with high trust value will give the honest recommendation. But this assumption may not hold in all cases. In DTM, each peer is assigned a unique global trust value, computed by aggregating distant-weighted recommendations of the peers who have interacted with it. Theoretical analyses and experiments show that the scheme is still robust under more general conditions where malicious peers cooperate in an attempt to deliberately subvert the system, converges more quickly and decreases the numbers of inauthentic files downloaded more effectively than previous schemes. Furthermore, a decentralized trust data management scheme is given and the anonymity requirements of peers for securing trust data are also considered.
本文着重研究这个方面的问题。主要的贡献概括如下
1.综述了环境下的信任模型。对P2P环境下信任模型的研究工作做了详细地整理、分类和评析。
2.提出了基于节点距离加权推荐的全局信任模型。该模型针对P2P环境下信任模型面临的主要挑战:恶意节点协同伪造信任数据对模型攻击,使得信任评估的结果不真实;信任数据的分布式存储及其安全性。已有的两种全局信任模型建立在信任值高的节点其推荐也更可信这个假设基础上,而在某些类型的恶意节点攻击下,该假设并不成立。因此本模型中,提出使用节点的距离加权其推荐。理论分析和仿真实验表明较已有模型更加适合遏制更广泛类型的恶意节点攻击。给出了一种信任数据的分布式存储方案,提出了加强数据安全性的对信任数据存放节点的匿名性的三个要求。
Nowadays Peer-to-Peer(P2P) computing has become a hot research issue. The goal of P2P computing is to pool end-systems in Internet-scale as more as possible to construct large-scale cooperating and resource-sharing environments.
Because the following problem directly decide the usability and practicability of P2P system, it has been in dire need of a solution. In decentralized P2P environments, due to the anonymous and autonomous nature of peers, they have to manage the risk involved with the interaction without prior experience and knowledge about each other’s reputation. Trust models can be used to quantify and to evaluate the trustworthiness of peers so as to reduce the risk.
The dissertation focuses on this problem, and makes these contributions:
1. A comprehensive survey of trust models in P2P environments is made. The newly-proposed models are analyzed, classified and compared.
2. Distance-weighted Trust Model (DTM), a global trust model, is presented, which includes a mathematical description and a distributed implementation. Trust models in P2P environments have two main challenges: various malicious behavior of peers such as providing fake or misleading recommendation about other peers; decentralized and secure trust data management. Previous global trust models are based on the assumption that the peers with high trust value will give the honest recommendation. But this assumption may not hold in all cases. In DTM, each peer is assigned a unique global trust value, computed by aggregating distant-weighted recommendations of the peers who have interacted with it. Theoretical analyses and experiments show that the scheme is still robust under more general conditions where malicious peers cooperate in an attempt to deliberately subvert the system, converges more quickly and decreases the numbers of inauthentic files downloaded more effectively than previous schemes. Furthermore, a decentralized trust data management scheme is given and the anonymity requirements of peers for securing trust data are also considered.
引文
[1] Clay Shriky. What is p2p... and what isnt?[EB/OL]. November 2000. http://www.openp2p.com/pub/2000/shriky1-whatisp2p.html.
[2]郑纬民,胡进锋,代亚非等.对等计算研究概论[R].技术发展年度报告.中国计算机学会.2004.http://www.ccf.org.cn
[3] N.Leibowitza,A.Bergman,r.Ben-Shaul,And A.Shavit. Are file swaping networks cacheable? Characterizing P2P Traffic[A]. In:Proceeding of 7th International Workshop on Web Content Caching and Distribution[C].(WCW02).Aug.2002.
[4] Liang J, Kumar R, Xi Y, Ross K. Pollution in p2p file sharing systems[A]. In:Proceedings of IEEE Infocom 2005[C]. Miami,FL,USA:IEEE Press,2005. Volume 2,1174-1185.
[5] Roman, Kurmanowytsch. Omnix: An Open Peer-to-Peer Middleware Framework[EB/OL]. February [D]. 2004:11-12
[6] H.Homayounfar, F.Wang, And S.Areibi. Adcanced P2P Architecture Using Autonomous Agents[A]. In:The ISCA 15TH International Conference on Computer Applications in Industry and Engineering[C], ACM Press, San Diego, California,2002,11,pp:115-118
[7] Buragohain C, Agrawal D, Suri S. A Game Theoretic Framework for Incentive in P2P Systems[A]. In: Proceedings of the Third International on Peer-to-Peer Computing(P2P'03)[C]. IEEE Press,2003,48-56.
[8] Kamvar SD, Schlosser MT. The Eigentrust algorithm for reputation management in P2P networks[A]. In: the Proceedings of the 12th International World Wide Web Conf. Budapest[C]: ACM Press, 2003: 640-651.
[9]窦文,王怀民.构造基于推荐的Peer-to-Peer环境下的Trust模型[J].软件学报, 2004,15(4): 571-583.
[10] Choon Hoong Ding, Sarana Nutanong., Rajkumar Buyya. P2P Networks for Content Sharing[R]. Technicall Report , Grid-TR-2003-7, Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia, December 2003
[11] Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S, Weath-Erspoon H, Weimer W, Wells C, Zhao B. Oceanstore: An architecture for global-scale persistent storage[J]. ACM SIGPLAN Notices,2000,35(11):190-201.
[12] Frank Dabek, m.Frans Kasshoek, David Karger, Robert Morris, Ion Stoica. Wide-area cooperative storage with CFS[A]. In: Proceedings of ACM SOSP 2001[C]
[13] Dou Wen, Jia Yan, Liu Zhong, Zou Peng. A Simple Approach to Build P2P Global ComputingOverlay Network[A]. In:13th International Conference on Artificial Neural Network[C], LNCS 2714, Springer-Verlag, Istanbul, Turkey, 2003.6,pp 607-614
[14] Saroiu S, Gummadi PK, Gribble SD. A Measurement Study of Peer-to-Peer File Sharing Systems[A]. In: Proceedings of Multimedia Computing and Networking 2002. SPIE Press, 2002.
[15] J.Ledlie, J.Taylor, L.Serban, and M.Seltzer. Self-organization in peer-to-peer systems[R]. In 10th SIGOPS European Workshop, September 2002.
[16] Ion Stoica, Robert Morris, David Karger. Chord:A scalable peer-to-peer lookup service for Internet applications[R]. Technical Report, MIT, 2002
[17] Sylvia Ratnasamy, Paul Francis, Mark Handley. A Scalable Content-Addressable Network[A]. In: Proceedings of ACM SIGCOMM2001[C], San Diego, Califormia, USA.
[18] Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[A]. In: IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001)[C]. Heidelberg, Germany, 2001, 329-350
[19] Ben Y. Zhao, John Kubiatowicz and Anthony D.Joseph. Tapestry: An Infrastruture for Fault-tolerant Wide-area Location and Routing[R]. Technical Report No.UCB/CSD-01-1141, University of California Berkeley.
[20] Dejan S.Milojicic, Vana Kalogeraki, Rajan Lukose, Kiran Nagaraja. Peer-to-Peer Computing[R] Technical ReportHPL-2002-57, HP Laboratories Palo Alto. July, 2003
[21] Bernard Barber. The logic and limits of trust[M]. New Brunswick, NJ: Rutgers University Press.1983
[22] James S.Coleman.(1990).邓方译.社会理论的基础(上)[M].北京:社会科学文献出版社,1992
[23] Drew Fudenberg, Jean Tirole. Game theory[M]. Cambridge, MA: MIT Press, 2000
[24] Roger C.Mayer, James H.Davis, F.David Schoorman. An integrative model of organizational trust[J]. Academy of Management Review 1995.20(3). 709-734
[25] Y.Wang, J.Vassileva. Bayesian Network-Based Trust Model[A]. In: Proc. of IEEE/WIC International Conference on Web Intelligence(WI'2003)[C]: 372-378, October 13-17, 2003, Halifax, Canada.
[26] S. Wasserman, K.Faust. Social Network Analysis: Methods and Applications[M]. Cambridge University Press. 1994
[27] James P.Anderson. Computer Security Technology Planning Study[P]. ESF-TR-73-51, ESD/AFSC, Hanscom AFB, Bedford, Ma01731. Oct,1972.
[28] Michael Burrows, Martin Abadi, Rioger Needham. A logic of Authentication[A]. In:Proceedings of the twelfth ACM symposium on Operating systems principles[C]. 1989. pages:1-13
[29] Commission of the European Communities. Information technology security evaluation criteria(ITSEC)[R]. Technical Report Version 1.2, Brussels, Belgium, June 1991.
[30] Radia Perlman. An overview of PKI trust models[J]. IEEE Network, 1999, 13(6):38-43.
[31] D.E.Houser and J.Wooders. Reputation in Actions: Theory and Evidence from eBay[J]. Journal of Economics and Management Strategy. 2005
[32] C.Dellarocas. Building Trust On-Line: The Design of Robust Reputation Mechanisms for Online Trading Communities[M]. Idea Book Publishing 2004, pp.95-113.
[33] P.Resnick, K.Kuwabara, R.Zeckhauser, E.Friedman. Reputation Systems[J]. Communications of the ACM, 43(13)[C], 2000, pp.45-48
[34] M. Gupta, P.Judge, M.Ammar. A Reputation System for Peer-to-Peer Networks[A]. In: Proceedings of 13th ACM Workshop on Network and Operating Systems Support for Digital Audio and Video. ACM Press[C]. (2003) 144-152.
[35] Xiong L, Liu L. PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electrinic Communities[A]. In:IEEE Transaction on Knowledge and Data Engineering[C],2004,16(7): 843-857.
[2]郑纬民,胡进锋,代亚非等.对等计算研究概论[R].技术发展年度报告.中国计算机学会.2004.http://www.ccf.org.cn
[3] N.Leibowitza,A.Bergman,r.Ben-Shaul,And A.Shavit. Are file swaping networks cacheable? Characterizing P2P Traffic[A]. In:Proceeding of 7th International Workshop on Web Content Caching and Distribution[C].(WCW02).Aug.2002.
[4] Liang J, Kumar R, Xi Y, Ross K. Pollution in p2p file sharing systems[A]. In:Proceedings of IEEE Infocom 2005[C]. Miami,FL,USA:IEEE Press,2005. Volume 2,1174-1185.
[5] Roman, Kurmanowytsch. Omnix: An Open Peer-to-Peer Middleware Framework[EB/OL]. February [D]. 2004:11-12
[6] H.Homayounfar, F.Wang, And S.Areibi. Adcanced P2P Architecture Using Autonomous Agents[A]. In:The ISCA 15TH International Conference on Computer Applications in Industry and Engineering[C], ACM Press, San Diego, California,2002,11,pp:115-118
[7] Buragohain C, Agrawal D, Suri S. A Game Theoretic Framework for Incentive in P2P Systems[A]. In: Proceedings of the Third International on Peer-to-Peer Computing(P2P'03)[C]. IEEE Press,2003,48-56.
[8] Kamvar SD, Schlosser MT. The Eigentrust algorithm for reputation management in P2P networks[A]. In: the Proceedings of the 12th International World Wide Web Conf. Budapest[C]: ACM Press, 2003: 640-651.
[9]窦文,王怀民.构造基于推荐的Peer-to-Peer环境下的Trust模型[J].软件学报, 2004,15(4): 571-583.
[10] Choon Hoong Ding, Sarana Nutanong., Rajkumar Buyya. P2P Networks for Content Sharing[R]. Technicall Report , Grid-TR-2003-7, Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia, December 2003
[11] Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S, Weath-Erspoon H, Weimer W, Wells C, Zhao B. Oceanstore: An architecture for global-scale persistent storage[J]. ACM SIGPLAN Notices,2000,35(11):190-201.
[12] Frank Dabek, m.Frans Kasshoek, David Karger, Robert Morris, Ion Stoica. Wide-area cooperative storage with CFS[A]. In: Proceedings of ACM SOSP 2001[C]
[13] Dou Wen, Jia Yan, Liu Zhong, Zou Peng. A Simple Approach to Build P2P Global ComputingOverlay Network[A]. In:13th International Conference on Artificial Neural Network[C], LNCS 2714, Springer-Verlag, Istanbul, Turkey, 2003.6,pp 607-614
[14] Saroiu S, Gummadi PK, Gribble SD. A Measurement Study of Peer-to-Peer File Sharing Systems[A]. In: Proceedings of Multimedia Computing and Networking 2002. SPIE Press, 2002.
[15] J.Ledlie, J.Taylor, L.Serban, and M.Seltzer. Self-organization in peer-to-peer systems[R]. In 10th SIGOPS European Workshop, September 2002.
[16] Ion Stoica, Robert Morris, David Karger. Chord:A scalable peer-to-peer lookup service for Internet applications[R]. Technical Report, MIT, 2002
[17] Sylvia Ratnasamy, Paul Francis, Mark Handley. A Scalable Content-Addressable Network[A]. In: Proceedings of ACM SIGCOMM2001[C], San Diego, Califormia, USA.
[18] Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[A]. In: IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001)[C]. Heidelberg, Germany, 2001, 329-350
[19] Ben Y. Zhao, John Kubiatowicz and Anthony D.Joseph. Tapestry: An Infrastruture for Fault-tolerant Wide-area Location and Routing[R]. Technical Report No.UCB/CSD-01-1141, University of California Berkeley.
[20] Dejan S.Milojicic, Vana Kalogeraki, Rajan Lukose, Kiran Nagaraja. Peer-to-Peer Computing[R] Technical ReportHPL-2002-57, HP Laboratories Palo Alto. July, 2003
[21] Bernard Barber. The logic and limits of trust[M]. New Brunswick, NJ: Rutgers University Press.1983
[22] James S.Coleman.(1990).邓方译.社会理论的基础(上)[M].北京:社会科学文献出版社,1992
[23] Drew Fudenberg, Jean Tirole. Game theory[M]. Cambridge, MA: MIT Press, 2000
[24] Roger C.Mayer, James H.Davis, F.David Schoorman. An integrative model of organizational trust[J]. Academy of Management Review 1995.20(3). 709-734
[25] Y.Wang, J.Vassileva. Bayesian Network-Based Trust Model[A]. In: Proc. of IEEE/WIC International Conference on Web Intelligence(WI'2003)[C]: 372-378, October 13-17, 2003, Halifax, Canada.
[26] S. Wasserman, K.Faust. Social Network Analysis: Methods and Applications[M]. Cambridge University Press. 1994
[27] James P.Anderson. Computer Security Technology Planning Study[P]. ESF-TR-73-51, ESD/AFSC, Hanscom AFB, Bedford, Ma01731. Oct,1972.
[28] Michael Burrows, Martin Abadi, Rioger Needham. A logic of Authentication[A]. In:Proceedings of the twelfth ACM symposium on Operating systems principles[C]. 1989. pages:1-13
[29] Commission of the European Communities. Information technology security evaluation criteria(ITSEC)[R]. Technical Report Version 1.2, Brussels, Belgium, June 1991.
[30] Radia Perlman. An overview of PKI trust models[J]. IEEE Network, 1999, 13(6):38-43.
[31] D.E.Houser and J.Wooders. Reputation in Actions: Theory and Evidence from eBay[J]. Journal of Economics and Management Strategy. 2005
[32] C.Dellarocas. Building Trust On-Line: The Design of Robust Reputation Mechanisms for Online Trading Communities[M]. Idea Book Publishing 2004, pp.95-113.
[33] P.Resnick, K.Kuwabara, R.Zeckhauser, E.Friedman. Reputation Systems[J]. Communications of the ACM, 43(13)[C], 2000, pp.45-48
[34] M. Gupta, P.Judge, M.Ammar. A Reputation System for Peer-to-Peer Networks[A]. In: Proceedings of 13th ACM Workshop on Network and Operating Systems Support for Digital Audio and Video. ACM Press[C]. (2003) 144-152.
[35] Xiong L, Liu L. PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electrinic Communities[A]. In:IEEE Transaction on Knowledge and Data Engineering[C],2004,16(7): 843-857.