对等网络拓扑优化及信任协商关键技术研究
|
摘要
当传统的客户机／服务器模式不再适应今天的互联网需求的时候,一种新的分布式技术——对等网络(Peer-to-peer,P2P)很快受到了人们的重视,并成为研究的热点。由于拓扑结构对P2P网络的各方面性能都有重要的影响,因此优化P2P网络拓扑具有十分重要的意义,而其中P2P网络结构化覆盖的负载均衡是关键问题。P2P网络具有参与主体数量规模大、运行环境异构性强、活动目标的动态性及自主性高等特点,在跨多安全域进行授权及访问控制时,传统的信任方法暴露出很多弱点。而自动信任协商的模式,为解决跨域的隐私保护和信任建立等问题提供了新的思路。因此研究如何实现P2P中的自动信任协商具有非常重要的现实意义。本论文从基于公平性的拓扑结构优化、自动信任协商敏感信息保护及攻击防范、自动信任协商效率、多方自动信任协商等方面对P2P的拓扑结构和自动信任协商机制进行了深入的研究,并提出了相应的解决方案。
本论文的研究工作得到国家高技术研究发展计划(863)项目(2009AA01Z423)、高等学校重大项目培育基金项目(707006)、北京市教委重大共建项目和北京交通大学校基金(2006XM001)项目的支持。论文的主要研究成果如下：
1.提出了一种新的具有递归结构和均匀度分布的P2P协议R-Chord。R-Chord通过递归使用Chord的拓扑构造方法来平衡节点的饱和度,并将节点的度系数控制在节点的最大转发能力范围内,以此来抑制可能出现的超级节点。抑制过程包括4个主要环节,即分裂子环、子环转发、子环扩张和再分裂。R-Chord在避免超级节点的产生、平衡网络负载等方面,具有较好的性能。
2.提出了一种分布式公平性优化算法DFO,用于优化使用CAN协议的P2P系统中的搜索功能。算法利用节点输入效率向量来评价P2P网络的整体转发压力,并为节点转发搜索请求与接受搜索请求分别定义成本和效用函数,建立成本-效用模型。结果表明该算法改进了CAN中局部节点转发压力过高的不足,达到整体效用函数最大化,较优地平衡节点的压力,并能够激励节点参与转发其他节点的搜索请求。
3.提出了访问控制策略间的继承关系,有效防止了因推理导致敏感信息泄露的问题。提出证书有效性踩点验证函数,要求协商过程中,各证书必须满足相关证书的有效性,避免了证书互斥攻击。提出了抗攻击和敏感信息保护的P2P信任协商框架,用于防止自动信任协商中的敏感信息泄露,同时抵抗各种攻击。
4.提出了一个P2P信任协商框架,该框架利用了访问控制策略之间的关系,在传统的策略评估模块中,增加了策略选择算法,能够有效减少协商过程中的交互次数和交换信息量。提出基于费用最小的策略选择算法的目标,是尽可能使得为获取服务费用或权值最小,使得通信和运算时间最小。相比Max-Min策略选择算法和PRUNES策略选择算法,基于费用最小的策略选择算法协商效率最高,由于基于费用最小的策略选择算法能够有效解决策略回环依赖问题,其协商成功率最高。
5.提出了扩展的DARCL策略语言,在DARCL策略语言基础上扩展了披露规则运算功能,并增加了敏感信息访问控制策略。提出了基于着色Petri网的多方信任协商建模方法,以适应P2P网络环境下的多方信任协商场景,克服基本Petri网描述能力有限、网规模过于庞大的缺点。针对P2P网络环境下可能存在恶意节点为获取善意节点的服务或资源,伪造证书与善意节点进行信任协商,提出使用Kailar逻辑对多方信任协商协议信息的不可否认性进行分析,使得自动信任协商协议更加健壮。
When the traditional client/server model is not adapt to the needs of today's Internet, a new distributed computing technology Peer-to-peer (P2P) has been taken seriously soon and become a research hotspot. As the topology structure of P2P network has a very significant impact on the various aspects of P2P network, topology structure optimization of P2P network is very meaningful and load-balancing problem is the key to structured P2P overlay. Because of the involvement of large scale peers, heterogeneous operating environment, and dynamic characteristics and autonomy of activity goals, the traditional methods for trust management expose many weaknesses across multiple security domains to authorize and access control in P2P network. The appearance of Automated Trust Negotiation (ATN) technology addresses the privacy protection and trust establishment issues across multiple security domains, which is establishing trust among strangers without prior trust relationship. Therefore, research on ATN in P2P domain is very meaningful.
The dissertation is supported by The National High Technology Research and Development Program of China (No.2009AA01Z423), Cultivation Fund of the Key Scientific and Technical Innovation Project, Ministry of Education of China (No.707006), major co-constructive project of Beijing Municipal Education Commission, and Fund of Beijing Jiaotong University (2006XM001). The dissertation focuses on topology structure and ATN mechanism of P2P technologies, including fairness-based topology structure optimization, sensitive information protection and attack prevention of ATN, efficiency of ATN, multi-party trust negotiation. In addition, this thesis presents the corresponding solutions. The main contributions of the dissertation are as follows:
1. A new P2P protocol R-Chord is proposed, which has recursive structure and uniform distribution. The basic idea is:in order to suppress the production of super peer, when the network may appear super peer, recursively using the Chord topology network construction method to balance the saturation degree of peer, and controlling saturation degree coefficient of peer within the maximum forwarding capacity. Suppressing process includes four main steps:splitting the sub-ring, sub-ring forward, sub-ring expansion and re-splitting. R-Chord has good performance in restraining the emergence of super peer and making connection distribution equably.
2. Distributed fairly optimal (DFO) algorithm based on CAN protocol is proposed, which uses peer's up/down bandwidth usage and overlay multicast link efficiency defined by utility function as standard. DFO defines request/response utility function respective and evaluates global transmit overload based on peer input efficiency vector to conform a fire restrict. DFO can reduce average query latency and global bandwidth cost by optimizing global utility. Simulative results and analysis has shown that DFO improved on hot spot problem in CAN, can achieve the purpose of minimum global query latency and maximal transmit overload balance.
3. The inheritance relationship between access control policies is presented, which can effectively prevent the reasoning leading to sensitive information leakage problem. The location function which is checking out credential validation is proposed, and it requires each credential must satisfy validity of the relevant credential preventing mutually exclusive attacks from other credentials in the process of ATN. A P2P trust negotiation framework based on anti-attack and sensitive information protection is provided, which is used to prevent sensitive information leakage, and resistance to a variety of attacks in the process of ATN.
4. A P2P trust negotiation framework is proposed, which adds Strategy Selection Algorithm into traditional Strategic Assessment Module using the relationship between the access control policies. The Strategy Selection Algorithm can effectively reduce the number of interaction and exchange of information in the process of ATN. A new Minimal-cost-based Strategy Selection Algorithm is provided, which is aimed to make cost or weight of accessing service or running time of communication and computing as minimal as possible. Comparing with Max-Min and PRUNES strategy selection algorithms, the running effiency of this algorithm is highest, and success rate of negotiation is highest because this algorithm can effectively solve cyclic dependency problem.
5. An extended DARCL policy language is proposed, which extends operating function of disclosure rules and adds access control policy for sensitive information. A new modeling method of multiparty trust negotiation based on Coloured Petri-net is presented. The method adapts to multi-party trust negotiation scenarios in P2P network environment, and overcomes the deficiency of restricted description ability and too large scale network in the basic Petri net. There may have some malicious peers in P2P network environment forge credentials and process trust negotiation with good peers in order to obtain services or resources of good peers. In response to this situation, Kailar logic is proposed for the use of non-repudiation protocol information analysis of multi-party trust negotiation to make ATN protocol more robust.
本论文的研究工作得到国家高技术研究发展计划(863)项目(2009AA01Z423)、高等学校重大项目培育基金项目(707006)、北京市教委重大共建项目和北京交通大学校基金(2006XM001)项目的支持。论文的主要研究成果如下：
1.提出了一种新的具有递归结构和均匀度分布的P2P协议R-Chord。R-Chord通过递归使用Chord的拓扑构造方法来平衡节点的饱和度,并将节点的度系数控制在节点的最大转发能力范围内,以此来抑制可能出现的超级节点。抑制过程包括4个主要环节,即分裂子环、子环转发、子环扩张和再分裂。R-Chord在避免超级节点的产生、平衡网络负载等方面,具有较好的性能。
2.提出了一种分布式公平性优化算法DFO,用于优化使用CAN协议的P2P系统中的搜索功能。算法利用节点输入效率向量来评价P2P网络的整体转发压力,并为节点转发搜索请求与接受搜索请求分别定义成本和效用函数,建立成本-效用模型。结果表明该算法改进了CAN中局部节点转发压力过高的不足,达到整体效用函数最大化,较优地平衡节点的压力,并能够激励节点参与转发其他节点的搜索请求。
3.提出了访问控制策略间的继承关系,有效防止了因推理导致敏感信息泄露的问题。提出证书有效性踩点验证函数,要求协商过程中,各证书必须满足相关证书的有效性,避免了证书互斥攻击。提出了抗攻击和敏感信息保护的P2P信任协商框架,用于防止自动信任协商中的敏感信息泄露,同时抵抗各种攻击。
4.提出了一个P2P信任协商框架,该框架利用了访问控制策略之间的关系,在传统的策略评估模块中,增加了策略选择算法,能够有效减少协商过程中的交互次数和交换信息量。提出基于费用最小的策略选择算法的目标,是尽可能使得为获取服务费用或权值最小,使得通信和运算时间最小。相比Max-Min策略选择算法和PRUNES策略选择算法,基于费用最小的策略选择算法协商效率最高,由于基于费用最小的策略选择算法能够有效解决策略回环依赖问题,其协商成功率最高。
5.提出了扩展的DARCL策略语言,在DARCL策略语言基础上扩展了披露规则运算功能,并增加了敏感信息访问控制策略。提出了基于着色Petri网的多方信任协商建模方法,以适应P2P网络环境下的多方信任协商场景,克服基本Petri网描述能力有限、网规模过于庞大的缺点。针对P2P网络环境下可能存在恶意节点为获取善意节点的服务或资源,伪造证书与善意节点进行信任协商,提出使用Kailar逻辑对多方信任协商协议信息的不可否认性进行分析,使得自动信任协商协议更加健壮。
When the traditional client/server model is not adapt to the needs of today's Internet, a new distributed computing technology Peer-to-peer (P2P) has been taken seriously soon and become a research hotspot. As the topology structure of P2P network has a very significant impact on the various aspects of P2P network, topology structure optimization of P2P network is very meaningful and load-balancing problem is the key to structured P2P overlay. Because of the involvement of large scale peers, heterogeneous operating environment, and dynamic characteristics and autonomy of activity goals, the traditional methods for trust management expose many weaknesses across multiple security domains to authorize and access control in P2P network. The appearance of Automated Trust Negotiation (ATN) technology addresses the privacy protection and trust establishment issues across multiple security domains, which is establishing trust among strangers without prior trust relationship. Therefore, research on ATN in P2P domain is very meaningful.
The dissertation is supported by The National High Technology Research and Development Program of China (No.2009AA01Z423), Cultivation Fund of the Key Scientific and Technical Innovation Project, Ministry of Education of China (No.707006), major co-constructive project of Beijing Municipal Education Commission, and Fund of Beijing Jiaotong University (2006XM001). The dissertation focuses on topology structure and ATN mechanism of P2P technologies, including fairness-based topology structure optimization, sensitive information protection and attack prevention of ATN, efficiency of ATN, multi-party trust negotiation. In addition, this thesis presents the corresponding solutions. The main contributions of the dissertation are as follows:
1. A new P2P protocol R-Chord is proposed, which has recursive structure and uniform distribution. The basic idea is:in order to suppress the production of super peer, when the network may appear super peer, recursively using the Chord topology network construction method to balance the saturation degree of peer, and controlling saturation degree coefficient of peer within the maximum forwarding capacity. Suppressing process includes four main steps:splitting the sub-ring, sub-ring forward, sub-ring expansion and re-splitting. R-Chord has good performance in restraining the emergence of super peer and making connection distribution equably.
2. Distributed fairly optimal (DFO) algorithm based on CAN protocol is proposed, which uses peer's up/down bandwidth usage and overlay multicast link efficiency defined by utility function as standard. DFO defines request/response utility function respective and evaluates global transmit overload based on peer input efficiency vector to conform a fire restrict. DFO can reduce average query latency and global bandwidth cost by optimizing global utility. Simulative results and analysis has shown that DFO improved on hot spot problem in CAN, can achieve the purpose of minimum global query latency and maximal transmit overload balance.
3. The inheritance relationship between access control policies is presented, which can effectively prevent the reasoning leading to sensitive information leakage problem. The location function which is checking out credential validation is proposed, and it requires each credential must satisfy validity of the relevant credential preventing mutually exclusive attacks from other credentials in the process of ATN. A P2P trust negotiation framework based on anti-attack and sensitive information protection is provided, which is used to prevent sensitive information leakage, and resistance to a variety of attacks in the process of ATN.
4. A P2P trust negotiation framework is proposed, which adds Strategy Selection Algorithm into traditional Strategic Assessment Module using the relationship between the access control policies. The Strategy Selection Algorithm can effectively reduce the number of interaction and exchange of information in the process of ATN. A new Minimal-cost-based Strategy Selection Algorithm is provided, which is aimed to make cost or weight of accessing service or running time of communication and computing as minimal as possible. Comparing with Max-Min and PRUNES strategy selection algorithms, the running effiency of this algorithm is highest, and success rate of negotiation is highest because this algorithm can effectively solve cyclic dependency problem.
5. An extended DARCL policy language is proposed, which extends operating function of disclosure rules and adds access control policy for sensitive information. A new modeling method of multiparty trust negotiation based on Coloured Petri-net is presented. The method adapts to multi-party trust negotiation scenarios in P2P network environment, and overcomes the deficiency of restricted description ability and too large scale network in the basic Petri net. There may have some malicious peers in P2P network environment forge credentials and process trust negotiation with good peers in order to obtain services or resources of good peers. In response to this situation, Kailar logic is proposed for the use of non-repudiation protocol information analysis of multi-party trust negotiation to make ATN protocol more robust.
引文
[1]Talia D., TRUNFLO P. Toward a synergy between p2p and grid. IEEE Internet Computing,2003,7(4):94-96.
[2]Napster.http://www.napster.com.
[3]Johan Pouwelse, Pawel Garbacki, Dick Epema, Henk Sips. The Bittorrent P2P File-Sharing System:Measurements and Analysis. Lecture Notes in Computer Science, Peer-to-Peer Systems IV, Springer Berlin/Heidelberg,3640/2005: 205-216.
[4]eMule. http://www.emule-project.net/.
[5]M. Ripeanu. Peer-to-Peer Architecture Case Study:Gnutella Network. Proceedings of the First International Conference on Peer-to-Peer Computing, IEEE Computer Society Washington, DC, USA,2001.
[6]S. A. Baset, H. G.Schulzrinne. An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. Proceedings In INFOCOM 2006,25th IEEE International Conference on Computer Communications,2006:1-11.
[7]David P. Anderson, Jeff Cobb, Eric Korpela, Matt Lebofsky, Dan Werthimer. SETI@home:an experiment in public-resource computing. Communications of the ACM,2002,45(11):56-61.
[8]Tiziano Mengotti. GPU, a framework for distributed computing over Gnutella [D]. Master Thesis in Computer Science, Switzerland,2004. http://gpu.sourceforge.net/ gpu_p2p/.
[9]J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi,S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, B. Zhao. Oceanstore:An architecture for global-scale persistent storage. Processings of the ACM ASPLOS, November 2002.
[10]Gong Li. Project JXTA:A Technology Overview,2002. http://www.jxta.org/.
[11]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, H. Balakrishnan. Chord:A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking.2003,11(1):17-32.
[12]A. Rowstron, P. Druschel. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proceedings of the Middleware,2001.
[13]B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, J. D. Kubiatowicz. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
[14]S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker. A scalable content addressable network. Processings of the ACM SIGCOMM,2001:161-172.
[15]D. Malkhi, M. Naor, D. Ratajczak. Viceroy:a scalable anddynamic emulation of the butterfly. Processings of the ACMPODC'02, Monterey, CA, USA, July 2002: 183-192.
[16]Petar Maymounkov, David Mazieres. Kademlia:A Peer-to-peer Information System Based on the XOR Metric. Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, 2002:53-65.
[17]黄宇,金蓓弘.非结构化P2P系统Overlay优化技术综述.小型微型计算机系统.2008,29(2)：1-8.
[18]Deshpande H., Bawa M., Garcia Molina H. Streaming live media over a Pee-to-Peer network. Technical Report, Stanford University,2001(8).
[19]Duc A., Kien A., Tai T.A Peer-to-Peer architecture for media streaming. IEEE, 2004,22(1):121-133.
[20]Li Xiao, Yunhao Liu, Ni L. M. Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Transactions on Computers.2005,54(9): 1091-1103.
[21]Yunhao Liu, Li Xiao, Xiaomei Liu, Ni, L.M., Xiaodong Zhang. Location awareness in unstructured peer-to-peer systems. IEEE Transactions on Parallel and Distributed Systems,2005,16(2):163-174.
[22]Sripanidkulchai K., Maggs B., Zhang, H. Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. Proceedings of IEEE INFOCOM, 2003.
[23]Sonesh Surana, Brighten Godfrey, Karthik Lakshminarayanan, Richard Karp, Ion Stoica. Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation,2006,63(3).
[24]Godfrey B., Lakshminarayanan K., Surana S., Karp R., Stoica I. Load balancing in dynamic structured P2P systems. INFOCOM 2004, Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies,7-11 March 2004,(4):2253-2262.
[25]Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed hash tables. LNCS.Berlin:Springer-Verlag,2003.80-87.
[26]Ledlie J, Seltzer M. Distributed, secure load balancing with skew, heterogeneity, and churn. Proceeding of the IEEE Infocom.2005.Washington:IEEE Computer Society,2005.1419-1430.
[27]李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法.计算机研究与发展,2006,43(9)：1579-1585.
[28]熊伟,谢冬青,焦炳旺,刘洁.一种结构化P2P协议中的自适应负载均衡方法.软件学报,2009,20(3)：660-670.
[29]Kamvar SD, Schlosser MT. The EigenTrust algorithm for reputation management in P2P networks. Proceedings of the 12th International Conference of WWW, Budapest, Hungary,2003:640-651.
[30]Kamvar SD, Schlosser MT. EigenRep:Reputation management in P2P networks. In:Lawrence S, ed. Proceeding of the 12th Int'l World Wide Web Conf. Budapest: ACM Press,123-134.
[31]Shanshan Song, Kai Hwang, Runfang Zhou,Yu-Kwong Kwok:Trusted P2P Transactions with Fuzzy Reputation Aggregation. IEEE Internet Computing,2005, 9(6):24-34.
[32]Griffiths N., Kuo-Ming Chao,Younas M. Fuzzy Trust for Peer-to-Peer Systems. 26th IEEE International Conference on Distributed Computing Systems Workshops,2006:73-73.
[33]Hongwei Chen, Zhiwei Ye. Research of P2P Trust Decision-making.12th International Conference on Computer Supported Cooperative Work in Design, Xi; an,2008:793-796.
[34]Wang Y., Vassileva J. Bayesian network trust model in peer-to-peer networks. Proceeding of the 2nd International Workshop on Agents and Peer-to-Peer Computing. Berlin, Springer-Verlag,2004:23-34.
[35]田春岐,邹仕洪,王文东,程时端.一种新的基于改进型D-S证据理论的P2P信任模型.电子与信息学报,2008,30(6):1480-1484.
[36]李建欣,怀进鹏,李先贤.自动信任协商研究.软件学报,2006,17(1):124133.
[37]Winsborough WH, Seamons KE, Jones VE. Automated trust negotiation. DARPA Information Survivability Conference and Exposition. New York:IEEE Press, 2000:88-102.
[38]廖振松,金海,李赤松,邹德清.自动信任协商及其发展趋势.软件学报,2006, 17(9)：1933-1948.
[39]Yu T., Winslett M. A unified scheme for resource protection in automated trust negotiation. Proceeding of the 2003 IEEE Symposium on Security and Privacy. Washington, IEEE Computer Society Press,2003:245-257.
[40]姜怡.基于P2P网络模型的开放业务环境下的信任管理研究[D].北京邮电大学博士论文,2008.
[41]Jianxin Li, Dacheng Zhang, Jinpeng Huai, Jie Xu. Context-aware trust negotiation in peer-to-peer service collaborations. Peer-to-Peer Networking and Applications, Springer New York,2009,2(2):164-177.
[42]Charles C. Zhang, Marianne Winslett, MultiTrust:An Authorization Framework with Customizable Distributed Proof Construction. In Proceedings of the Joint Workshop on Foundations of Computer Security, Automated Reasoning for Security Protocol Analysis, and Issues in the Theory of Security,2008.
[43]Fillia Makedon, Sheng Zhang, Zhengyi Le, James Ford, Euripides Loukis. Providing Recommendations in an Open Collaboration System.11th Panhellenic Conference in Informatics,2007:239-248.
[44]Z. Le, J. Ford, V. Karkaletsis, V. Spiliopulos, S. Katsikas, F. Makedon. Secure Group Collaboration in an Open Healthcare Environment. Proceeding of the 4th Annual International Conference on Information Communication Technologies in Health, Samos, Greece,2006.
[45]Ye S., Makedon, F., Ford, J. Collaborative automated trust negotiation in peer-to-peer systems.4th International Conference on Peer-to-Peer Computing, Washington, DC., USA, IEEE Computer Society,2004:108-115.
[46]冯真,张红旗,刘育楠.自动信任协商在P2P系统中的应用.计算机工程,2007,33(6)：132-133.
[47]李建军,熊选东,谭晓贞.基于多环的Chord改进算法.计算机工程,2010,36(2)：116-118.
[48]陈东锋、杨寿保、彭小燕.TaChord:a Chord System Using Topology-Aware Routing and super peers.东南大学学报(英文版),2004,20(3):273-278.
[49]Hongwei Chen, Zhiwei Ye. BChord:Bi-directional Routing DHT based on Chord. 12th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2008),Xi'an,16-18 April 2008:410-415.
[50]Xu Xiang. K-Chord:A Flexible Peer-to-Peer Resource Location Protocol.2008 International Conference on Computer Science and Software Engineering,2008: 86-89.
[51]Zhao, B.Y., J.D. Kubiatowicz, and A.D. Joseph, Tapestry:An Infrastructure for Fault-tolerant. Wide-area Location,2001:University of California at Berkeley.
[52]Joung, Y.-J. and J.-C. Wang. Reducing maintenance overhead in Chord via heterogeneity. Cluster Computing and the Grid,2005.
[53]Binzenhofer, A., D. Staehle, and R. Henjes. On the stability of chord-based P2P systems. Global Telecommunications Conference,2005.
[54]Chiola, G, Cordasco, G, Gargano, L., et al. Optimizing the finger table in chord-like DHTs. Parallel and Distributed Processing Symposium,2006.
[55]Pierre Fraigniaud, Philippe Gauron. D2B:a de Bruijn Based Content-Addressable Network. Theoretical Computer Science.2006,355(1):65-79.
[56]熊继平,齐庆虎,洪佩琳,李津生.内容寻址网络中几种负载均衡优化方法.电子与信息学报.2006,28(8)：1488-1491.
[57]Damiani E, Vimercati D C, Paraboschi S, et al. A reputation-based approach for choosing reliable resources in peer-to-peer networks. Computer and communications security, Washingtion, DC USA,2002:207-221.
[58]Yu B, Singh M P, and Sycara K. Developing trust in large-scale peer-to-peer systems. Multi-Agent Security and Survivability, Philadelphia USA,2004:23-34.
[59]Ciglaric M. Effective message routing in unstructured peer-to-peer overlays. IEE Proceedings, Communications,2005,152(5):673-678.
[60]Ma R. T. B., Lee S. C. M., Lui J. C. S, et al. A game theoretic approach to provide incentive and service differentiation in P2P networks. ACM SIGMETRICS Performance Evaluation Review,2004,32(1):189-201.
[61]Kubiatowicz J., Bindel D., Chen Y. OceanStore:an architecture for global-scale persistent storage. ACM SIGPLAN Notices,2000,35(11):190-201.
[62]Adar E, B. A. H. Free riding on gnutella. First Monday,2000,5(10):176-194.
[63]李庆华,张阳,王多强.P2P网络中基于谣言传播机制的资源搜索算法.计算机应用,2005,25(11)：2465-2471.
[64]Fudenberg D., Tirole J. Game Theory. Cambridge, Mass.:MIT Press,47-72.
[65]Seamons KE., Winslett M., Yu T., Yu L., Jarvis R. Protecting privacy during on-line trust negotiation. Proceedings of the 2nd Workshop on Privacy Enhancing Technologies. Lecture Notes in Computer Science 2482, Springer-Verlag, 2003:129-143.
[66]Li Ninghui, Mitchell JC., Winsborough WH. Design of a role-based trust management framework. Proceedings of IEEE Symposium on Security and Privacy, 2002:114-130.
[67]Yu T. Automated trust establishment in open systems [Ph.D. Thesis]. Illinois: University of Illinois,2003.
[68]R. Bradshaw, J. Holt, K. Seamons. Concealing complex policies with hidden credentials. Proceedings of 11th ACM Conference on Computer and Communications Security, Oct.,2004.
[69]J. Li, N. Li. Policy-hiding Access Control in Open environment. Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing, New York, ACM Press,2005:29-38.
[70]J. Li, N. Li. OACerts:Oblivious attribute certificates. Proceedings of the 3rd Conference on Applied Cryptography and Network Security, Lecture Notes in Computer Science 3531, Springer,2005:301-317.
[71]Li Ninghui, Mitchell JC., Winsborough WH. Design of a role-based trust management framework. Proceedings of IEEE Symposium on Security and Privacy, 2002:114-130.
[72]W. Winsborough, N. Li. Protecting Sensitive Attributes in Automated Trust Negotiation. Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society, New York, USA, ACM Press,2002:41-51.
[73]W. Winsborough, N. Li. Towards Practical Automated Trust Negotiation.3rd International Workshop on Policies for Distributed Systems and Networks, California,2002:92-103.
[74]Keith Irwin,Ting Yu. Preventing Attribute Information Leakage in Automated Trust Negotiation. Proceedings of the 12th ACM Conference on Computer and Communications Security, ACM press,2005:41-51.
[75]T. Yu, M. Winslett. Policy Migration for Sensitive Credentials in Trust Negotiation. ACM Workshop on Privacy in the Electronic Society, Washington, DC., Oct.2003.
[76]Piero Bonatti, Pierangela Samarati, Regulating service access and information release on the Web, Proceedings of the 7th ACM conference on Computer and communications security, Athens, Greece,2000:134-143.
[77]Seamons KE, Winslett M, Yu T. Limiting the disclosure of access control policies during automated trust negotiation. Network and Distributed System Security Symposium, Internet Society Press,2001.
[78]Yu T., Winslett M. A unified scheme for resource protection in automated trust negotiation. Proceeding of the 2003 IEEE Symposium on Security and Privacy. Washington, IEEE Computer Society Press,2003.245-257.
[79]A. Kapadia, G. Sampemane, R. H. Campbell. Know Why Your Access Was Denied:Regulating Feedback for Usable Security. Proceedings of ACM Conference on Computer and Communication Security, New York, ACM Press, 2004.
[80]W. Winsborough, K. Seamons, V. Jones. Automated Trust Negotiation. Proceedings of DARPA Information Survivability Conference and Exposition, IEEE Press,2000:88-102.
[81]Li J., Li N., Wang X., et al. Denial of Service Attacks and Decentralized Trust Management. Securecomm and Workshops,2006:1-12.
[82]Tatyana Ryutov, Li Zhou, Clifford Neuman, Travis Leithead, Kent E. Seamons. Adaptive Trust Netotioation and Access Control. Proceedings of the tenth ACM symposium on Access control models and technologies, Jun.,2005.
[83]Squicciarini A., BertinolE., Ferrari E.,et al. PP-Trust-X:A System for Privacy Preserving Trust Negotiations. ACM Transactions on Information and System Security (TISSEC). New York:ACM press,2007:1-48.
[84]G. Karjoth, M. Schunter, M. Waidner. Platform for Enterprise Privacy Practices: Privacy-enabled Management of Customer Data.2nd Workshop on Privacy Enhancing Technologies, San Francisco, CA,2002.
[85]M. Y. Becker, P. Sewell. Cassandra:distributed access control policies with tunable expressiveness. Proceeding of POLICY'04, IEEE Press,2004:159-168.
[86]Nicola Zannone, Sushil Jajodia, Fabio Massacci, Duminda Wijesekera. Maintaining Privacy on Derived Objects. Proceedings of the 2005 ACM workshop on Privacy in the electronic society, Nov.,2005.
[87]S. Jajodia, P. Samarati, M. L. Sapino, V. S. Subrahmanian. Flexible support for multiple access control policies. ACM Transactions on Database Systems,2001, 26(2):214-260.
[88]J. Camenisch, E. Herreweghen. Design and Implementation of the Idemix Anonymous Credential System. ACM Conference on Computer and Communication Security, Washington DC.,2002.
[89]Hess A, Holt J, Jacobson J, et al. Content-Triggered Trust Negotiation. ACM Transactions on Information and System Security. New York:ACM press,2004,7 (3):428-456.
[90]Olson L., Rosulek M., Winslett M. Harvesting Credentials in Trust Negotiation as an Honest-But-Curious Adversary. Workshop on Privacy in the Electronic Society, 2007.
[91]I. Dinur, K. Nissim. Revealing Information While Preserving Privacy.ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA, June 2003.
[92]A.Hess, J. Jacobson, H. Mills, R. Wamsley, K. Seamons, B. Smith. Advanced Client/Server Authentication in TLS. Network and Distributed System Security Symposium, San Diego,2002:203-214.
[93]Ryutov T., Neuman C., Kim D., et al. Integrated Access Control and Intrusion Detection for Web Servers. IEEE Transactions on Parallel and Distributed Systems. Piscataway, New Jersey:IEEE Press,2003,14(9):841-850.
[94]E. Bertino, E. Ferrari, A. C. Squicciarini. Trust-X:A Peer to Peer Framework for Trust Negotiations. IEEE Transaction on Knowledge and Data Engineering,2004, 16(7):827-842.
[95]E. Bertino, E. Ferrari, A. Squicciarini. X-TNL:An XML-based language for trust negotiation.4th IEEE International Workshop on Policies for Distributed Systems and Networks, Italy, IEEE Computer Society Press,2003:81-84
[96]Seamons KE., Winslett M., Yu T., Yu L., Jarvis R. Protecting privacy during on-line trust negotiation. Proceeding of the 2nd Workshop on Privacy Enhancing Technologies. Lecture Notes in Computer Science 2482, Springer-Verlag,2003: 129-143.
[97]Smith B., Seamons KE., Jones MD. Responding to policies at runtime in TrustBuilder. Proceeding of the 5th International Workshop on Policies for Distributed Systems and Networks, Washington, IEEE Computer Society Press, 2004:149-158.
[98]T. Yu, X. Ma, M. Winslett. PRUNES:An Efficient and Complete Strategy for Automated Trust Negotiation over the Internet. Proceedings of ACM Conference on Computer and Communication Security, New York, ACM Press,2000:210-219.
[99]Weifeng Chen, L. Clarke, James F. Kurose, Donald F. Towsley. Optimizing cost-sensitive trust-negotiation protocols. Proceedings of the 24th Annual Joint Conf. of the IEEE Computer and Communications Societies. Miami, FL, USA. 13-17 March,2005:1431-1442.
[100]He Y, Zhu M., Zheng C. An Efficient and Minimum Sensitivity Cost Negotiation Strategy in Automated Trust Negotiation.2008 International Conference on Computer Science and Software Engineering,2008,(3):182-185.
[101]Charles C. Zhang, Marianne Winslett. Distributed Authorization by Multiparty Trust Negotiation. Lecture Notes in Computer Science 5283:Computer Security, Springer-Verlag,2008:282-299.
[102]姜怡,苏森,陈俊亮.信任协商策略的Petri网建模分析方法.高技术通讯,2006,16(4):342-347.
[103]Hirofumi Yamaki, Masao Fujii, Kousuke Nakatsuka, Toru Ishida. A Dynamic Programming Approach to Automated Trust Negotiation for Multiagent Systems.Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems,25 July 2005:55-65.
[104]Suroop Mohan Chandran, Korporn Panyim, James B. D. Joshi. A Requirements-Driven Trust Framework for Secure Interoperation in Open Environments. Trust Management, Lecture Notes in Computer Science, Springer, Berlin,Heidelberg, 3986/2006:33-47.
[105]刘继超,曾国荪,袁禄来.基于开放网络环境下信任建立的博弈模型.计算机工程,2009,35(2)：167-169.
[106]Seamons KE., Winslett M., Yu T., Smith B., Child E., Jacobson J., Mills H., Yu L. Requirements for policy languages for trust negotiation. Proceeding of the 3rd IEEE International Workshop on Policies for Distributed Systems and Networks. Washington, IEEE Computer Society Press,2002:68-79.
[107]Wolfgang Nejdl, Daniel Olmedilla, Marianne Winslett. PeerTrust:Automated Trust Negotiation for Peers on the Semantic Web. Lecture Notes in Computer Science,Springer, Berlin,Heidelberg,3178/2004:118-132.
[108]Hongwei Chen. Research on Automated Trust Negotiation in Grid Environment. 2007 International Symposium on Distributed Computing and Applications for Business, Engineering and Sciences, Hubei Science and Technology Press, 2007:576-578.
[109]Andro Galinovic.Automated Trust Negotiation Models.http://www.fer.unizg.hr/_download/repository/A.Galinovic,KDI.pdf.
[110]Lory, P. A coloured Petri net trust model.14th International Workshop on Database and Expert Systems Applications (DEXA'03), September 1-5,2003, Prague, Czech Republic. IEEE Computer Society,2003:415-419.
[111]Kurt Jensen, Lars Michael Kristensen, Lisa Wells. Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems. International Journal on Software Tools for Technology Transfer. Springer-Verlag Berlin, Heidelberg, 2007,9(3):213-254.
[112]Feldman M, Papadimitriou C, and Chuang J, et al.Free-riding and whitewashing in peer-to-peer systems.IEEE Journal on Selected Areas in Communications, 2006,24(5):1010-1019.
[113]Lian Q, Zhang Z, and Yang M, et al.. An empirical study of collusion behavior in the maze P2P file-sharing system.27th International Conference on Distributed Computing Systems, Toronto, Ont, Canada, June 22-29,2007:56.
[114]田春岐,邹仕洪,王文东,程时端.构造分布式P2P环境下抗攻击信任管理模型.北京邮电大学学报,2007,30(3)：62-65.
[115]桑永宣,曾吉文.一种新的双方不可否认密码协议及其形式化分析.厦门大学学报(自然科学版),2008,47(5)：635-640.
[116]李艳平,张建中.一种双方不可否认的密码协议.西安电子科技大学学报：自然科学版,2004,31(1)：161-164.
[2]Napster.http://www.napster.com.
[3]Johan Pouwelse, Pawel Garbacki, Dick Epema, Henk Sips. The Bittorrent P2P File-Sharing System:Measurements and Analysis. Lecture Notes in Computer Science, Peer-to-Peer Systems IV, Springer Berlin/Heidelberg,3640/2005: 205-216.
[4]eMule. http://www.emule-project.net/.
[5]M. Ripeanu. Peer-to-Peer Architecture Case Study:Gnutella Network. Proceedings of the First International Conference on Peer-to-Peer Computing, IEEE Computer Society Washington, DC, USA,2001.
[6]S. A. Baset, H. G.Schulzrinne. An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. Proceedings In INFOCOM 2006,25th IEEE International Conference on Computer Communications,2006:1-11.
[7]David P. Anderson, Jeff Cobb, Eric Korpela, Matt Lebofsky, Dan Werthimer. SETI@home:an experiment in public-resource computing. Communications of the ACM,2002,45(11):56-61.
[8]Tiziano Mengotti. GPU, a framework for distributed computing over Gnutella [D]. Master Thesis in Computer Science, Switzerland,2004. http://gpu.sourceforge.net/ gpu_p2p/.
[9]J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi,S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, B. Zhao. Oceanstore:An architecture for global-scale persistent storage. Processings of the ACM ASPLOS, November 2002.
[10]Gong Li. Project JXTA:A Technology Overview,2002. http://www.jxta.org/.
[11]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, H. Balakrishnan. Chord:A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking.2003,11(1):17-32.
[12]A. Rowstron, P. Druschel. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proceedings of the Middleware,2001.
[13]B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, J. D. Kubiatowicz. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
[14]S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker. A scalable content addressable network. Processings of the ACM SIGCOMM,2001:161-172.
[15]D. Malkhi, M. Naor, D. Ratajczak. Viceroy:a scalable anddynamic emulation of the butterfly. Processings of the ACMPODC'02, Monterey, CA, USA, July 2002: 183-192.
[16]Petar Maymounkov, David Mazieres. Kademlia:A Peer-to-peer Information System Based on the XOR Metric. Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, 2002:53-65.
[17]黄宇,金蓓弘.非结构化P2P系统Overlay优化技术综述.小型微型计算机系统.2008,29(2)：1-8.
[18]Deshpande H., Bawa M., Garcia Molina H. Streaming live media over a Pee-to-Peer network. Technical Report, Stanford University,2001(8).
[19]Duc A., Kien A., Tai T.A Peer-to-Peer architecture for media streaming. IEEE, 2004,22(1):121-133.
[20]Li Xiao, Yunhao Liu, Ni L. M. Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Transactions on Computers.2005,54(9): 1091-1103.
[21]Yunhao Liu, Li Xiao, Xiaomei Liu, Ni, L.M., Xiaodong Zhang. Location awareness in unstructured peer-to-peer systems. IEEE Transactions on Parallel and Distributed Systems,2005,16(2):163-174.
[22]Sripanidkulchai K., Maggs B., Zhang, H. Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. Proceedings of IEEE INFOCOM, 2003.
[23]Sonesh Surana, Brighten Godfrey, Karthik Lakshminarayanan, Richard Karp, Ion Stoica. Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation,2006,63(3).
[24]Godfrey B., Lakshminarayanan K., Surana S., Karp R., Stoica I. Load balancing in dynamic structured P2P systems. INFOCOM 2004, Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies,7-11 March 2004,(4):2253-2262.
[25]Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed hash tables. LNCS.Berlin:Springer-Verlag,2003.80-87.
[26]Ledlie J, Seltzer M. Distributed, secure load balancing with skew, heterogeneity, and churn. Proceeding of the IEEE Infocom.2005.Washington:IEEE Computer Society,2005.1419-1430.
[27]李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法.计算机研究与发展,2006,43(9)：1579-1585.
[28]熊伟,谢冬青,焦炳旺,刘洁.一种结构化P2P协议中的自适应负载均衡方法.软件学报,2009,20(3)：660-670.
[29]Kamvar SD, Schlosser MT. The EigenTrust algorithm for reputation management in P2P networks. Proceedings of the 12th International Conference of WWW, Budapest, Hungary,2003:640-651.
[30]Kamvar SD, Schlosser MT. EigenRep:Reputation management in P2P networks. In:Lawrence S, ed. Proceeding of the 12th Int'l World Wide Web Conf. Budapest: ACM Press,123-134.
[31]Shanshan Song, Kai Hwang, Runfang Zhou,Yu-Kwong Kwok:Trusted P2P Transactions with Fuzzy Reputation Aggregation. IEEE Internet Computing,2005, 9(6):24-34.
[32]Griffiths N., Kuo-Ming Chao,Younas M. Fuzzy Trust for Peer-to-Peer Systems. 26th IEEE International Conference on Distributed Computing Systems Workshops,2006:73-73.
[33]Hongwei Chen, Zhiwei Ye. Research of P2P Trust Decision-making.12th International Conference on Computer Supported Cooperative Work in Design, Xi; an,2008:793-796.
[34]Wang Y., Vassileva J. Bayesian network trust model in peer-to-peer networks. Proceeding of the 2nd International Workshop on Agents and Peer-to-Peer Computing. Berlin, Springer-Verlag,2004:23-34.
[35]田春岐,邹仕洪,王文东,程时端.一种新的基于改进型D-S证据理论的P2P信任模型.电子与信息学报,2008,30(6):1480-1484.
[36]李建欣,怀进鹏,李先贤.自动信任协商研究.软件学报,2006,17(1):124133.
[37]Winsborough WH, Seamons KE, Jones VE. Automated trust negotiation. DARPA Information Survivability Conference and Exposition. New York:IEEE Press, 2000:88-102.
[38]廖振松,金海,李赤松,邹德清.自动信任协商及其发展趋势.软件学报,2006, 17(9)：1933-1948.
[39]Yu T., Winslett M. A unified scheme for resource protection in automated trust negotiation. Proceeding of the 2003 IEEE Symposium on Security and Privacy. Washington, IEEE Computer Society Press,2003:245-257.
[40]姜怡.基于P2P网络模型的开放业务环境下的信任管理研究[D].北京邮电大学博士论文,2008.
[41]Jianxin Li, Dacheng Zhang, Jinpeng Huai, Jie Xu. Context-aware trust negotiation in peer-to-peer service collaborations. Peer-to-Peer Networking and Applications, Springer New York,2009,2(2):164-177.
[42]Charles C. Zhang, Marianne Winslett, MultiTrust:An Authorization Framework with Customizable Distributed Proof Construction. In Proceedings of the Joint Workshop on Foundations of Computer Security, Automated Reasoning for Security Protocol Analysis, and Issues in the Theory of Security,2008.
[43]Fillia Makedon, Sheng Zhang, Zhengyi Le, James Ford, Euripides Loukis. Providing Recommendations in an Open Collaboration System.11th Panhellenic Conference in Informatics,2007:239-248.
[44]Z. Le, J. Ford, V. Karkaletsis, V. Spiliopulos, S. Katsikas, F. Makedon. Secure Group Collaboration in an Open Healthcare Environment. Proceeding of the 4th Annual International Conference on Information Communication Technologies in Health, Samos, Greece,2006.
[45]Ye S., Makedon, F., Ford, J. Collaborative automated trust negotiation in peer-to-peer systems.4th International Conference on Peer-to-Peer Computing, Washington, DC., USA, IEEE Computer Society,2004:108-115.
[46]冯真,张红旗,刘育楠.自动信任协商在P2P系统中的应用.计算机工程,2007,33(6)：132-133.
[47]李建军,熊选东,谭晓贞.基于多环的Chord改进算法.计算机工程,2010,36(2)：116-118.
[48]陈东锋、杨寿保、彭小燕.TaChord:a Chord System Using Topology-Aware Routing and super peers.东南大学学报(英文版),2004,20(3):273-278.
[49]Hongwei Chen, Zhiwei Ye. BChord:Bi-directional Routing DHT based on Chord. 12th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2008),Xi'an,16-18 April 2008:410-415.
[50]Xu Xiang. K-Chord:A Flexible Peer-to-Peer Resource Location Protocol.2008 International Conference on Computer Science and Software Engineering,2008: 86-89.
[51]Zhao, B.Y., J.D. Kubiatowicz, and A.D. Joseph, Tapestry:An Infrastructure for Fault-tolerant. Wide-area Location,2001:University of California at Berkeley.
[52]Joung, Y.-J. and J.-C. Wang. Reducing maintenance overhead in Chord via heterogeneity. Cluster Computing and the Grid,2005.
[53]Binzenhofer, A., D. Staehle, and R. Henjes. On the stability of chord-based P2P systems. Global Telecommunications Conference,2005.
[54]Chiola, G, Cordasco, G, Gargano, L., et al. Optimizing the finger table in chord-like DHTs. Parallel and Distributed Processing Symposium,2006.
[55]Pierre Fraigniaud, Philippe Gauron. D2B:a de Bruijn Based Content-Addressable Network. Theoretical Computer Science.2006,355(1):65-79.
[56]熊继平,齐庆虎,洪佩琳,李津生.内容寻址网络中几种负载均衡优化方法.电子与信息学报.2006,28(8)：1488-1491.
[57]Damiani E, Vimercati D C, Paraboschi S, et al. A reputation-based approach for choosing reliable resources in peer-to-peer networks. Computer and communications security, Washingtion, DC USA,2002:207-221.
[58]Yu B, Singh M P, and Sycara K. Developing trust in large-scale peer-to-peer systems. Multi-Agent Security and Survivability, Philadelphia USA,2004:23-34.
[59]Ciglaric M. Effective message routing in unstructured peer-to-peer overlays. IEE Proceedings, Communications,2005,152(5):673-678.
[60]Ma R. T. B., Lee S. C. M., Lui J. C. S, et al. A game theoretic approach to provide incentive and service differentiation in P2P networks. ACM SIGMETRICS Performance Evaluation Review,2004,32(1):189-201.
[61]Kubiatowicz J., Bindel D., Chen Y. OceanStore:an architecture for global-scale persistent storage. ACM SIGPLAN Notices,2000,35(11):190-201.
[62]Adar E, B. A. H. Free riding on gnutella. First Monday,2000,5(10):176-194.
[63]李庆华,张阳,王多强.P2P网络中基于谣言传播机制的资源搜索算法.计算机应用,2005,25(11)：2465-2471.
[64]Fudenberg D., Tirole J. Game Theory. Cambridge, Mass.:MIT Press,47-72.
[65]Seamons KE., Winslett M., Yu T., Yu L., Jarvis R. Protecting privacy during on-line trust negotiation. Proceedings of the 2nd Workshop on Privacy Enhancing Technologies. Lecture Notes in Computer Science 2482, Springer-Verlag, 2003:129-143.
[66]Li Ninghui, Mitchell JC., Winsborough WH. Design of a role-based trust management framework. Proceedings of IEEE Symposium on Security and Privacy, 2002:114-130.
[67]Yu T. Automated trust establishment in open systems [Ph.D. Thesis]. Illinois: University of Illinois,2003.
[68]R. Bradshaw, J. Holt, K. Seamons. Concealing complex policies with hidden credentials. Proceedings of 11th ACM Conference on Computer and Communications Security, Oct.,2004.
[69]J. Li, N. Li. Policy-hiding Access Control in Open environment. Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing, New York, ACM Press,2005:29-38.
[70]J. Li, N. Li. OACerts:Oblivious attribute certificates. Proceedings of the 3rd Conference on Applied Cryptography and Network Security, Lecture Notes in Computer Science 3531, Springer,2005:301-317.
[71]Li Ninghui, Mitchell JC., Winsborough WH. Design of a role-based trust management framework. Proceedings of IEEE Symposium on Security and Privacy, 2002:114-130.
[72]W. Winsborough, N. Li. Protecting Sensitive Attributes in Automated Trust Negotiation. Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society, New York, USA, ACM Press,2002:41-51.
[73]W. Winsborough, N. Li. Towards Practical Automated Trust Negotiation.3rd International Workshop on Policies for Distributed Systems and Networks, California,2002:92-103.
[74]Keith Irwin,Ting Yu. Preventing Attribute Information Leakage in Automated Trust Negotiation. Proceedings of the 12th ACM Conference on Computer and Communications Security, ACM press,2005:41-51.
[75]T. Yu, M. Winslett. Policy Migration for Sensitive Credentials in Trust Negotiation. ACM Workshop on Privacy in the Electronic Society, Washington, DC., Oct.2003.
[76]Piero Bonatti, Pierangela Samarati, Regulating service access and information release on the Web, Proceedings of the 7th ACM conference on Computer and communications security, Athens, Greece,2000:134-143.
[77]Seamons KE, Winslett M, Yu T. Limiting the disclosure of access control policies during automated trust negotiation. Network and Distributed System Security Symposium, Internet Society Press,2001.
[78]Yu T., Winslett M. A unified scheme for resource protection in automated trust negotiation. Proceeding of the 2003 IEEE Symposium on Security and Privacy. Washington, IEEE Computer Society Press,2003.245-257.
[79]A. Kapadia, G. Sampemane, R. H. Campbell. Know Why Your Access Was Denied:Regulating Feedback for Usable Security. Proceedings of ACM Conference on Computer and Communication Security, New York, ACM Press, 2004.
[80]W. Winsborough, K. Seamons, V. Jones. Automated Trust Negotiation. Proceedings of DARPA Information Survivability Conference and Exposition, IEEE Press,2000:88-102.
[81]Li J., Li N., Wang X., et al. Denial of Service Attacks and Decentralized Trust Management. Securecomm and Workshops,2006:1-12.
[82]Tatyana Ryutov, Li Zhou, Clifford Neuman, Travis Leithead, Kent E. Seamons. Adaptive Trust Netotioation and Access Control. Proceedings of the tenth ACM symposium on Access control models and technologies, Jun.,2005.
[83]Squicciarini A., BertinolE., Ferrari E.,et al. PP-Trust-X:A System for Privacy Preserving Trust Negotiations. ACM Transactions on Information and System Security (TISSEC). New York:ACM press,2007:1-48.
[84]G. Karjoth, M. Schunter, M. Waidner. Platform for Enterprise Privacy Practices: Privacy-enabled Management of Customer Data.2nd Workshop on Privacy Enhancing Technologies, San Francisco, CA,2002.
[85]M. Y. Becker, P. Sewell. Cassandra:distributed access control policies with tunable expressiveness. Proceeding of POLICY'04, IEEE Press,2004:159-168.
[86]Nicola Zannone, Sushil Jajodia, Fabio Massacci, Duminda Wijesekera. Maintaining Privacy on Derived Objects. Proceedings of the 2005 ACM workshop on Privacy in the electronic society, Nov.,2005.
[87]S. Jajodia, P. Samarati, M. L. Sapino, V. S. Subrahmanian. Flexible support for multiple access control policies. ACM Transactions on Database Systems,2001, 26(2):214-260.
[88]J. Camenisch, E. Herreweghen. Design and Implementation of the Idemix Anonymous Credential System. ACM Conference on Computer and Communication Security, Washington DC.,2002.
[89]Hess A, Holt J, Jacobson J, et al. Content-Triggered Trust Negotiation. ACM Transactions on Information and System Security. New York:ACM press,2004,7 (3):428-456.
[90]Olson L., Rosulek M., Winslett M. Harvesting Credentials in Trust Negotiation as an Honest-But-Curious Adversary. Workshop on Privacy in the Electronic Society, 2007.
[91]I. Dinur, K. Nissim. Revealing Information While Preserving Privacy.ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA, June 2003.
[92]A.Hess, J. Jacobson, H. Mills, R. Wamsley, K. Seamons, B. Smith. Advanced Client/Server Authentication in TLS. Network and Distributed System Security Symposium, San Diego,2002:203-214.
[93]Ryutov T., Neuman C., Kim D., et al. Integrated Access Control and Intrusion Detection for Web Servers. IEEE Transactions on Parallel and Distributed Systems. Piscataway, New Jersey:IEEE Press,2003,14(9):841-850.
[94]E. Bertino, E. Ferrari, A. C. Squicciarini. Trust-X:A Peer to Peer Framework for Trust Negotiations. IEEE Transaction on Knowledge and Data Engineering,2004, 16(7):827-842.
[95]E. Bertino, E. Ferrari, A. Squicciarini. X-TNL:An XML-based language for trust negotiation.4th IEEE International Workshop on Policies for Distributed Systems and Networks, Italy, IEEE Computer Society Press,2003:81-84
[96]Seamons KE., Winslett M., Yu T., Yu L., Jarvis R. Protecting privacy during on-line trust negotiation. Proceeding of the 2nd Workshop on Privacy Enhancing Technologies. Lecture Notes in Computer Science 2482, Springer-Verlag,2003: 129-143.
[97]Smith B., Seamons KE., Jones MD. Responding to policies at runtime in TrustBuilder. Proceeding of the 5th International Workshop on Policies for Distributed Systems and Networks, Washington, IEEE Computer Society Press, 2004:149-158.
[98]T. Yu, X. Ma, M. Winslett. PRUNES:An Efficient and Complete Strategy for Automated Trust Negotiation over the Internet. Proceedings of ACM Conference on Computer and Communication Security, New York, ACM Press,2000:210-219.
[99]Weifeng Chen, L. Clarke, James F. Kurose, Donald F. Towsley. Optimizing cost-sensitive trust-negotiation protocols. Proceedings of the 24th Annual Joint Conf. of the IEEE Computer and Communications Societies. Miami, FL, USA. 13-17 March,2005:1431-1442.
[100]He Y, Zhu M., Zheng C. An Efficient and Minimum Sensitivity Cost Negotiation Strategy in Automated Trust Negotiation.2008 International Conference on Computer Science and Software Engineering,2008,(3):182-185.
[101]Charles C. Zhang, Marianne Winslett. Distributed Authorization by Multiparty Trust Negotiation. Lecture Notes in Computer Science 5283:Computer Security, Springer-Verlag,2008:282-299.
[102]姜怡,苏森,陈俊亮.信任协商策略的Petri网建模分析方法.高技术通讯,2006,16(4):342-347.
[103]Hirofumi Yamaki, Masao Fujii, Kousuke Nakatsuka, Toru Ishida. A Dynamic Programming Approach to Automated Trust Negotiation for Multiagent Systems.Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems,25 July 2005:55-65.
[104]Suroop Mohan Chandran, Korporn Panyim, James B. D. Joshi. A Requirements-Driven Trust Framework for Secure Interoperation in Open Environments. Trust Management, Lecture Notes in Computer Science, Springer, Berlin,Heidelberg, 3986/2006:33-47.
[105]刘继超,曾国荪,袁禄来.基于开放网络环境下信任建立的博弈模型.计算机工程,2009,35(2)：167-169.
[106]Seamons KE., Winslett M., Yu T., Smith B., Child E., Jacobson J., Mills H., Yu L. Requirements for policy languages for trust negotiation. Proceeding of the 3rd IEEE International Workshop on Policies for Distributed Systems and Networks. Washington, IEEE Computer Society Press,2002:68-79.
[107]Wolfgang Nejdl, Daniel Olmedilla, Marianne Winslett. PeerTrust:Automated Trust Negotiation for Peers on the Semantic Web. Lecture Notes in Computer Science,Springer, Berlin,Heidelberg,3178/2004:118-132.
[108]Hongwei Chen. Research on Automated Trust Negotiation in Grid Environment. 2007 International Symposium on Distributed Computing and Applications for Business, Engineering and Sciences, Hubei Science and Technology Press, 2007:576-578.
[109]Andro Galinovic.Automated Trust Negotiation Models.http://www.fer.unizg.hr/_download/repository/A.Galinovic,KDI.pdf.
[110]Lory, P. A coloured Petri net trust model.14th International Workshop on Database and Expert Systems Applications (DEXA'03), September 1-5,2003, Prague, Czech Republic. IEEE Computer Society,2003:415-419.
[111]Kurt Jensen, Lars Michael Kristensen, Lisa Wells. Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems. International Journal on Software Tools for Technology Transfer. Springer-Verlag Berlin, Heidelberg, 2007,9(3):213-254.
[112]Feldman M, Papadimitriou C, and Chuang J, et al.Free-riding and whitewashing in peer-to-peer systems.IEEE Journal on Selected Areas in Communications, 2006,24(5):1010-1019.
[113]Lian Q, Zhang Z, and Yang M, et al.. An empirical study of collusion behavior in the maze P2P file-sharing system.27th International Conference on Distributed Computing Systems, Toronto, Ont, Canada, June 22-29,2007:56.
[114]田春岐,邹仕洪,王文东,程时端.构造分布式P2P环境下抗攻击信任管理模型.北京邮电大学学报,2007,30(3)：62-65.
[115]桑永宣,曾吉文.一种新的双方不可否认密码协议及其形式化分析.厦门大学学报(自然科学版),2008,47(5)：635-640.
[116]李艳平,张建中.一种双方不可否认的密码协议.西安电子科技大学学报：自然科学版,2004,31(1)：161-164.